Sciweavers

Share
JACM
2002
122views more  JACM 2002»
8 years 11 months ago
Cosmological lower bound on the circuit complexity of a small problem in logic
An exponential lower bound on the circuit complexity of deciding the weak monadic second-order theory of one successor (WS1S) is proved. Circuits are built from binary operations, ...
Larry J. Stockmeyer, Albert R. Meyer
JACM
2002
87views more  JACM 2002»
8 years 11 months ago
Understanding TCP Vegas: a duality model
We view congestion control as a distributed primal
Steven H. Low, Larry L. Peterson, Limin Wang
JACM
2002
107views more  JACM 2002»
8 years 11 months ago
Paradoxes in distributed decisions on optimal load balancing for networks of homogeneous computers
In completely symmetric systems that have homogeneous nodes (hosts, computers, or processors) with identical arrival processes, an optimal static load balancing scheme does not in...
Hisao Kameda, Odile Pourtallier
JACM
2002
94views more  JACM 2002»
8 years 11 months ago
The greedy path-merging algorithm for contig scaffolding
Given a collection of contigs and mate-pairs. The Contig Scaffolding Problem is to order and orientate the given contigs in a manner that is consistent with as many mate-pairs as p...
Daniel H. Huson, Knut Reinert, Eugene W. Myers
JACM
2002
55views more  JACM 2002»
8 years 11 months ago
On a model of indexability and its bounds for range queries
Joseph M. Hellerstein, Elias Koutsoupias, Daniel P...
JACM
2002
87views more  JACM 2002»
8 years 11 months ago
Bounded concurrent timestamp systems using vector clocks
Abstract. Shared registers are basic objects used as communication mediums in asynchronous concurrent computation. A concurrent timestamp system is a higher typed communication obj...
Sibsankar Haldar, Paul M. B. Vitányi
JACM
2002
83views more  JACM 2002»
8 years 11 months ago
Fast context-free grammar parsing requires fast boolean matrix multiplication
In 1975, Valiant showed that Boolean matrix multiplication can be used for parsing contextfree grammars (CFGs), yielding the asympotically fastest (although not practical) CFG par...
Lillian Lee
JACM
2002
93views more  JACM 2002»
8 years 11 months ago
Map graphs
We consider a modified notion of planarity, in which two nations of a map are considered adjacent when they share any point of their boundaries (not necessarily an edge, as planar...
Zhi-Zhong Chen, Michelangelo Grigni, Christos H. P...
JACM
2002
163views more  JACM 2002»
8 years 11 months ago
Formal verification of standards for distance vector routing protocols
We show how to use an interactive theorem prover, HOL, together with a model checker, SPIN, to prove key properties of distance vector routing protocols. We do three case studies: ...
Karthikeyan Bhargavan, Davor Obradovic, Carl A. Gu...
JACM
2002
54views more  JACM 2002»
8 years 11 months ago
Dense quantum coding and quantum finite automata
Andris Ambainis, Ashwin Nayak, Amnon Ta-Shma, Umes...
books