CSDL - Proceedings F

F
FOCS
1993
34th Annual Symposium on Foundations of Computer Science (FOCS 1993)

This Publication

Digital Library

	This Publication

	Subscribe to this Publication Login to access your subscribed content
	Bibliographic References
	ASCII Text BibTex Refworks Procite/RefMan

34th Annual Symposium on Foundations of Computer Science (FOCS 1993)

Palo Alto, CA, USA

November 03-November 05

ISBN: 0-8186-4370-6

Table of Contents

Papers

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

T. Leighton, Dept. of Math., MIT, Cambridge, MA, USA

Yuan Ma, Dept. of Math., MIT, Cambridge, MA, USA

pp. 734-743

ABSTRACT

PDF

The hardness of approximate optima in lattices, codes, and systems of linear equations (PDF)

S. Arora, Div. of Comput. Sci., California Univ., Berkeley, CA, USA

pp. 724-733

External-memory computational geometry (PDF)

M.T. Goodrich, Dept. of Comput. Sci., Johns Hopkins Univ., Baltimore, MD, USA

pp. 714-723

Efficient out-of-core algorithms for linear relaxation using blocking covers (PDF)

C.E. Leiserson, Lab. for Comput. Sci., MIT, Cambridge, MA, USA

S. Rao

S. Toledo

pp. 704-713

ABSTRACT

PDF

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

ABSTRACT

PDF

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

D. Gillman, Inst. for Math.&Applications, Minnesota Univ., Minneapolis, MN, USA

pp. 680-691

ABSTRACT

PDF

Eavesdropping games: a graph-theoretic approach to privacy in distributed systems (PDF)

M. Franklin, Columbia Univ., NY, USA

Z. Galil, Columbia Univ., NY, USA

M. Yung

pp. 670-679

ABSTRACT

PDF

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

J.A. Garay, IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA

S. Kutten, IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA

D. Peleg

pp. 659-668

ABSTRACT

PDF

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

ABSTRACT

PDF

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

B. Awerbuch, Lab. for Comput. Sci., MIT, Cambridge, MA, USA

B. Berger, Lab. for Comput. Sci., MIT, Cambridge, MA, USA

L. Cowen, Lab. for Comput. Sci., MIT, Cambridge, MA, USA

D. Peleg

pp. 638-647

ABSTRACT

PDF

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

ABSTRACT

PDF

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

ABSTRACT

PDF

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

K.V. Subrahmanyam

pp. 604-613

ABSTRACT

PDF

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

W. Evans, Dept. of Comput. Sci., California Univ., Berkeley, CA, USA

L.J. Schulman, Dept. of Comput. Sci., California Univ., Berkeley, CA, USA

pp. 594-603

ABSTRACT

PDF

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

ABSTRACT

PDF

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

D. Kirkpatrick, Dept. of Comput. Sci., British Columbia Univ., Vancouver, BC, Canada

J. Snoeyink, Dept. of Comput. Sci., British Columbia Univ., Vancouver, BC, Canada

pp. 573-582

ABSTRACT

PDF

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

ABSTRACT

PDF

The NC equivalence of planar integer linear programming and Euclidean GCD (PDF)

D. Shallcross, Bellcore, Morristown, NJ, USA

V. Pan

Yu Lin-Kriz

pp. 557-564

ABSTRACT

PDF

On bounded queries and approximation (PDF)

R. Chang, Dept. of Comput. Sci., Maryland Univ., Baltimore, MD, USA

W.I. Gasarch

pp. 547-556

ABSTRACT

PDF

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

A.M. Ben-Amram, Tel Aviv Univ., Israel

Z. Galil, Tel Aviv Univ., Israel

pp. 538-546

ABSTRACT

PDF

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

J. Erickson, Div. of Comput. Sci., California Univ., Berkeley, CA, USA

R. Seidel, Div. of Comput. Sci., California Univ., Berkeley, CA, USA

pp. 528-536

ABSTRACT

PDF

The union of convex polyhedra in three dimensions (PDF)

B. Aronov, Dept. of Comput. Sci., Polytechnic Univ., Brooklyn, NY, USA

M. Sharir

pp. 518-527

ABSTRACT

PDF

Efficient computation of Euclidean shortest paths in the plane (PDF)

J. Hershberger

S. Suri

pp. 508-517

ABSTRACT

PDF

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

M. Sharir, Sch. of Math. Sci., Tel Aviv Univ., Israel

pp. 498-507

ABSTRACT

PDF

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

ABSTRACT

PDF

Optimal bi-weighted binary trees and the complexity of maintaining partial sums (PDF)

H. Hampapuram, Rutgers Univ., NJ, USA

M.L. Fredman, Rutgers Univ., NJ, USA

pp. 480-485

ABSTRACT

PDF

Dynamic word problems (PDF)

G.S. Frandsen, Dept. of Comput. Sci., Aarhus Univ., Denmark

P.B. Miltersen, Dept. of Comput. Sci., Aarhus Univ., Denmark

S. Skyum, Dept. of Comput. Sci., Aarhus Univ., Denmark

pp. 470-479

ABSTRACT

PDF

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

ABSTRACT

PDF

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

ABSTRACT

PDF

Faster algorithms for the generalized network flow problem (PDF)

T. Radzik, Dept. of Comput. Sci., King's Coll. London, UK

pp. 438-448

ABSTRACT

PDF

Las Vegas algorithms for matrix groups (PDF)

R. Beals, Dept. of Comput.&Inf. Sci., Oregon Univ., Eugene, OR, USA

L. Babai

pp. 427-436

ABSTRACT

PDF

Testing equalities of multiplicative representations in polynomial time (PDF)

Guoqiang Ge, Dept. of Math., California Univ., Berkeley, CA, USA

pp. 422-426

ABSTRACT

PDF

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

L. Egidi, Dipartimento di Inf., Torino Univ., Italy

pp. 412-421

ABSTRACT

PDF

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

H. Bronnimann, Dept. of Comput. Sci., Princeton Univ., NJ, USA

B. Chazelle, Dept. of Comput. Sci., Princeton Univ., NJ, USA

J. Matousek

pp. 400-409

ABSTRACT

PDF

Geometric discrepancy revisited (PDF)

B. Chazelle, Dept. of Comput. Sci., Princeton Univ., NJ, USA

pp. 392-399

ABSTRACT

PDF

Near-quadratic bounds for the motion planning problem for a polygon in a polygonal environment (PDF)

D. Halperin, Robotics Lab., Stanford Univ., CA, USA

M. Sharir

pp. 382-391

ABSTRACT

PDF

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

R. Gilleron, Lab. d'Inf. Fondamentale de Lille, Univ. des Sci. et Tech. de Lille, Villeneuve d'Ascq, France

S. Tison, 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

ABSTRACT

PDF

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

ABSTRACT

PDF

Universal emulations with sublogarithmic slowdown (PDF)

C. Kaklamanis, DIMACS Center, Rutgers Univ., Piscataway, NJ, USA

D. Krizanc

S. Rao

pp. 341-350

ABSTRACT

PDF

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

ABSTRACT

PDF

Primal-dual RNC approximation algorithms for (multi)-set (multi)-cover and covering integer programs (PDF)

S. Rajagopalan, California Univ., Berkeley, CA, USA

V.V. Vazirani

pp. 322-331

ABSTRACT

PDF

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

A. Blum, Sch. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA

R. Kannan

pp. 312-320

ABSTRACT

PDF

Exact learning via the Monotone theory (PDF)

N.H. Bshouty, Dept. of Comput. Sci., Calgary Univ., Alta., Canada

pp. 302-311

ABSTRACT

PDF

Scale-sensitive dimensions, uniform convergence, and learnability (PDF)

N. Alon, Dept. of Math., Tel Aviv Univ., Israel

pp. 292-301

General bounds on statistical query learning and PAC learning with noise via hypothesis boosting (PDF)

J.A. Aslam, Lab. for Comput. Sci., MIT, Cambridge, MA, USA

S.E. Decatur

pp. 282-291

ABSTRACT

PDF

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)

P.N. Klein, Brown Univ., Providence, RI, USA

S. Subramanian, Brown Univ., Providence, RI, USA

pp. 259-270

ABSTRACT

PDF

Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions (PDF)

R. Cole, Courant Inst. of Math. Sci., New York, NY, USA

K. Park

pp. 248-258

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

ABSTRACT

PDF

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

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

J.A. Edmonds

pp. 228-237

ABSTRACT

PDF

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

ABSTRACT

PDF

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

G. Stupp

pp. 196-205

ABSTRACT

PDF

Sensitive functions and approximate problems (PDF)

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

pp. 186-193

ABSTRACT

PDF

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

ABSTRACT

PDF

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

R. Raz, Dept. of Comput. Sci., Princeton Univ., NJ, USA

B. Spieker

pp. 168-176

ABSTRACT

PDF

Approximating shortest superstrings (PDF)

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

F. Yao

pp. 158-165

ABSTRACT

PDF

Genome rearrangements and sorting by reversals (PDF)

V. Bafna, Dept. of Comput. Sci., Pennsylvania State Univ., University Park, PA, USA

P.A. Pevzner, Dept. of Comput. Sci., Pennsylvania State Univ., University Park, PA, USA

pp. 148-157

ABSTRACT

PDF

A polynomial-time algorithm for the perfect phylogeny problem when the number of character states is fixed (PDF)

R. Agarwala, Dept. of Comput. Sci., Iowa State Univ., Ames, IA, USA

D. Fernandez-Baca

pp. 140-147

ABSTRACT

PDF

On representations by low-degree polynomials (PDF)

R. Smolensky, Dept. of Comput. Sci., Hebrew Univ., Jerusalem, Israel

pp. 130-138

ABSTRACT

PDF

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

ABSTRACT

PDF

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

ABSTRACT

PDF

Simulated annealing for graph bisection (PDF)

M. Jerrum, Dept. of Comput. Sci., Edinburgh Univ., UK

G.B. Sorkin

pp. 94-103

ABSTRACT

PDF

Random sampling in matroids, with applications to graph connectivity and minimum spanning trees (PDF)

D.R. Karker, Dept. of Comput. Sci., Stanford Univ., CA, USA

pp. 84-93

ABSTRACT

PDF

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. Gupta, Dept. of Comput. Sci., Stanford Univ., CA, USA

V. Pratt, Dept. of Comput. Sci., Stanford Univ., CA, USA

pp. 62-71

ABSTRACT

PDF

Logical reducibility and monadic NP (PDF)

S.S. Cosmadakis, IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA

pp. 52-61

ABSTRACT

PDF

NP trees and Carnap's modal logic (PDF)

G. Gottlob, Inst. fur Informationssysteme, Tech. Univ. Wien, Austria

pp. 42-51

ABSTRACT

PDF

Throughput-competitive on-line routing (PDF)

B. Awerbuch, Lab. for Comput. Sci., MIT, Cambridge, MA, USA

Y. Azar

S. Plotkin

pp. 32-40

ABSTRACT

PDF

Heat and Dump: competitive distributed paging (PDF)

B. Awerbuch, Lab. for Comput. Sci., MIT, Cambridge, MA, USA

Y. Bartal

A. Fiat

pp. 22-31

ABSTRACT

PDF

On the value of information in coordination games (PDF)

S. Irani, Dept. of Inf.&Comput. Sci., California Univ., Irvine, CA, USA

Y. Rabani

pp. 12-21

ABSTRACT

PDF

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

A. Blum, Sch. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA

P. Chalasani

pp. 2-11

ABSTRACT

PDF

Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science (PDF)

pp. 0_1-

ABSTRACT

PDF

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.

Open
Download