The Community for Technology Leaders
2013 IEEE 54th Annual Symposium on Foundations of Computer Science (1993)
Palo Alto, CA, USA
Nov. 3, 1993 to Nov. 5, 1993
ISBN: 0-8186-4370-6
TABLE OF CONTENTS
Papers

Breaking the /spl Theta/(nlog/sup 2/ n) barrier for sorting with faults (PDF)

Yuan Ma , Dept. of Math., MIT, Cambridge, MA, USA
T. Leighton , Dept. of Math., MIT, Cambridge, MA, USA
pp. 734-743

External-memory computational geometry (PDF)

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

On choosing a dense subgraph (PDF)

G. Kortsarz , Dept. of Appl. Math.&Comput. Sci., Weizmann Inst. of Sci., Rehovot, Israel
D. Peleg , Dept. of Appl. Math.&Comput. Sci., Weizmann Inst. of Sci., Rehovot, Israel
pp. 692-701

A Chernoff bound for random walks on expander graphs (PDF)

D. Gillman , Inst. for Math.&Applications, Minnesota Univ., Minneapolis, MN, USA
pp. 680-691

A sub-linear time distributed algorithm for minimum-weight spanning trees (PDF)

S. Kutten , IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA
J.A. Garay , IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA
pp. 659-668

Fast algorithms for constructing t-spanners and paths with stretch t (PDF)

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

Near-linear cost sequential and distributed constructions of sparse neighborhood covers (PDF)

L. Cowen , Lab. for Comput. Sci., MIT, Cambridge, MA, USA
B. Awerbuch , Lab. for Comput. Sci., MIT, Cambridge, MA, USA
B. Berger , Lab. for Comput. Sci., MIT, Cambridge, MA, USA
pp. 638-647

An O(nlog/sup 3/ n) algorithm for the real root problem (PDF)

J.H. Reif , Dept. of Comput. Sci., Duke Univ., Durham, NC, USA
pp. 626-635

Counting rational points on curves over finite fields (PDF)

Ming-Deh Huang , Dept. of Comput. Sci., Univ. of Southern California, Los Angeles, CA, USA
D. Ierardi , Dept. of Comput. Sci., Univ. of Southern California, Los Angeles, CA, USA
pp. 616-625

Directed vs. undirected monotone contact networks for threshold functions (PDF)

M.M. Halldorsson , Sch. of Inf. Sci., JAIST, Ishikawa, Japan
J. Radhakrishnan , Sch. of Inf. Sci., JAIST, Ishikawa, Japan
pp. 604-613

Signal propagation, with application to a lower bound on the depth of noisy formulas (PDF)

L.J. Schulman , Dept. of Comput. Sci., California Univ., Berkeley, CA, USA
W. Evans , Dept. of Comput. Sci., California Univ., Berkeley, CA, USA
pp. 594-603

Refining a triangulation of a planar straight-line graph to eliminate large angles (PDF)

S.A. Mitchell , Dept. of Appl.&Numerical Math., Sandia Nat. Labs., Albuquerque, NM, USA
pp. 583-592

A compact piecewise-linear Voronoi diagram for convex sites in the plane (PDF)

M. McAllister , Dept. of Comput. Sci., British Columbia Univ., Vancouver, BC, Canada
J. Snoeyink , Dept. of Comput. Sci., British Columbia Univ., Vancouver, BC, Canada
D. Kirkpatrick , Dept. of Comput. Sci., British Columbia Univ., Vancouver, BC, Canada
pp. 573-582

A polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed (PDF)

A.I. Barvinok , Dept. of Math., R. Inst. of Technol., Stockholm, Sweden
pp. 566-572

On bounded queries and approximation (PDF)

R. Chang , Dept. of Comput. Sci., Maryland Univ., Baltimore, MD, USA
pp. 547-556

What can we sort in o(nlog n) time? (PDF)

Z. Galil , Tel Aviv Univ., Israel
A.M. Ben-Amram , Tel Aviv Univ., Israel
pp. 538-546

Better lower bounds on detecting affine and spherical degeneracies (PDF)

R. Seidel , Div. of Comput. Sci., California Univ., Berkeley, CA, USA
J. Erickson , Div. of Comput. Sci., California Univ., Berkeley, CA, USA
pp. 528-536

The union of convex polyhedra in three dimensions (PDF)

B. Aronov , Dept. of Comput. Sci., Polytechnic Univ., Brooklyn, NY, USA
pp. 518-527

Almost tight upper bounds for lower envelopes in higher dimensions (PDF)

M. Sharir , Sch. of Math. Sci., Tel Aviv Univ., Israel
pp. 498-507

A weak version of the Blum, Shub and Smale model (PDF)

P. Koiran , Lab. de l'Inf. du Parallelisme, CNRS, Lyon, France
pp. 486-495

Dynamic word problems (PDF)

G.S. Frandsen , Dept. of Comput. Sci., Aarhus Univ., Denmark
S. Skyum , Dept. of Comput. Sci., Aarhus Univ., Denmark
P.B. Miltersen , Dept. of Comput. Sci., Aarhus Univ., Denmark
pp. 470-479

A simple local-control approximation algorithm for multicommodity flow (PDF)

B. Awerbuch , Lab. for Comput. Sci., MIT, Cambridge, MA, USA
T. Leighton , Lab. for Comput. Sci., MIT, Cambridge, MA, USA
pp. 459-468

A framework for cost-scaling algorithms for submodular flow problems (PDF)

H.N. Gabow , Dept. of Comput. Sci., Colorado Univ., Boulder, CO, USA
pp. 449-458

Faster algorithms for the generalized network flow problem (PDF)

T. Radzik , Dept. of Comput. Sci., King's Coll. London, UK
pp. 438-448

Las Vegas algorithms for matrix groups (PDF)

R. Beals , Dept. of Comput.&Inf. Sci., Oregon Univ., Eugene, OR, USA
pp. 427-436

Testing equalities of multiplicative representations in polynomial time (PDF)

Guoqiang Ge , Dept. of Math., California Univ., Berkeley, CA, USA
pp. 422-426

The complexity of the theory of p-adic numbers (PDF)

L. Egidi , Dipartimento di Inf., Torino Univ., Italy
pp. 412-421

Product range spaces, sensitive sampling, and derandomization (PDF)

B. Chazelle , Dept. of Comput. Sci., Princeton Univ., NJ, USA
H. Bronnimann , Dept. of Comput. Sci., Princeton Univ., NJ, USA
pp. 400-409

Geometric discrepancy revisited (PDF)

B. Chazelle , Dept. of Comput. Sci., Princeton Univ., NJ, USA
pp. 392-399

Solving systems of set constraints with negated subset relationships (PDF)

S. Tison , Lab. d'Inf. Fondamentale de Lille, Univ. des Sci. et Tech. de Lille, Villeneuve d'Ascq, France
R. Gilleron , Lab. d'Inf. Fondamentale de Lille, Univ. des Sci. et Tech. de Lille, Villeneuve d'Ascq, France
M. Tommasi , Lab. d'Inf. Fondamentale de Lille, Univ. des Sci. et Tech. de Lille, Villeneuve d'Ascq, France
pp. 372-380

A quantum bit commitment scheme provably unbreakable by both parties (PDF)

G. Brassard , Dept. d'Inf. et de Recherche Oper., Montreal Univ., Que., Canada
pp. 362-371

Quantum circuit complexity (PDF)

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

Universal emulations with sublogarithmic slowdown (PDF)

C. Kaklamanis , DIMACS Center, Rutgers Univ., Piscataway, NJ, USA
pp. 341-350

Optimal parallel all-nearest-neighbors using the well-separated pair decomposition (PDF)

P.B. Callahan , Dept. of Comput. Sci., Johns Hopkins Univ., Baltimore, MD, USA
pp. 332-340

Learning an intersection of k halfspaces over a uniform distribution (PDF)

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

Exact learning via the Monotone theory (PDF)

N.H. Bshouty , Dept. of Comput. Sci., Calgary Univ., Alta., Canada
pp. 302-311

Highly efficient asynchronous execution of large-grained parallel programs (PDF)

Y. Aumann , Dept. of Comput. Sci., Weizmann Inst. of Sci., Rehovot, Israel
pp. 271-280

A linear-processor polylog-time algorithm for shortest paths in planar graphs (PDF)

S. Subramanian , Brown Univ., Providence, RI, USA
P.N. Klein , Brown Univ., Providence, RI, USA
pp. 259-270

A randomized time-space tradeoff of O/spl tilde/(mR/spl circ/) for USTCON (PDF)

U. Feige , Dept. of Appl. Math., Weizmann Inst. of Sci., Rehovot, Israel
pp. 238-246

Time-space lower bounds for directed s-t connectivity on JAG models (PDF)

G. Barnes , Max-Planck-Inst. fur Inf., Saarbrucken, Germany
pp. 228-237

Space bounds for graph connectivity problems on node-named JAGs and node-ordered JAGs (PDF)

C.K. Poon , Dept. of Comput. Sci., Toronto Univ., Ont., Canada
pp. 218-227

A tight lower bound for k-set agreement (PDF)

S. Chaudhuri , Dept. of Comput. Sci., Iowa State Univ., Ames, IA, USA
pp. 206-215

Synchronization power depends on the register size (PDF)

Y. Aiek , Dept. of Comput. Sci., Tel Aviv Univ., Israel
pp. 196-205

Sensitive functions and approximate problems (PDF)

S. Chaudhuri , Max-Planck-Inst. fur Inf., Saarbrucken, Germany
pp. 186-193

The complexity and distribution of hard problems (PDF)

D.W. Juedes , Dept. of Comput. Sci., Iowa State Univ., Ames, IA, USA
J.H. Lutz , Dept. of Comput. Sci., Iowa State Univ., Ames, IA, USA
pp. 177-185

On the "log rank"-conjecture in communication complexity (PDF)

R. Raz , Dept. of Comput. Sci., Princeton Univ., NJ, USA
pp. 168-176

Approximating shortest superstrings (PDF)

Shang-Hua Teng , Dept. of Math., MIT, Cambridge, MA, USA
pp. 158-165

Genome rearrangements and sorting by reversals (PDF)

P.A. Pevzner , Dept. of Comput. Sci., Pennsylvania State Univ., University Park, PA, USA
V. Bafna , Dept. of Comput. Sci., Pennsylvania State Univ., University Park, PA, USA
pp. 148-157

On representations by low-degree polynomials (PDF)

R. Smolensky , Dept. of Comput. Sci., Hebrew Univ., Jerusalem, Israel
pp. 130-138

Top-down lower bounds for depth 3 circuits (PDF)

J. Hastad , Dept. of Comput. Sci., R. Inst. of Technol., Stockholm, Sweden
pp. 124-129

The shrinkage exponent is 2 (PDF)

J. Hastad , R. Inst. of Technol., Stockholm, Sweden
pp. 114-123

Using difficulty of prediction to decrease computation: fast sort, priority queue and convex hull on entropy bounded inputs (PDF)

S. Chen , Dept. of Comput. Sci., Duke Univ., Durham, NC, USA
J.H. Reif , Dept. of Comput. Sci., Duke Univ., Durham, NC, USA
pp. 104-112

Simulated annealing for graph bisection (PDF)

M. Jerrum , Dept. of Comput. Sci., Edinburgh Univ., UK
pp. 94-103

Parallel computable higher type functionals (PDF)

P. Clote , Dept. of Comput. Sci., Boston Coll., Chestnut Hill, MA, USA
pp. 72-81

Gates accept concurrent behavior (PDF)

V. Pratt , Dept. of Comput. Sci., Stanford Univ., CA, USA
V. Gupta , Dept. of Comput. Sci., Stanford Univ., CA, USA
pp. 62-71

Logical reducibility and monadic NP (PDF)

S.S. Cosmadakis , IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA
pp. 52-61

NP trees and Carnap's modal logic (PDF)

G. Gottlob , Inst. fur Informationssysteme, Tech. Univ. Wien, Austria
pp. 42-51

Throughput-competitive on-line routing (PDF)

B. Awerbuch , Lab. for Comput. Sci., MIT, Cambridge, MA, USA
pp. 32-40

Heat and Dump: competitive distributed paging (PDF)

B. Awerbuch , Lab. for Comput. Sci., MIT, Cambridge, MA, USA
pp. 22-31

On the value of information in coordination games (PDF)

S. Irani , Dept. of Inf.&Comput. Sci., California Univ., Irvine, CA, USA
pp. 12-21

An on-line algorithm for improving performance in navigation (PDF)

A. Blum , Sch. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA
pp. 2-11
96 ms
(Ver 3.1 (10032016))