Sciweavers

1237 search results - page 44 / 248
» Strictness and Totality Analysis
Sort
View
ICDT
1997
ACM
138views Database» more  ICDT 1997»
15 years 2 months ago
Tractable Iteration Mechanisms for Bag Languages
Abstract. The goal of this paper is to study tractable iteration mechanisms for bags. The presence of duplicates in bags prevents iteration mechanisms developed in the context of s...
Latha S. Colby, Leonid Libkin
STACS
1994
Springer
15 years 1 months ago
Reachability and the Power of Local Ordering
The L ? = NL question remains one of the major unresolved problems in complexity theory. Both L and NL have logical characterizations as the sets of totally ordered ( ) structures...
Kousha Etessami, Neil Immerman
FSE
2010
Springer
146views Cryptology» more  FSE 2010»
15 years 1 months ago
A Unified Method for Improving PRF Bounds for a Class of Blockcipher Based MACs
This paper provides a unified framework for improving PRF (pseudorandom function) advantages of several popular MACs (message authentication codes) based on a blockcipher modeled a...
Mridul Nandi
NETWORKING
2008
14 years 11 months ago
Towards an ISP-Compliant, Peer-Friendly Design for Peer-to-Peer Networks
Peer-to-peer (P2P) applications are consuming a significant fraction of the total bandwidth of Internet service providers (ISPs). This has become a financial burden to ISPs and if ...
Haiyong Xie 0002, Yang Richard Yang, Avi Silbersch...
EOR
2008
93views more  EOR 2008»
14 years 10 months ago
Approximate methods for convex minimization problems with series-parallel structure
Consider a problem of minimizing a separable, strictly convex, monotone and differentiable function on a convex polyhedron generated by a system of m linear inequalities. The probl...
Adi Ben-Israel, Genrikh Levin, Yuri Levin, Boris R...