Sciweavers

2150 search results - page 137 / 430
» On a restricted cross-intersection problem
Sort
View
STOC
2006
ACM
141views Algorithms» more  STOC 2006»
16 years 5 months ago
Zero-knowledge against quantum attacks
It is proved that several interactive proof systems are zero-knowledge against general quantum attacks. This includes the Goldreich?Micali?Wigderson classical zero-knowledge proto...
John Watrous
STOC
2005
ACM
146views Algorithms» more  STOC 2005»
16 years 5 months ago
Approximation algorithms for combinatorial auctions with complement-free bidders
We exhibit three approximation algorithms for the allocation problem in combinatorial auctions with complement free bidders. The running time of these algorithms is polynomial in ...
Shahar Dobzinski, Noam Nisan, Michael Schapira
STOC
2005
ACM
163views Algorithms» more  STOC 2005»
16 years 5 months ago
Undirected ST-connectivity in log-space
We present a deterministic, log-space algorithm that solves st-connectivity in undirected graphs. The previous bound on the space complexity of undirected st-connectivity was log4...
Omer Reingold
ICALP
2009
Springer
16 years 5 months ago
Reachability in Stochastic Timed Games
We define stochastic timed games, which extend two-player timed games with probabilities (following a recent approach by Baier et al), and which extend in a natural way continuous-...
Patricia Bouyer, Vojtech Forejt
PODS
2004
ACM
86views Database» more  PODS 2004»
16 years 4 months ago
Frontiers of Tractability for Typechecking Simple XML Transformations
Typechecking consists of statically verifying whether the output of an XML transformation is always conform to an output type for documents satisfying a given input type. We focus...
Wim Martens, Frank Neven