The Community for Technology Leaders
2013 IEEE 54th Annual Symposium on Foundations of Computer Science (1992)
Pittsburgh, PA, USA
Oct. 24, 1992 to Oct. 27, 1992
ISBN: 0-8186-2900-2
TABLE OF CONTENTS
Papers

Towards a computational theory of statistical tests (PDF)

M. Blum , California Univ., Berkeley, CA, USA
pp. 406-416

On minimum and maximum spanning trees of linearly moving points (PDF)

N. Katoh , Dept. of Manage. Sci., Kobe Univ. of Commerce, Japan
pp. 396-405

Safe and effective determinant evaluation (PDF)

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

Enumerating the k closest pairs optimally (PDF)

M. Smid , Max-Planck-Inst. fur Informatik, Saarbrucken, Germany
H.-P. Lenhof , Max-Planck-Inst. fur Informatik, Saarbrucken, Germany
pp. 380-386

On the completeness of object-creating query languages (PDF)

J. Van den Bussche , Dept. of Math.&Comput. Sci., Antwerp Univ., Belgium
pp. 372-379

Efficient inference of partial types (PDF)

D. Kozen , Dept. of Comput. Sci., Cornell Univ., Ithaca, NY, USA
pp. 363-371

Undecidability of the Horn-clause implication problem (PDF)

J. Marcinkowski , Inst. of Comput. Sci., Wroclaw Univ., Poland
pp. 354-362

The distributed k-server problem-a competitive distributed translator for k-server algorithms (PDF)

Y. Bartal , Dept. of Comput. Sci., Tel-Aviv Univ., Israel
A. Rosen , Dept. of Comput. Sci., Tel-Aviv Univ., Israel
pp. 344-353

Lower bounds on the competitive ratio for mobile user tracking and distributed job scheduling (PDF)

N. Alon , Dept. of Math., Raymond&Beverly Sackler Fac. of Exact Sci., Tel-Aviv Univ., Israel
pp. 334-343

Competitive analysis of financial games (PDF)

R. El-Yaniv , Toronto Univ., Ont., Canada
pp. 327-333

A mildly exponential approximation algorithm for the permanent (PDF)

M. Jerrum , Dept. of Comput. Sci., Edinburgh Univ., UK
pp. 320-326

On the bit extraction problem (PDF)

J. Friedman , Dept. of Comput. Sci., Princeton Univ., NJ, USA
pp. 314-319

Quadratic dynamical systems (PDF)

Y. Rabinovich , Dept. of Comput. Sci., Hebrew Univ., Jerusalem, Israel
pp. 304-313

On the second eigenvalue and linear expansion of regular graphs (PDF)

N. Kahale , MIT Lab. for Comput. Sci., Cambridge, MA, USA
pp. 296-303

Lower bounds on the depth of monotone arithmetic computations (PDF)

B. Schieber , IBM Res. Div., Thomas J. Watson Res. Center, Yorktown Heights, NY, USA
D. Coppersmith , IBM Res. Div., Thomas J. Watson Res. Center, Yorktown Heights, NY, USA
pp. 288-295

Separating the communication complexities of MOD m and MOD p circuits (PDF)

V. Grolmusz , Max Planck Inst., Saarbrucken, Germany
pp. 278-287

Algebraic decision trees and Euler characteristics (PDF)

A. Chi-Chih Yao , Dept. of Comput. Sci., Princeton Univ., NJ, USA
pp. 268-277

Amplification and percolation (probabilistic Boolean functions) (PDF)

M. Dubiner , Tel Aviv Univ., Israel
U. Zwick , Tel Aviv Univ., Israel
pp. 258-267

Truly alphabet-independent two-dimensional pattern matching (PDF)

Z. Galil , Dept. of Comput. Sci., Columbia Univ., New York, NY, USA
pp. 247-256

The asymptotic complexity of merging networks (PDF)

P.B. Miltersen , Dept. of Comput. Sci., Aarhus Univ., Denmark
pp. 236-246

Improved lower bounds for Shellsort (PDF)

C.G. Plaxton , Dept. of Comput. Sci., Texas Univ., Austin, TX, USA
pp. 226-235

On-line load balancing (PDF)

A.Z. Broder , DEC Syst. Res. Center, Palo Alto, CA, USA
A.R. Karlin , DEC Syst. Res. Center, Palo Alto, CA, USA
Y. Azar , DEC Syst. Res. Center, Palo Alto, CA, USA
pp. 218-225

Markov paging (PDF)

A.R. Karlin , DEC Syst. Res. Center, Palo Alto, CA, USA
pp. 208-217

A decomposition theorem and bounds for randomized server problems (PDF)

A. Blum , Sch. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA
pp. 197-207

The complexity of the Hajos calculus (PDF)

T. Pitassi , Dept. of Comput. Sci., Toronto Univ., Ont., Canada
pp. 187-196

Back to the future: towards a theory of timed regular languages (PDF)

R. Alur , AT&T Bell Labs., Murray Hill, NJ, USA
pp. 177-186

Hierarchies in transitive closure logic, stratified Datalog and infinitary logic (PDF)

E. Gradel , Dept. of Math., South Florida Univ., Tampa, FL, USA
pp. 167-176

Fault-tolerant wait-free shared objects (PDF)

P. Jayanti , Cornell Univ., Ithaca, NY, USA
T.D. Chandra , Cornell Univ., Ithaca, NY, USA
S. Toueg , Cornell Univ., Ithaca, NY, USA
pp. 157-166

Clock construction in fully asynchronous parallel systems and PRAM simulation (PDF)

Y. Aumann , Inst. of Math.&Comput. Sci., Hebrew Univ. of Jerusalem, Israel
pp. 147-156

Communication on noisy channels: a coding theorem for computation (PDF)

L.J. Schulman , Dept. of Math., MIT, Cambridge, MA, USA
pp. 724-733

Processor-efficient parallel solution of linear systems. II. The positive characteristic and singular cases (PDF)

E. Kaltofen , Dept. of Comput. Sci., Rensselaer Polytech. Inst., Troy, NY, USA
pp. 714-723

Halvers and expanders (switching) (PDF)

M. Ajtai , IBM San Jose, CA, USA
pp. 686-692

Maximizing non-linear concave functions in fixed dimension (PDF)

S. Toledo , Lab. for Comput. Sci., MIT, Cambridge, MA, USA
pp. 676-685

A class of logic problems solvable by linear programming (PDF)

M. Conforti , Dipartmento di Matematica, Padova Univ., Italy
pp. 670-675

Approximate max flow on small depth networks (PDF)

E. Cohen , AT&T Bell Labs., Murray Hill, NJ, USA
pp. 648-658

The complexity of parallel prefix problems on small domains (PDF)

S. Chaudhuri , Dept. of Comput. Sci., Waterloo Univ., Ont., Canada
pp. 638-647

Waste makes haste: tight bounds for loose parallel sorting (PDF)

R. Raman , Max-Planck-Inst. fur Info., Saarbrucken, Germany
T. Hagerup , Max-Planck-Inst. fur Info., Saarbrucken, Germany
pp. 628-637

Mick gets some (the odds are on his side) (satisfiability) (PDF)

V. Chvatal , Dept. of Comput. Sci., Rutgers Univ., New Brunswick, NJ, USA
pp. 620-627

Tiling a polygon with rectangles (PDF)

C. Kenyon , LIP ENS-Lyon, France
pp. 610-619

Tighter bounds on the exact complexity of string matching (PDF)

R. Hariharan , Courant Inst., New York Univ., NY, USA
R. Cole , Courant Inst., New York Univ., NY, USA
pp. 600-609

Optimal parallel hull construction for simple polygons in O(log log n) time (PDF)

H. Wagener , Fachbereich Inf., Tech. Univ. Berlin, Germany
pp. 593-599

Efficient minimum cost matching using quadrangle inequality (PDF)

A. Aggarwal , IBM Res. Div., Thomas J. Watson Res. Center, Yorktown Heights, NY, USA
A. Bar-Noy , IBM Res. Div., Thomas J. Watson Res. Center, Yorktown Heights, NY, USA
pp. 583-592

Computing a shortest k-link path in a polygon (PDF)

J.S.B. Mitchell , Dept. of Appl. Math., State Univ. of New York, Satony Brook, NY, USA
pp. 573-582

A theory of wormhole routing in parallel computers (PDF)

S. Felperin , IBM Almaden Res. Center, San Jose, CA, USA
pp. 563-572

Exact analysis of hot-potato routing (PDF)

U. Feige , Weizmann Inst. of Sci., Rehovot, Israel
pp. 553-562

Efficient self-embedding of butterfly networks with random faults (PDF)

H. Tamaki , Dept. of Comput. Sci., Toronto Univ., Ont., Canada
pp. 533-541

Read-thrice DNF is hard to learn with membership and equivalence queries (PDF)

H. Aizenstein , Dept. of Comput. Sci., Illinois Univ., Urbana, IL, USA
pp. 523-532

On the exact learning of formulas in parallel (PDF)

R. Cleve , Dept. of Comput. Sci., Calgary Univ., Alta., Canada
N.H. Bshouty , Dept. of Comput. Sci., Calgary Univ., Alta., Canada
pp. 513-522

Apple tasting and nearly one-sided learning (PDF)

D.P. Helmbold , Dept. of Comput. Sci., California Univ., Santa Cruz, CA, USA
pp. 493-502

On the randomized complexity of volume and diameter (PDF)

L. Lovasz , Eotvos Lorand Univ., Budapest, Czechoslovakia
pp. 482-492

The algorithmic aspects of the regularity lemma (PDF)

N. Alon , Dept. of Math., Raymond&Beverly Sackler Faculty of Exact Sciences, Tel Aviv Univ., Israel
pp. 473-481

A subexponential algorithm for abstract optimization problems (PDF)

B. Gartner , Inst. fur Inf., Freie Univ. Berlin, Germany
pp. 464-472

On efficient band matrix arithmetic (PDF)

W. Eberly , Dept. of Comput. Sci., Calgary Univ., Alta., Canada
pp. 457-463

How to denest Ramanujan's nested radicals (PDF)

J. Blomer , Inst. fur Inf., Fachbereich Math., Freie Univ. Berlin, Germany
pp. 447-456

Fast unimodular reduction: planar integer lattices (PDF)

C.K. Yap , Courant Inst., New York Univ., NY, USA
pp. 437-446

Zero-knowledge proofs of knowledge without interaction (PDF)

G. Persiano , Dipartimento di Informatica ed Applicazioni, Salerno Univ., Italy
A. De Santis , Dipartimento di Informatica ed Applicazioni, Salerno Univ., Italy
pp. 427-436

Improved parallel polynomial division and its extensions (PDF)

D. Bini , Dept. of Math., Pisa Univ., Italy
pp. 131-136

Fast algorithms for matrix normal forms (PDF)

M. Giesbrecht , Dept. of Comput. Sci., Toronto Univ., Ont., Canada
pp. 121-130

Computing in solvable matrix groups (PDF)

E.M. Luks , Comput.&Inf. Sci., Oregon Univ., Eugene, OR, USA
pp. 111-120

Drawing planar graphs using the lmc-ordering (PDF)

G. Kant , Utrech Univ., Netherlands
pp. 101-110

On four-connecting a triconnected graph (PDF)

T. Hsu , Dept. of Comput. Sci., Texas Univ., Austin, TX, USA
pp. 70-79

Sparsification-a technique for speeding up dynamic graph algorithms (PDF)

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

Fully dynamic biconnectivity in graphs (PDF)

M. Rauch , Dept. of Comput. Sci., Princeton Univ., NJ, USA
pp. 50-59

Data structural bootstrapping, linear path compression, and catenable heap ordered double ended queues (PDF)

R.E. Tarjan , Dept. of Comput. Sci., Princeton Univ., NC, USA
A.L. Buchsbaum , Dept. of Comput. Sci., Princeton Univ., NC, USA
R. Sundar , Dept. of Comput. Sci., Princeton Univ., NC, USA
pp. 40-49

The isomorphism conjecture holds relative to an oracle (PDF)

S. Fenner , Univ. of Southern Maine, Portland, ME, USA
pp. 30-39

Undirected connectivity in O(log/sup 1.5/n) space (PDF)

N. Nisan , Dept. of Comput. Sci., Hebrew Univ., Jerusalem, Israel
pp. 24-29

Proof verification and hardness of approximation problems (PDF)

S. Arora , Div. of Comput. Sci., California Univ., Berkeley, CA, USA
pp. 14-23
90 ms
(Ver )