Sciweavers

26 search results - page 3 / 6
» stoc 1997
Sort
View
STOC
1997
ACM
111views Algorithms» more  STOC 1997»
13 years 10 months ago
The Swendsen-Wang Process Does Not Always Mix Rapidly
The Swendsen-Wang process provides one possible dynamics for the Qstate Potts model in statistical physics. Computer simulations of this process are widely used to estimate the ex...
Vivek Gore, Mark Jerrum
ECCC
2008
98views more  ECCC 2008»
13 years 6 months ago
Public-Key Cryptosystems from the Worst-Case Shortest Vector Problem
We construct public-key cryptosystems that are secure assuming the worst-case hardness of approximating the minimum distance on n-dimensional lattices to within small poly(n) fact...
Chris Peikert
STOC
2005
ACM
167views Algorithms» more  STOC 2005»
14 years 6 months ago
Approximately counting integral flows and cell-bounded contingency tables
We consider the problem of approximately counting integral flows in a network. We show that there is an fpras based on volume estimation if all capacities are sufficiently large, ...
Mary Cryan, Martin E. Dyer, Dana Randall
STOC
2002
ACM
107views Algorithms» more  STOC 2002»
14 years 6 months ago
Quantum lower bound for the collision problem
The collision problem is to decide whether a function X : {1, . . . , n} {1, . . . , n} is one-to-one or two-to-one, given that one of these is the case. We show a lower bound of...
Scott Aaronson
STOC
1997
ACM
126views Algorithms» more  STOC 1997»
13 years 10 months ago
Page Replacement with Multi-Size Pages and Applications to Web Caching
We consider the paging problem where the pages have varying size. This problem has applications to page replacement policies for caches containing World Wide Web documents. We con...
Sandy Irani