The Community for Technology Leaders
2013 IEEE 54th Annual Symposium on Foundations of Computer Science (1991)
San Juan, Puerto Rico
Oct. 1, 1991 to Oct. 4, 1991
ISBN: 0-8186-2445-0
TABLE OF CONTENTS
Papers

Fully parallelized multi prover protocols for NEXP-time (PDF)

A. Shamir , Dept. of Appl. Math., Wiezmann Inst. of Sci., Rehovot, Israel
D. Lapidot , Dept. of Appl. Math., Wiezmann Inst. of Sci., Rehovot, Israel
pp. 13-18

Languages that are easier than their proofs (PDF)

R. Beigel , Dept. of Comput. Sci., Yale Univ., New Haven, CT, USA
pp. 19-28

An optimal convex hull algorithm and new results on cuttings (PDF)

B. Chazelle , Dept. of Comput. Sci., Princeton Univ., NJ, USA
pp. 29-38

The art gallery theorem for polygons with holes (PDF)

F. Hoffmann , Karl-Weierstrass-Inst. fur Math., Berlin, Germany
pp. 39-48

Quantifying knowledge complexity (PDF)

E. Petrank , Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel
O. Goldreich , Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel
pp. 59-68

Subquadratic zero-knowledge (PDF)

J. Boyar , Loyola Univ., Chicago, IL, USA
pp. 69-78

Simulating BPP using a general weak random source (PDF)

D. Zuckerman , Lab. Comput. Sci., MIT, Cambridge, MA, USA
pp. 79-89

Checking the correctness of memories (PDF)

W. Evans , Dept. of Comput. Sci., California Univ., Berkeley, CA, USA
P. Gemmell , Dept. of Comput. Sci., California Univ., Berkeley, CA, USA
M. Blum , Dept. of Comput. Sci., California Univ., Berkeley, CA, USA
pp. 90-99

Dynamic scheduling on parallel machines (PDF)

S.-H. Teng , Sch. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA
J. Sgall , Sch. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA
S. Feldmann , Sch. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA
pp. 111-120

Optimal prefetching via data compression (PDF)

P. Krishnan , Dept. of Comput. Sci., Brown Univ., Providence, RI, USA
J.S. Vitter , Dept. of Comput. Sci., Brown Univ., Providence, RI, USA
pp. 121-130

Scheduling parallel machines on-line (PDF)

D.B. Shmoys , Cornell Univ., Ithaca, NY, USA
pp. 131-140

Communication complexity for parallel divide-and-conquer (PDF)

H.T. Kung , Sch. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA
I.-C. Wu , Sch. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA
pp. 151-162

On selecting a satisfying truth assignment (PDF)

C.H. Papadimitriou , Dept. of Comput. Sci.&Eng., California Univ., San Diego, CA, USA
pp. 163-169

Exact learning of read-twice DNF formulas (PDF)

H. Aizenstein , Dept. of Comput. Sci., Illinois Univ., Urbana, IL, USA
L. Pitt , Dept. of Comput. Sci., Illinois Univ., Urbana, IL, USA
pp. 170-179

Dynamic maintenance of geometric structures made easy (PDF)

O. Schwarzkopf , Inst. fur Inf., Freie Univ., Berlin, Germany
pp. 197-206

Reporting points in halfspaces (PDF)

J. Matoussek , Dept. of Appl. Math., Charles Univ., Praha, Czechoslovakia
pp. 207-215

Amortized communication complexity (PDF)

T. Feder , Bellcore, Morris Town, NJ, USA
pp. 239-248

Communication complexity towards lower bounds on circuit depth (PDF)

J. Edmonds , Dept. of Comput. Sci., Toronto Univ., Ont., Canada
R. Impagliazzo , Dept. of Comput. Sci., Toronto Univ., Ont., Canada
pp. 249-257

Distributed program checking: a paradigm for building self-stabilizing distributed protocols (PDF)

B. Awerbuch , Lab. for Comput. Sci., MIT, Cambridge, MA, USA
G. Varghese , Lab. for Comput. Sci., MIT, Cambridge, MA, USA
pp. 258-267

Self-stabilization by local checking and correction (PDF)

B. Patt-Shamir , Lab. for Comput. Sci., MIT, Cambridge, MA, USA
G. Varghese , Lab. for Comput. Sci., MIT, Cambridge, MA, USA
B. Awerbuch , Lab. for Comput. Sci., MIT, Cambridge, MA, USA
pp. 268-277

An asynchronous two-dimensional self-correcting cellular automaton (PDF)

W. Wang , Inst. of Syst. Sci., Nat. Singapore Univ., Singapore
pp. 278-285

How to learn an unknown environment (PDF)

X. Deng , Dept. of Comput. Sci., York Univ., North York, Ont., Canada
pp. 298-303

Walking an unknown street with bounded detour (PDF)

R. Klein , Fern Univ.-GH-Hagen, Germany
pp. 304-313

Better bounds for threshold formulas (PDF)

J. Radhakrishnan , Dept. of Comput. Sci., Rutgers Univ., New Brunswick, NJ, USA
pp. 314-323

Shrinkage of de Morgan formulae under restriction (PDF)

U. Zwick , Warwick Univ., Coventry, UK
M.S. Paterson , Warwick Univ., Coventry, UK
pp. 324-333

Size-depth tradeoffs for algebraic formulae (PDF)

R. Cleve , Dept. of Comput. Sci., Calgary Univ., Alta., Canada
W. Eberly , Dept. of Comput. Sci., Calgary Univ., Alta., Canada
N.H. Bshouty , Dept. of Comput. Sci., Calgary Univ., Alta., Canada
pp. 334-341

A new characterization of Mehlhorn's polynomial time functionals (PDF)

B. Kapron , Sch. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA
pp. 342-347

A theory of using history for equational systems with applications (PDF)

R.M. Verma , Dept. of Comput. Sci., Houston Univ., TX, USA
pp. 348-357

Progress measures for complementation omega -automata with applications to temporal logic (PDF)

N. Klarlund , IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA
pp. 358-367

Tree automata, mu-calculus and determinacy (PDF)

E.A. Emerson , Texas Univ., Austin, TX, USA
pp. 368-377

Lower bounds for polynomial evaluation and interpolation problems (PDF)

V. Shoup , Dept. of Comput. Sci., Toronto Univ., Ont., Canada
R. Smolensky , Dept. of Comput. Sci., Toronto Univ., Ont., Canada
pp. 378-383

Efficient exponentiation in finite field (PDF)

J. von zur Gathen , Dept. of Comput. Sci., Toronto Univ., Ont., Canada
pp. 384-391

Explicit construction of natural bounded concentrators (PDF)

M. Morgenstern , Dept. of Comput. Sci., British Columbia Univ., Vancouver, BC, Canada
pp. 392-397

Better expansion for Ramanujan graphs (PDF)

N. Kahale , Lab. for Comput. Sci., MIT, Cambridge, MA, USA
pp. 398-404

A general approach to removing degeneracies (PDF)

I. Emiris , Div. of Comput. Sci., California Univ., Berkeley, CA, USA
J. Canny , Div. of Comput. Sci., California Univ., Berkeley, CA, USA
pp. 405-413

A quadratic time algorithm for the minmax length triangulation (PDF)

T.S. Tan , Dept. of Comput. Sci., Illinois Univ., Urbana, IL, USA
H. Edelsbruneer , Dept. of Comput. Sci., Illinois Univ., Urbana, IL, USA
pp. 414-423

Discrepancy and in -approximations for bounded VC-dimension (PDF)

J. Matousek , Dept. of Appl. Math., Charles Univ., Praha, Czechoslovakia
pp. 424-430

On better heuristic for Euclidean Steiner minimum trees (PDF)

D.-Z. Du , Dept. of Comput. Sci., Minnesota Univ., Minneapolis, MN, USA
pp. 431-439

Asymptotically optimal PRAM emulation on faulty hypercubes (PDF)

M. Ben-Or , Dept. of Comput. Sci., Hebrew Univ. of Jerusalem, Israel
Y. Anumann , Dept. of Comput. Sci., Hebrew Univ. of Jerusalem, Israel
pp. 440-446

Fault-tolerant computation in the full information model (PDF)

O. Goldreich , Dept. of Comput. Sci., Technion, Haifa, Israel
pp. 447-457

Highly fault-tolerant sorting circuits (PDF)

Y. Ma , MIT, Cambridge, MA, USA
T. Leighton , MIT, Cambridge, MA, USA
pp. 458-469

Efficient algorithms for dynamic allocation of distributed memory (PDF)

E.J. Schwabe , MIT, Cambridge, MA, USA
T. Leighton , MIT, Cambridge, MA, USA
pp. 470-479

Polynomial algorithms for LP over a subring of the algebraic integers with applications to LP with circulant matrices (PDF)

P.A. Beling , Dept. of Ind. Eng.&Oper. Res., California Univ., Berkeley, CA, USA
I. Adler , Dept. of Ind. Eng.&Oper. Res., California Univ., Berkeley, CA, USA
pp. 480-487

Dynamic three-dimensional linear programming (PDF)

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

The maintenance of common data in a distributed system (PDF)

B. Awerbuch , MIT, Cambridge, MA, USA
L.J. Schulman , MIT, Cambridge, MA, USA
pp. 505-514

Optimal file sharing in distributed networks (PDF)

M. Naor , IBM Almaden Res. Center, San Jose, CA, USA
R.M. Roth , IBM Almaden Res. Center, San Jose, CA, USA
pp. 515-525

Low contention linearizable counting (PDF)

M. Herlihy , Digital Equipment Corp., Cambridge, MA, USA
pp. 526-535

A unified geometric approach to graph separators (PDF)

S.-H. Teng , Sch. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA
G.L. Miller , Sch. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA
pp. 538-547

A linear time algorithm for triconnectivity augmentation (PDF)

T.-S. Hsu , Dept. of Comput. Sci., Texas Univ., Austin, TX, USA
V. Ramachandran , Dept. of Comput. Sci., Texas Univ., Austin, TX, USA
pp. 548-559

Finding the hidden path: time bounds for all-pairs shortest paths (PDF)

D.R. Karger , Dept. of Comput. Sci., Stanford Univ., CA, USA
D. Koller , Dept. of Comput. Sci., Stanford Univ., CA, USA
S.J. Phillips , Dept. of Comput. Sci., Stanford Univ., CA, USA
pp. 560-568

Search problems in the decision tree model (PDF)

L. Lovasz , Eotvos Lorand Univ., Budapest, Hungary
pp. 576-585

A parallel algorithmic version of the local lemma (PDF)

N. Alon , Dept. of Math., Tel Aviv Univ., Israel
pp. 586-593

Lower bounds for the complexity of reliable Boolean circuits with noisy gates (PDF)

A. Gal , Dept. of Comput. Sci., Chicago Univ., IL, USA
pp. 594-601

Reliable computation with noisy circuits and decision trees-a general n log n lower bound (PDF)

B. Schmeltz , Tech. Hochschule Darmstadt, Germany
R. Reischuk , Tech. Hochschule Darmstadt, Germany
pp. 602-611

A lower bound for the dictionary problem under a hashing model (PDF)

R. Sundar , Dept. of Comput. Sci., New York Univ., NY, USA
pp. 612-621

Lower bounds for data structure problems on RAMs (PDF)

Z. Galil , Tel-Aviv Univ., Israel
A.M. Ben-Amram , Tel-Aviv Univ., Israel
pp. 622-631

Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees (PDF)

G.N. Frederickson , Dept. of Comput. Sci., Purdue Univ., West Lafayette, IN, USA
pp. 632-641

Faster uniquely represented dictionaries (PDF)

A. Andersson , Dept. of Comput. Sci., Lund Univ., Sweden
pp. 642-649

On the complexity of computing the homology type of a triangulation (PDF)

D.R. Chang , Dept. of Comput. Sci., Cornell Univ., Ithaca, NY, USA
B.R. Donald , Dept. of Comput. Sci., Cornell Univ., Ithaca, NY, USA
pp. 650-661

An approximation algorithm for the number of zeros or arbitrary polynomials over GF(q) (PDF)

D. Grigoriev , Dept. of Comput. Sci., Bonn Univ., Germany
M. Karpinski , Dept. of Comput. Sci., Bonn Univ., Germany
pp. 662-669

Computing sums of radicals in polynomial time (PDF)

J. Blomer , Inst. fuer Inf., Fachbereich Math., Freie Univ., Berlin, Germany
pp. 670-677

Efficient algorithms for the Riemann-Roch problem and for addition in the Jacobian of a curve (PDF)

D. Ierardi , Dept. of Comput. Sci., Univ. of Southern California, Los Angeles, CA, USA
M.-D. Huang , Dept. of Comput. Sci., Univ. of Southern California, Los Angeles, CA, USA
pp. 678-687

Connected components in O(lg/sup 3/2 mod V/ mod ) parallel time for the CREW PRAM (PDF)

P. Metaxas , Dartmouth Coll., Hanover, NH, USA
D.B. Johnson , Dartmouth Coll., Hanover, NH, USA
pp. 688-697

Towards a theory of nearly constant time parallel algorithms (PDF)

J. Gil , British Columbia Univ., Vancouver, BC, Canada
pp. 698-710

Using approximation algorithms to design parallel algorithms that may ignore processor allocation (PDF)

M.T. Goodrich , Dept. of Comput. Sci., Johns Hopkins Univ., Baltimore, MD, USA
pp. 711-722

Approximate representation theory of finite groups (PDF)

K. Friedl , Dept. Comput. Sci., Chicago Univ., IL, USA
L. Babai , Dept. Comput. Sci., Chicago Univ., IL, USA
pp. 733-742

Finding k-cuts within twice the optimal (PDF)

V.V. Vazirani , Dept. of Comput. Sci.&Eng., Indian Inst. of Tech., New Delhi, India
H. Saran , Dept. of Comput. Sci.&Eng., Indian Inst. of Tech., New Delhi, India
pp. 743-751

Adaptive dictionary matching (PDF)

A. Amir , Georgia Tech., Atlanta, GA, USA
pp. 760-766

On the computational power of sigmoid versus Boolean threshold circuits (PDF)

W. Maass , Inst. for Inf. Process. Graz, Graz Univ. of Technol., Austria
pp. 767-776

On ACC (circuit complexity) (PDF)

R. Beigel , Yale Univ., New Haven, CT, USA
pp. 783-792

On-line maintenance of the four-connected components of a graph (PDF)

A. Kanevsky , Dept. of Comput. Sci., Texas A&M Univ., College Station, TX, USA
pp. 793-801

Computing planar intertwines (PDF)

A. Gupta , Sch. of Comput. Sci., Simon Fraser Univ., Burnaby, BC, Canada
pp. 802-811

Applications of a poset representation to edge connectivity and graph rigidity (PDF)

H.N. Gabow , Dept. of Comput. Sci., Colorado Univ., Boulder, CO, USA
pp. 812-821
103 ms
(Ver 3.1 (10032016))