Sciweavers

13 search results - page 1 / 3
» jacm 2002
Sort
View
JACM
2002
54views more  JACM 2002»
13 years 9 months ago
Dense quantum coding and quantum finite automata
Andris Ambainis, Ashwin Nayak, Amnon Ta-Shma, Umes...
JACM
2002
55views more  JACM 2002»
13 years 9 months ago
On a model of indexability and its bounds for range queries
Joseph M. Hellerstein, Elias Koutsoupias, Daniel P...
JACM
2002
73views more  JACM 2002»
13 years 9 months ago
Compactly encoding unstructured inputs with differential compression
Miklós Ajtai, Randal C. Burns, Ronald Fagin...
JACM
2002
87views more  JACM 2002»
13 years 9 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
83views more  JACM 2002»
13 years 9 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