1. Home
  2. Proceedings
  3. FOCS
  4. FOCS 1994
Default Cover Image

Proceedings 35th Annual Symposium on Foundations of Computer Science

Nov. 20 1994 to Nov. 22 1994

Santa Fe, NM, USA

ISBN: 0-8186-6580-7

Table of Contents

Papers
IP over connection-oriented networks and distributional pagingFull-text access may be available. Sign in or learn about subscription options.pp. 424-434
by C. Lund, S. Phillips, N. Reingold
Papers
On-line admission control and circuit routing for high performance computing and communicationFull-text access may be available. Sign in or learn about subscription options.pp. 412-423
by B. Awerbuch, R. Gawlick, T. Leighton, Y. Rabani
Papers
A theory of competitive analysis for distributed algorithmsFull-text access may be available. Sign in or learn about subscription options.pp. 401-411
by M. Ajtai, J. Aspnes, C. Dwork, O. Waarts
Papers
Beyond competitive analysis [on-line algorithms]Full-text access may be available. Sign in or learn about subscription options.pp. 394-400
by E. Koutsoupias, C.H. Papadimitriou
Papers
Program result-checking: a theory of testing meets a test of theoryFull-text access may be available. Sign in or learn about subscription options.pp. 382-392
by M. Blum, H. Wasserman
Papers
Fast and feasible periodic sorting networks of constant depthFull-text access may be available. Sign in or learn about subscription options.pp. 369-380
by M. Kutylowski, K. Lorys, B. Oesterdiekhoff, R. Wanka
Papers
Scheduling multithreaded computations by work stealingFull-text access may be available. Sign in or learn about subscription options.pp. 356-368
by R.D. Blumofe, C.E. Leiserson
Papers
Nearly tight bounds for wormhole routingFull-text access may be available. Sign in or learn about subscription options.pp. 347-355
by A. Ranade, S. Schleimer, D.S. Wilkerson
Papers
On the design of reliable Boolean circuits that contain partially unreliable gatesFull-text access may be available. Sign in or learn about subscription options.pp. 332-346
by D. Kleitman, T. Leighton, Y. Ma
Papers
Products and help bits in decision treesFull-text access may be available. Sign in or learn about subscription options.pp. 318-329
by N. Nisan, S. Rudich, M. Saks
Papers
Efficient oblivious branching programs for threshold functionsFull-text access may be available. Sign in or learn about subscription options.pp. 309-317
by R.K. Sinha, J.S. Thathachar
Papers
A lower bound for the monotone depth of connectivityFull-text access may be available. Sign in or learn about subscription options.pp. 302-308
by A.C.-C. Yao
Papers
On the robustness of functional equationsFull-text access may be available. Sign in or learn about subscription options.pp. 288-299
by R. Rubinfeld
Papers
Randomness-efficient oblivious samplingFull-text access may be available. Sign in or learn about subscription options.pp. 276-287
by M. Bellare, J. Rompel
Papers
Computing with very weak random sourcesFull-text access may be available. Sign in or learn about subscription options.pp. 264-275
by A. Srinivasan, D. Zuckerman
Papers
(De)randomized construction of small sample spaces in /spl Nscr//spl Cscr/Full-text access may be available. Sign in or learn about subscription options.pp. 252-263
by D.R. Karger, D. Koller
Papers
Local optimization of global objectives: competitive distributed deadlock resolution and resource allocationFull-text access may be available. Sign in or learn about subscription options.pp. 240-249
by B. Awerbuch, Y. Azar
Papers
Fast and lean self-stabilizing asynchronous protocolsFull-text access may be available. Sign in or learn about subscription options.pp. 226-239
by G. Itkis, L. Levin
Papers
The load, capacity and availability of quorum systemsFull-text access may be available. Sign in or learn about subscription options.pp. 214-225
by M. Naor, A. Wool
Papers
Rapid rumor ramification: approximating the minimum broadcast timeFull-text access may be available. Sign in or learn about subscription options.pp. 202-213
by R. Ravi
Papers
Estimating the size of the transitive closure in linear timeFull-text access may be available. Sign in or learn about subscription options.pp. 190-200
by E. Cohen
Papers
Maximum (s,t)-flows in planar networks in O(|V|log|V|) timeFull-text access may be available. Sign in or learn about subscription options.pp. 178-189
by K. Weihe
Papers
Long tours and short superstringsFull-text access may be available. Sign in or learn about subscription options.pp. 166-177
by S.R. Kosaraju, J.K. Park, C. Stein
Papers
Finding the k shortest pathsFull-text access may be available. Sign in or learn about subscription options.pp. 154-165
by D. Eppstein
Papers
Efficient average-case algorithms for the modular groupFull-text access may be available. Sign in or learn about subscription options.pp. 143-152
by Jin-Yi Cai, W.H. Fuchs, D. Kozen, Zicheng Lui
Papers
The complexity of the membership problem for 2-generated commutative semigroups of rational matricesFull-text access may be available. Sign in or learn about subscription options.pp. 135-142
by Jin-yi Cai, R.J. Lipton, Y. Zalcstein
Papers
Algorithms for quantum computation: discrete logarithms and factoringFull-text access may be available. Sign in or learn about subscription options.pp. 124-134
by P.W. Shor
Papers
On the power of quantum computationFull-text access may be available. Sign in or learn about subscription options.pp. 116-123
by D.R. Simon
Papers
Algorithmic number theory-the complexity contributionFull-text access may be available. Sign in or learn about subscription options.pp. 88-113
by L.M. Adleman
Papers
The power of team exploration: two robots can learn unlabeled directed graphsFull-text access may be available. Sign in or learn about subscription options.pp. 75-85
by M.A. Bender, D.K. Slonim
Papers
PAC learning with irrelevant attributesFull-text access may be available. Sign in or learn about subscription options.pp. 64-74
by A. Dhagat, L. Hellerstein
Papers
On learning discretized geometric conceptsFull-text access may be available. Sign in or learn about subscription options.pp. 54-63
by N.H. Bshouty, Zhixiang Chen, S. Homer
Papers
An efficient membership-query algorithm for learning DNF with respect to the uniform distributionFull-text access may be available. Sign in or learn about subscription options.pp. 42-53
by J. Jackson
Papers
A note on the /spl theta/ number of Lovasz and the generalized Delsarte boundFull-text access may be available. Sign in or learn about subscription options.pp. 36-39
by M. Szegedy
Papers
Polynomial time randomised approximation schemes for the Tutte polynomial of dense graphsFull-text access may be available. Sign in or learn about subscription options.pp. 24-35
by N. Alon, A. Frieze, D. Welsh
Papers
Finding separator cuts in planar graphs within twice the optimalFull-text access may be available. Sign in or learn about subscription options.pp. 14-23
by N. Garg, H. Saran, V.V. Vazirani
Papers
Approximate graph coloring by semidefinite programmingFull-text access may be available. Sign in or learn about subscription options.pp. 2-13
by D. Karger, R. Motwani, M. Sudan
Papers
On rank vs. communication complexityFull-text access may be available. Sign in or learn about subscription options.pp. 831-836
by N. Nisan, A. Wigderson
Papers
On syntactic versus computational views of approximabilityFull-text access may be available. Sign in or learn about subscription options.pp. 819-830
by S. Khanna, R. Motwani, M. Sudan, U. Vazirani
Papers
Measure on small complexity classes, with applications for BPPFull-text access may be available. Sign in or learn about subscription options.pp. 807-818
by E. Allender, M. Strauss
Papers
Lower bounds on Hilbert's Nullstellensatz and propositional proofsFull-text access may be available. Sign in or learn about subscription options.pp. 794-806
by P. Beame, R. Impagliazzo, J. Krajicek, T. Pitassi, P. Pudlak
Papers
Tractability of parameterized completion problems on chordal and interval graphs: minimum fill-in and physical mappingFull-text access may be available. Sign in or learn about subscription options.pp. 780-791
by H. Kaplan, R. Shamir, R.E. Tarjan
Papers
Optimal evolutionary tree comparison by sparse dynamic programmingFull-text access may be available. Sign in or learn about subscription options.pp. 770-779
by M. Farach, M. Thorup
Papers
Maximum agreement subtree in a set of evolutionary trees-metrics and efficient algorithmsFull-text access may be available. Sign in or learn about subscription options.pp. 758-769
by D. Keselman, A. Amir
Papers
Fully dynamic cycle-equivalence in graphsFull-text access may be available. Sign in or learn about subscription options.pp. 744-755
by M.R. Henzinger
Papers
Optimizing static calendar queuesFull-text access may be available. Sign in or learn about subscription options.pp. 732-743
by K.B. Erickson, R.E. Ladner, A. LaMarca
Papers
Multi-index hashing for information retrievalFull-text access may be available. Sign in or learn about subscription options.pp. 722-731
by D. Greene, M. Parnas, F. Yao
Papers
A new efficient radix sortFull-text access may be available. Sign in or learn about subscription options.pp. 714-721
by A. Andersson, S. Nilsson
Papers
Randomized and deterministic algorithms for geometric spanners of small diameterFull-text access may be available. Sign in or learn about subscription options.pp. 703-712
by S. Arya, D.M. Mount, M. Smid
Papers
More output-sensitive geometric algorithmsFull-text access may be available. Sign in or learn about subscription options.pp. 695-702
by K.L. Clarkson
Papers
Parallel algorithms for higher-dimensional convex hullsFull-text access may be available. Sign in or learn about subscription options.pp. 683-694
by N.M. Amato, M.T. Goodrich, E.A. Ramos
Papers
A spectral approach to lower boundsFull-text access may be available. Sign in or learn about subscription options.pp. 674-682
by B. Chazelle
Papers
Markov chains and polynomial time algorithmsFull-text access may be available. Sign in or learn about subscription options.pp. 656-671
by R. Kannan
Papers
Set constraints with projections are in NEXPTIMEFull-text access may be available. Sign in or learn about subscription options.pp. 642-653
by W. Charatonik, L. Pacholski
Papers
On the combinatorial and algebraic complexity of quantifier eliminationFull-text access may be available. Sign in or learn about subscription options.pp. 632-641
by S. Basu, R. Pollack, M.-F. Roy
Papers
A polynomial-time algorithm for deciding equivalence of normed context-free processesFull-text access may be available. Sign in or learn about subscription options.pp. 623-631
by Y. Hirshfeld, M. Jerrum, F. Moller
Papers
Graph connectivity and monadic NPFull-text access may be available. Sign in or learn about subscription options.pp. 614-622
by T. Schwentick
Papers
Priority encoding transmissionFull-text access may be available. Sign in or learn about subscription options.pp. 604-612
by A. Albanese, J. Blomer, J. Edmonds, M. Luby, M. Sudan
Papers
Tail bounds for occupancy and the satisfiability threshold conjectureFull-text access may be available. Sign in or learn about subscription options.pp. 592-603
by A. Kamath, R. Motwani, K. Palem, P. Spirakis
Papers
The geometry of graphs and some of its algorithmic applicationsFull-text access may be available. Sign in or learn about subscription options.pp. 577-591
by N. Linial, E. London, Y. Rabinovich
Papers
Expander codesFull-text access may be available. Sign in or learn about subscription options.pp. 566-576
by M. Sipser, D.A. Spielman
Papers
On the computation of Boolean functions by analog circuits of bounded fan-inFull-text access may be available. Sign in or learn about subscription options.pp. 553-564
by G. Turan, F. Vatan
Papers
Complexity lower bounds for computation trees with elementary transcendental function gatesFull-text access may be available. Sign in or learn about subscription options.pp. 548-552
by D. Grigoriev, N. Vorobjov
Papers
An O(n/sup 1+/spl epsiv// log b) algorithm for the complex roots problemFull-text access may be available. Sign in or learn about subscription options.pp. 540-547
by C.A. Neff, J.H. Reif
Papers
Algebraic computation trees in characteristic p>0Full-text access may be available. Sign in or learn about subscription options.pp. 534-539
by M. Ben-Or
Papers
The localization problem for mobile robotsFull-text access may be available. Sign in or learn about subscription options.pp. 521-531
by J.M. Kleinberg
Papers
Motion planning on a graphFull-text access may be available. Sign in or learn about subscription options.pp. 511-520
by C.H. Papadimitriou, P. Raghavan, M. Sudan, H. Tamaki
Papers
Randomized simplex algorithms on Klee-Minty cubesFull-text access may be available. Sign in or learn about subscription options.pp. 502-510
by B. Gartner, G.M. Ziegler
Papers
"Go with the winners" algorithmsFull-text access may be available. Sign in or learn about subscription options.pp. 492-501
by D. Aldous, U. Vazirani
Papers
Reducibility and completeness in multi-party private computationsFull-text access may be available. Sign in or learn about subscription options.pp. 478-489
by E. Kushilevitz, S. Micali, R. Ostrovsky
Papers
On the complexity of bounded-interaction and noninteractive zero-knowledge proofsFull-text access may be available. Sign in or learn about subscription options.pp. 466-477
by J. Kilian
Papers
On monotone formula closure of SZKFull-text access may be available. Sign in or learn about subscription options.pp. 454-465
by A. De Santis, G. Di Crescenzo, G. Persiano, M. Yung
Papers
CS proofsFull-text access may be available. Sign in or learn about subscription options.pp. 436-453
by S. Micali
Papers
Proceedings 35th Annual Symposium on Foundations of Computer ScienceFreely available from IEEE.pp. 0_1-0_1
Showing 74 out of 74