The Community for Technology Leaders
2013 IEEE 54th Annual Symposium on Foundations of Computer Science (1994)
Santa Fe, NM, USA
Nov. 20, 1994 to Nov. 22, 1994
ISBN: 0-8186-6580-7
TABLE OF CONTENTS
Papers

IP over connection-oriented networks and distributional paging (PDF)

S. Phillips , AT&T Bell Labs., Murray Hill, NJ, USA
N. Reingold , AT&T Bell Labs., Murray Hill, NJ, USA
C. Lund , AT&T Bell Labs., Murray Hill, NJ, USA
pp. 424-434

A theory of competitive analysis for distributed algorithms (PDF)

C. Dwork , IBM Almaden Res. Center, San Jose, CA, USA
M. Ajtai , IBM Almaden Res. Center, San Jose, CA, USA
O. Waarts , IBM Almaden Res. Center, San Jose, CA, USA
J. Aspnes , IBM Almaden Res. Center, San Jose, CA, USA
pp. 401-411

Beyond competitive analysis [on-line algorithms] (PDF)

E. Koutsoupias , California Univ., Los Angeles, CA, USA
pp. 394-400

Program result-checking: a theory of testing meets a test of theory (PDF)

M. Blum , Dept. of Comput. Sci., California Univ., Berkeley, CA, USA
H. Wasserman , Dept. of Comput. Sci., California Univ., Berkeley, CA, USA
pp. 382-392

Fast and feasible periodic sorting networks of constant depth (PDF)

M. Kutylowski , Inst. of Comput. Sci., Wroclaw Univ., Poland
K. Lorys , Inst. of Comput. Sci., Wroclaw Univ., Poland
pp. 369-380

Scheduling multithreaded computations by work stealing (PDF)

C.E. Leiserson , Lab. for Comput. Sci., MIT, Cambridge, MA, USA
R.D. Blumofe , Lab. for Comput. Sci., MIT, Cambridge, MA, USA
pp. 356-368

Nearly tight bounds for wormhole routing (PDF)

A. Ranade , Div. of Comput. Sci., California Univ., Berkeley, CA, USA
pp. 347-355

On the design of reliable Boolean circuits that contain partially unreliable gates (PDF)

T. Leighton , Dept. of Math., MIT, Cambridge, MA, USA
D. Kleitman , Dept. of Math., MIT, Cambridge, MA, USA
Y. Ma , Dept. of Math., MIT, Cambridge, MA, USA
pp. 332-346

Products and help bits in decision trees (PDF)

N. Nisan , Dept. of Comput. Sci., Hebrew Univ., Jerusalem, Israel
pp. 318-329

Efficient oblivious branching programs for threshold functions (PDF)

J.S. Thathachar , Dept. of Comput. Sci.&Eng., Washington Univ., Seattle, WA, USA
R.K. Sinha , Dept. of Comput. Sci.&Eng., Washington Univ., Seattle, WA, USA
pp. 309-317

A lower bound for the monotone depth of connectivity (PDF)

A.C.-C. Yao , Dept. of Comput. Sci., Princeton Univ., NJ, USA
pp. 302-308

On the robustness of functional equations (PDF)

R. Rubinfeld , Cornell Univ., Ithaca, NY, USA
pp. 288-299

Randomness-efficient oblivious sampling (PDF)

M. Bellare , IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA
pp. 276-287

Computing with very weak random sources (PDF)

A. Srinivasan , Sch. of Math., Inst. for Adv. Study, Princeton, NJ, USA
pp. 264-275

Fast and lean self-stabilizing asynchronous protocols (PDF)

L. Levin , Boston Univ., MA, USA
G. Itkis , Boston Univ., MA, USA
pp. 226-239

The load, capacity and availability of quorum systems (PDF)

M. Naor , Dept. of Appl. Math.&Comput. Sci., Weizmann Inst. of Sci., Rehovot, Israel
A. Wool , Dept. of Appl. Math.&Comput. Sci., Weizmann Inst. of Sci., Rehovot, Israel
pp. 214-225

Rapid rumor ramification: approximating the minimum broadcast time (PDF)

R. Ravi , Dept. of Comput. Sci., Princeton Univ., NJ, USA
pp. 202-213

Estimating the size of the transitive closure in linear time (PDF)

E. Cohen , AT&T Bell Labs., Murray Hill, NJ, USA
pp. 190-200

Maximum (s,t)-flows in planar networks in O(|V|log|V|) time (PDF)

K. Weihe , Fakultat fur Math., Konstanz Univ., Germany
pp. 178-189

Long tours and short superstrings (PDF)

S.R. Kosaraju , Dept. of Comput. Sci., Johns Hopkins Univ., Baltimore, MD, USA
pp. 166-177

Finding the k shortest paths (PDF)

D. Eppstein , Dept. of Inf.&Comput. Sci., California Univ., Irvine, CA, USA
pp. 154-165

Algorithms for quantum computation: discrete logarithms and factoring (PDF)

P.W. Shor , AT&T Bell Labs., Murray Hill, NJ, USA
pp. 124-134

On the power of quantum computation (PDF)

D.R. Simon , Microsoft Corp., Redmond, WA, USA
pp. 116-123

Algorithmic number theory-the complexity contribution (PDF)

L.M. Adleman , Dept. of Comput. Sci., Univ. of Southern California, Los Angeles, CA, USA
pp. 88-113

The power of team exploration: two robots can learn unlabeled directed graphs (PDF)

M.A. Bender , Aiken Comput. Lab., Harvard Univ., Cambridge, MA, USA
pp. 75-85

PAC learning with irrelevant attributes (PDF)

A. Dhagat , Dept. of Electr. Eng.&Comput. Sci., Wisconsin Univ., Milwaukee, WI, USA
pp. 64-74

On learning discretized geometric concepts (PDF)

N.H. Bshouty , Dept. of Comput. Sci., Calgary Univ., Alta., Canada
pp. 54-63

An efficient membership-query algorithm for learning DNF with respect to the uniform distribution (PDF)

J. Jackson , Dept. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA
pp. 42-53

Polynomial time randomised approximation schemes for the Tutte polynomial of dense graphs (PDF)

N. Alon , Raymond&Beverly Sackler Fac. of Exact Sci., Tel Aviv Univ., Israel
pp. 24-35

Finding separator cuts in planar graphs within twice the optimal (PDF)

V.V. Vazirani , Dept. of Comput. Sci.&Eng., Indian Inst. of Technol., New Delhi, India
N. Garg , Dept. of Comput. Sci.&Eng., Indian Inst. of Technol., New Delhi, India
H. Saran , Dept. of Comput. Sci.&Eng., Indian Inst. of Technol., New Delhi, India
pp. 14-23

Approximate graph coloring by semidefinite programming (PDF)

R. Motwani , Stanford Univ., CA, USA
D. Karger , Stanford Univ., CA, USA
pp. 2-13

On rank vs. communication complexity (PDF)

N. Nisan , Inst. of Comput. Sci., Hebrew Univ., Jerusalem, Israel
A. Wigderson , Inst. of Comput. Sci., Hebrew Univ., Jerusalem, Israel
pp. 831-836

On syntactic versus computational views of approximability (PDF)

R. Motwani , Dept. of Comput. Sci., Stanford Univ., CA, USA
S. Khanna , Dept. of Comput. Sci., Stanford Univ., CA, USA
pp. 819-830

Measure on small complexity classes, with applications for BPP (PDF)

E. Allender , Dept. of Comput. Sci., Rutgers Univ., New Brunswick, NJ, USA
pp. 807-818

Lower bounds on Hilbert's Nullstellensatz and propositional proofs (PDF)

P. Beame , Dept. of Comput. Sci.&Eng., Washington Univ., Seattle, WA, USA
pp. 794-806

Optimal evolutionary tree comparison by sparse dynamic programming (PDF)

M. Farach , Dept. of Comput. Sci., Rutgers Univ., Piscataway, NJ, USA
pp. 770-779

Fully dynamic cycle-equivalence in graphs (PDF)

M.R. Henzinger , Dept. of Comput. Sci., Cornell Univ., Ithaca, NY, USA
pp. 744-755

Optimizing static calendar queues (PDF)

K.B. Erickson , Washington Univ., Seattle, WA, USA
A. LaMarca , Washington Univ., Seattle, WA, USA
R.E. Ladner , Washington Univ., Seattle, WA, USA
pp. 732-743

A new efficient radix sort (PDF)

A. Andersson , Dept. of Comput. Sci., Lund Univ., Sweden
pp. 714-721

More output-sensitive geometric algorithms (PDF)

K.L. Clarkson , AT&T Bell Labs., Murray Hill, NJ, USA
pp. 695-702

Parallel algorithms for higher-dimensional convex hulls (PDF)

N.M. Amato , Texas A&M Univ., College Station, TX, USA
pp. 683-694

A spectral approach to lower bounds (PDF)

B. Chazelle , Dept. of Comput. Sci., Princeton Univ., NJ, USA
pp. 674-682

Markov chains and polynomial time algorithms (PDF)

R. Kannan , Dept. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA
pp. 656-671

On the combinatorial and algebraic complexity of quantifier elimination (PDF)

S. Basu , Dept. of Comput. Sci., Courant Inst. of Math. Sci., New York, NY, USA
pp. 632-641

Graph connectivity and monadic NP (PDF)

T. Schwentick , Inst. fur Inf., Mainz Univ., Germany
pp. 614-622

Priority encoding transmission (PDF)

A. Albanese , Int. Comput. Sci. Inst., Berkeley, CA, USA
pp. 604-612

Tail bounds for occupancy and the satisfiability threshold conjecture (PDF)

A. Kamath , Dept. of Comput. Sci., Stanford Univ., CA, USA
R. Motwani , Dept. of Comput. Sci., Stanford Univ., CA, USA
pp. 592-603

The geometry of graphs and some of its algorithmic applications (PDF)

N. Linial , Inst. of Comput. Sci., Hebrew Univ., Jerusalem, Israel
pp. 577-591

Expander codes (PDF)

D.A. Spielman , Dept. of Math., MIT, Cambridge, MA, USA
M. Sipser , Dept. of Math., MIT, Cambridge, MA, USA
pp. 566-576

On the computation of Boolean functions by analog circuits of bounded fan-in (PDF)

G. Turan , Dept. of Math. Stat.&Comput. Sci., Illinois Univ., Chicago, IL, USA
F. Vatan , Dept. of Math. Stat.&Comput. Sci., Illinois Univ., Chicago, IL, USA
pp. 553-564

Complexity lower bounds for computation trees with elementary transcendental function gates (PDF)

N. Vorobjov , Dept. of Comput. Sci.&Math., Pennsylvania State Univ., University Park, PA, USA
D. Grigoriev , Dept. of Comput. Sci.&Math., Pennsylvania State Univ., University Park, PA, USA
pp. 548-552

An O(n/sup 1+/spl epsiv// log b) algorithm for the complex roots problem (PDF)

C.A. Neff , IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA
pp. 540-547

Algebraic computation trees in characteristic p>0 (PDF)

M. Ben-Or , Inst. of Comput. Sci., Hebrew Univ., Jerusalem, Israel
pp. 534-539

The localization problem for mobile robots (PDF)

J.M. Kleinberg , Lab. for Comput. Sci., MIT, Cambridge, MA, USA
pp. 521-531

Motion planning on a graph (PDF)

C.H. Papadimitriou , Dept. of Comput. Sci.&Eng., California Univ., San Diego, La Jolla, CA, USA
pp. 511-520

Randomized simplex algorithms on Klee-Minty cubes (PDF)

B. Gartner , Inst. fur Inf., Freie Univ. Berlin, Germany
pp. 502-510

"Go with the winners" algorithms (PDF)

D. Aldous , Dept. of Stat., California Univ., Berkeley, CA, USA
pp. 492-501

Reducibility and completeness in multi-party private computations (PDF)

E. Kushilevitz , Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel
pp. 478-489

On monotone formula closure of SZK (PDF)

A. De Santis , Dipartimento di Inf. ed Applicazioni, Salerno Univ., Italy
pp. 454-465

CS proofs (PDF)

S. Micali , Lab. for Comput. Sci., MIT, Cambridge, MA, USA
pp. 436-453
84 ms
(Ver )