Sciweavers

STOC
1998
ACM
125views Algorithms» more  STOC 1998»
14 years 3 months ago
Spot-Checkers
On Labor Day weekend, the highway patrol sets up spot-checks at random points on the freeways with the intention of deterring a large fraction of motorists from driving incorrectl...
Funda Ergün, Sampath Kannan, Ravi Kumar, Roni...
STOC
1998
ACM
105views Algorithms» more  STOC 1998»
14 years 3 months ago
Concurrent Zero-Knowledge
Abstract. Loosely speaking, an interactive proof is said to be zeroknowledge if the view of every “efficient” verifier can be “efficiently” simulated. An outstanding open ...
Cynthia Dwork, Moni Naor, Amit Sahai
STOC
1998
ACM
121views Algorithms» more  STOC 1998»
14 years 3 months ago
Non-Interactive and Non-Malleable Commitment
A commitment protocol is a fundamental cryptographic primitive used as a basic buildingblock throughoutmodern cryptography. In STOC 1991, Dolev Dwork and Naor showed that in many ...
Giovanni Di Crescenzo, Yuval Ishai, Rafail Ostrovs...
STOC
1998
ACM
96views Algorithms» more  STOC 1998»
14 years 3 months ago
Randomized Protocols for Low Congestion Circuit Routing in Multistage Interconnection Networks
In this paper we study randomized algorithms for circuit switching on multistage networks related to the butterfly. We devise algorithms that route messages by constructing circu...
Richard Cole, Bruce M. Maggs, Friedhelm Meyer auf ...
STOC
1998
ACM
129views Algorithms» more  STOC 1998»
14 years 3 months ago
Planar Map Graphs
We introduce and study a modi ed notion of planarity, in which two regions of a map are considered adjacent when they share any point of their boundaries not an edge, as standard...
Zhi-Zhong Chen, Michelangelo Grigni, Christos H. P...
STOC
1998
ACM
80views Algorithms» more  STOC 1998»
14 years 3 months ago
Algorithms for Capacitated Vehicle Routing
Moses Charikar, Samir Khuller, Balaji Raghavachari
STOC
1998
ACM
167views Algorithms» more  STOC 1998»
14 years 3 months ago
An Improved Approximation Algorithm for Multiway Cut
Given an undirected graph with edge costs and a subset of k nodes called terminals, a multiway cut is a subset of edges whose removal disconnects each terminal from the rest. Mult...
Gruia Calinescu, Howard J. Karloff, Yuval Rabani
STOC
1998
ACM
99views Algorithms» more  STOC 1998»
14 years 3 months ago
Quantum vs. Classical Communication and Computation
Harry Buhrman, Richard Cleve, Avi Wigderson