focs88.html
Click here to view the file
or
click here to download the file
File contents
<html><head><title>29. FOCS 1988:
White Plains,
New York</title><link href="../../../dblp.css" rel="stylesheet" type="text/css" /></head><body>
<table width="100%"><tr><td align="left"><a href="../../index.html"><img alt="dblp.uni-trier.de" src="../../Logo.gif" border=0 height=60 width=170></a></td>
<td align="right"><a href="http://www.uni-trier.de"><img alt="www.uni-trier.de" src="../../logo_universitaet-trier.gif" border=0 height=48 width=215></a></td></tr></table>
<h1>29. <a href="index.html">FOCS</a> 1988:
White Plains,
New York</h1>
29th Annual Symposium on Foundations of Computer Science,
White Plains, New York, 24-26 October 1988. IEEE Computer Society
<ul>
<li><a name="NisanW88" href="../../indices/a-tree/n/Nisan:Noam.html">Noam Nisan</a>, <a href="../../indices/a-tree/w/Wigderson:Avi.html">Avi Wigderson</a>:
Hardness vs. Randomness (Extended Abstract).
2-11 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/NisanW88">BibTeX</a></font>
<li><a name="GoldreichKL88" href="../../indices/a-tree/g/Goldreich:Oded.html">Oded Goldreich</a>, <a href="../../indices/a-tree/k/Krawczyk:Hugo.html">Hugo Krawczyk</a>, <a href="../../indices/a-tree/l/Luby:Michael.html">Michael Luby</a>:
On the Existence of Pseudorandom Generators (Extended Abstract).
12-24 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/GoldreichKL88">BibTeX</a></font>
<li><a name="Kilian88" href="../../indices/a-tree/k/Kilian:Joe.html">Joe Kilian</a>:
Zero-knowledge with Log-Space Verifiers.
25-35 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Kilian88">BibTeX</a></font>
<li><a name="Levin88" href="../../indices/a-tree/l/Levin:Leonid_A=.html">Leonid A. Levin</a>:
Homogeneous Measures and Polynomial Time Invariants.
36-41 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Levin88">BibTeX</a></font>
<li><a name="CrepeauK88" href="../../indices/a-tree/c/Cr=eacute=peau:Claude.html">Claude Crépeau</a>, <a href="../../indices/a-tree/k/Kilian:Joe.html">Joe Kilian</a>:
Achieving Oblivious Transfer Using Weakened Security Assumptions (Extended Abstract).
42-52 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/CrepeauK88">BibTeX</a></font>
<li><a name="MansourST88" href="../../indices/a-tree/m/Mansour:Yishay.html">Yishay Mansour</a>, <a href="../../indices/a-tree/s/Schieber:Baruch.html">Baruch Schieber</a>, <a href="../../indices/a-tree/t/Tiwari:Prasoon.html">Prasoon Tiwari</a>:
Lower Bounds for Integer Greatest Common Divisor Computations (Extended Summary).
54-63 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/MansourST88">BibTeX</a></font>
<li><a name="Bshouty88" href="../../indices/a-tree/b/Bshouty:Nader_H=.html">Nader H. Bshouty</a>:
A Lower Bound for Matrix Multiplication.
64-67 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Bshouty88">BibTeX</a></font>
<li><a name="KahnKL88" href="../../indices/a-tree/k/Kahn:Jeff.html">Jeff Kahn</a>, <a href="../../indices/a-tree/k/Kalai:Gil.html">Gil Kalai</a>, <a href="../../indices/a-tree/l/Linial:Nathan.html">Nathan Linial</a>:
The Influence of Variables on Boolean Functions (Extended Abstract).
68-80 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/KahnKL88">BibTeX</a></font>
<li><a name="LovaszS88" href="../../indices/a-tree/l/Lov=aacute=sz:L=aacute=szl=oacute=.html">László Lovász</a>, <a href="../../indices/a-tree/s/Saks:Michael_E=.html">Michael E. Saks</a>:
Lattices, Möbius Functions and Communication Complexity.
81-90 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/LovaszS88">BibTeX</a></font>
<li><a name="Yao88" href="../../indices/a-tree/y/Yao:Andrew_Chi=Chih.html">Andrew Chi-Chih Yao</a>:
Near-Optimal Time-Space Tradeoff for Element Distinctness.
91-97 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Yao88">BibTeX</a></font>
<li><a name="HausslerLW88" href="../../indices/a-tree/h/Haussler:David.html">David Haussler</a>, <a href="../../indices/a-tree/l/Littlestone:Nick.html">Nick Littlestone</a>, <a href="../../indices/a-tree/w/Warmuth:Manfred_K=.html">Manfred K. Warmuth</a>:
Predicting {0,1}-Functions on Randomly Drawn Points (Extended Abstract).
100-109 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/HausslerLW88">BibTeX</a></font>
<li><a name="DeSantisMW88" href="../../indices/a-tree/s/Santis:Alfredo_De.html">Alfredo De Santis</a>, <a href="../../indices/a-tree/m/Markowsky:George.html">George Markowsky</a>, <a href="../../indices/a-tree/w/Wegman:Mark_N=.html">Mark N. Wegman</a>:
Learning Probabilistic Prediction Functions (Extended Abstract).
110-119 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/DeSantisMW88">BibTeX</a></font>
<li><a name="LinialMR88" href="../../indices/a-tree/l/Linial:Nathan.html">Nathan Linial</a>, <a href="../../indices/a-tree/m/Mansour:Yishay.html">Yishay Mansour</a>, <a href="../../indices/a-tree/r/Rivest:Ronald_L=.html">Ronald L. Rivest</a>:
Results on learnability and the Vapnik-Chervonenkis dimension (Extended Abstract).
120-129 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/LinialMR88">BibTeX</a></font>
<li><a name="GasarchS88" href="../../indices/a-tree/g/Gasarch:William_I=.html">William I. Gasarch</a>, <a href="../../indices/a-tree/s/Smith:Carl_H=.html">Carl H. Smith</a>:
Learning via Queries.
130-137 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/GasarchS88">BibTeX</a></font>
<li><a name="KomlosP88" href="../../indices/a-tree/k/Koml=oacute=s:J=aacute=nos.html">János Komlós</a>, <a href="../../indices/a-tree/p/Paturi:Ramamohan.html">Ramamohan Paturi</a>:
Effect of Connectivity in Associative Memory Models (Preliminary Version).
138-147 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/KomlosP88">BibTeX</a></font>
<li><a name="Klein88" href="../../indices/a-tree/k/Klein:Philip_N=.html">Philip N. Klein</a>:
Efficient Parallel Algorithms for Chordal Graphs.
150-161 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Klein88">BibTeX</a></font>
<li><a name="Luby88" href="../../indices/a-tree/l/Luby:Michael.html">Michael Luby</a>:
Removing Randomness in Parallel Computation Without a Processor Penalty.
162-173 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Luby88">BibTeX</a></font>
<li><a name="GoldbergPV88" href="../../indices/a-tree/g/Goldberg:Andrew_V=.html">Andrew V. Goldberg</a>, <a href="../../indices/a-tree/p/Plotkin:Serge_A=.html">Serge A. Plotkin</a>, <a href="../../indices/a-tree/v/Vaidya:Pravin_M=.html">Pravin M. Vaidya</a>:
Sublinear-Time Parallel Algorithms for Matching and Related Problems.
174-185 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/GoldbergPV88">BibTeX</a></font>
<li><a name="DahlhausHK88" href="../../indices/a-tree/d/Dahlhaus:Elias.html">Elias Dahlhaus</a>, <a href="../../indices/a-tree/h/Hajnal:P=eacute=ter.html">Péter Hajnal</a>, <a href="../../indices/a-tree/k/Karpinski:Marek.html">Marek Karpinski</a>:
Optimal Parallel Algorithm for the Hamiltonian Cycle Problem on Dense Graphs.
186-193 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/DahlhausHK88">BibTeX</a></font>
<li><a name="AlonA88" href="../../indices/a-tree/a/Alon:Noga.html">Noga Alon</a>, <a href="../../indices/a-tree/a/Azar:Yossi.html">Yossi Azar</a>:
Parallel Comparison Algorithms for Approximation Problems.
194-203 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AlonA88">BibTeX</a></font>
<li><a name="AwerbuchS88" href="../../indices/a-tree/a/Awerbuch:Baruch.html">Baruch Awerbuch</a>, <a href="../../indices/a-tree/s/Sipser:Michael.html">Michael Sipser</a>:
Dynamic Networks Are as Fast as Static Networks (Preliminary Version).
206-220 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AwerbuchS88">BibTeX</a></font>
<li><a name="Koch88" href="../../indices/a-tree/k/Koch:Richard_A=.html">Richard A. Koch</a>:
Increasing the Size of a Network by a Constant Factor Can Increase Performance by More Than a Constant Factor.
221-230 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Koch88">BibTeX</a></font>
<li><a name="Awerbuch88" href="../../indices/a-tree/a/Awerbuch:Baruch.html">Baruch Awerbuch</a>:
On the Effects of Feedback in Dynamic Network Protocols (Preliminary Version).
231-245 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Awerbuch88">BibTeX</a></font>
<li><a name="MosesW88" href="../../indices/a-tree/m/Moses:Yoram.html">Yoram Moses</a>, <a href="../../indices/a-tree/w/Waarts:Orli.html">Orli Waarts</a>:
Coordinated Traversal: (t + 1)-Round Byzantine Agreement in Polynomial Time.
246-255 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/MosesW88">BibTeX</a></font>
<li><a name="LeightonMR88" href="../../indices/a-tree/l/Leighton:Frank_Thomson.html">Frank Thomson Leighton</a>, <a href="../../indices/a-tree/m/Maggs:Bruce_M=.html">Bruce M. Maggs</a>, <a href="../../indices/a-tree/r/Rao:Satish.html">Satish Rao</a>:
Universal Packet Routing Algorithms (Extended Abstract).
256-269 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/LeightonMR88">BibTeX</a></font>
<li><a name="BabaiLS88" href="../../indices/a-tree/b/Babai:L=aacute=szl=oacute=.html">László Babai</a>, <a href="../../indices/a-tree/l/Luks:Eugene_M=.html">Eugene M. Luks</a>, <a href="../../indices/a-tree/s/Seress:=Aacute=kos.html">Ákos Seress</a>:
Fast Management of Permutation Groups.
272-282 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/BabaiLS88">BibTeX</a></font>
<li><a name="Shoup88" href="../../indices/a-tree/s/Shoup:Victor.html">Victor Shoup</a>:
New Algorithms for Finding Irreducible Polynomials over Finite Fields.
283-290 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Shoup88">BibTeX</a></font>
<li><a name="Renegar88" href="../../indices/a-tree/r/Renegar:James.html">James Renegar</a>:
A Faster PSPACE Algorithm for Deciding the Existential Theory of the Reals.
291-295 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Renegar88">BibTeX</a></font>
<li><a name="KaltofenT88" href="../../indices/a-tree/k/Kaltofen:Erich.html">Erich Kaltofen</a>, <a href="../../indices/a-tree/t/Trager:Barry_M=.html">Barry M. Trager</a>:
Computing with Polynomials Given By Black Boxes for Their Evaluation: Greatest Common Divisors, Factorization, Separation of Numerators and Denominators.
296-305 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/KaltofenT88">BibTeX</a></font>
<li><a name="CannyDRX88" href="../../indices/a-tree/c/Canny:John_F=.html">John F. Canny</a>, <a href="../../indices/a-tree/d/Donald:Bruce_Randall.html">Bruce Randall Donald</a>, <a href="../../indices/a-tree/r/Reif:John_H=.html">John H. Reif</a>, <a href="../../indices/a-tree/x/Xavier:Patrick_G=.html">Patrick G. Xavier</a>:
On the Complexity of Kinodynamic Planning.
306-316 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/CannyDRX88">BibTeX</a></font>
<li><a name="Safra88" href="../../indices/a-tree/s/Safra:Shmuel.html">Shmuel Safra</a>:
On the Complexity of omega-Automata.
319-327 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Safra88">BibTeX</a></font>
<li><a name="EmersonJ88" href="../../indices/a-tree/e/Emerson:E=_Allen.html">E. Allen Emerson</a>, <a href="../../indices/a-tree/j/Jutla:Charanjit_S=.html">Charanjit S. Jutla</a>:
The Complexity of Tree Automata and Logics of Programs (Extended Abstract).
328-337 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/EmersonJ88">BibTeX</a></font>
<li><a name="CourcoubetisY88" href="../../indices/a-tree/c/Courcoubetis:Costas.html">Costas Courcoubetis</a>, <a href="../../indices/a-tree/y/Yannakakis:Mihalis.html">Mihalis Yannakakis</a>:
Verifying Temporal Properties of Finite-State Probabilistic Programs.
338-345 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/CourcoubetisY88">BibTeX</a></font>
<li><a name="Ajtai88" href="../../indices/a-tree/a/Ajtai:Mikl=oacute=s.html">Miklós Ajtai</a>:
The Complexity of the Pigeonhole Principle.
346-355 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Ajtai88">BibTeX</a></font>
<li><a name="AjtaiF88" href="../../indices/a-tree/a/Ajtai:Mikl=oacute=s.html">Miklós Ajtai</a>, <a href="../../indices/a-tree/f/Fagin:Ronald.html">Ronald Fagin</a>:
Reachability Is Harder for Directed than for Undirected Finite Graphs (Preliminary Version).
358-367 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AjtaiF88">BibTeX</a></font>
<li><a name="Ong88" href="../../indices/a-tree/o/Ong:C==H=_Luke.html">C.-H. Luke Ong</a>:
Fully Abstract Models of the Lazy Lambda Calculus.
368-376 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Ong88">BibTeX</a></font>
<li><a name="McAllesterPS88" href="../../indices/a-tree/m/McAllester:David_A=.html">David A. McAllester</a>, <a href="../../indices/a-tree/p/Panangaden:Prakash.html">Prakash Panangaden</a>, <a href="../../indices/a-tree/s/Shanbhogue:Vasant.html">Vasant Shanbhogue</a>:
Nonexpressibility of Fairness and Signaling.
377-386 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/McAllesterPS88">BibTeX</a></font>
<li><a name="BlumSS88" href="../../indices/a-tree/b/Blum:Lenore.html">Lenore Blum</a>, <a href="../../indices/a-tree/s/Shub:Mike.html">Mike Shub</a>, <a href="../../indices/a-tree/s/Smale:Steve.html">Steve Smale</a>:
On a Theory of Computation over the Real Numbers; NP Completeness, Recursive Functions and Universal Machines (Extended Abstract).
387-397 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/BlumSS88">BibTeX</a></font>
<li><a name="MotwaniRS88" href="../../indices/a-tree/m/Motwani:Rajeev.html">Rajeev Motwani</a>, <a href="../../indices/a-tree/r/Raghunathan:Arvind.html">Arvind Raghunathan</a>, <a href="../../indices/a-tree/s/Saran:Huzur.html">Huzur Saran</a>:
Constructive Results from Graph Minors: Linkless Embeddings.
398-409 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/MotwaniRS88">BibTeX</a></font>
<li><a name="DagumLMV88" href="../../indices/a-tree/d/Dagum:Paul.html">Paul Dagum</a>, <a href="../../indices/a-tree/l/Luby:Michael.html">Michael Luby</a>, <a href="../../indices/a-tree/m/Mihail:Milena.html">Milena Mihail</a>, <a href="../../indices/a-tree/v/Vazirani:Umesh_V=.html">Umesh V. Vazirani</a>:
Polytopes, Permanents and Graphs with Large Factors.
412-421 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/DagumLMV88">BibTeX</a></font>
<li><a name="LeightonR88" href="../../indices/a-tree/l/Leighton:Frank_Thomson.html">Frank Thomson Leighton</a>, <a href="../../indices/a-tree/r/Rao:Satish.html">Satish Rao</a>:
An Approximate Max-Flow Min-Cut Theorem for Uniform Multicommodity Flow Problems with Applications to Approximation Algorithms.
422-431 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/LeightonR88">BibTeX</a></font>
<li><a name="GoldbergPT88" href="../../indices/a-tree/g/Goldberg:Andrew_V=.html">Andrew V. Goldberg</a>, <a href="../../indices/a-tree/p/Plotkin:Serge_A=.html">Serge A. Plotkin</a>, <a href="../../indices/a-tree/t/Tardos:=Eacute=va.html">Éva Tardos</a>:
Combinatorial Algorithms for the Generalized Circulation Problem.
432-443 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/GoldbergPT88">BibTeX</a></font>
<li><a name="GoldschmidtH88" href="../../indices/a-tree/g/Goldschmidt:Olivier.html">Olivier Goldschmidt</a>, <a href="../../indices/a-tree/h/Hochbaum:Dorit_S=.html">Dorit S. Hochbaum</a>:
Polynomial Algorithm for the k-Cut Problem.
444-451 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/GoldschmidtH88">BibTeX</a></font>
<li><a name="Clarkson88" href="../../indices/a-tree/c/Clarkson:Kenneth_L=.html">Kenneth L. Clarkson</a>:
A Las Vegas Algorithm for Linear Programming When the Dimension Is Small.
452-456 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Clarkson88">BibTeX</a></font>
<li><a name="Malitz88" href="../../indices/a-tree/m/Malitz:Seth_M=.html">Seth M. Malitz</a>:
Genus g Graphs have Pagenumber O(sqrt(g)).
458-468 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Malitz88">BibTeX</a></font>
<li><a name="BhattC88" href="../../indices/a-tree/b/Bhatt:Sandeep_N=.html">Sandeep N. Bhatt</a>, <a href="../../indices/a-tree/c/Cai:Jin=yi.html">Jin-yi Cai</a>:
Take a Walk, Grow a Tree (Preliminary Version).
469-478 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/BhattC88">BibTeX</a></font>
<li><a name="BroderK88" href="../../indices/a-tree/b/Broder:Andrei_Z=.html">Andrei Z. Broder</a>, <a href="../../indices/a-tree/k/Karlin:Anna_R=.html">Anna R. Karlin</a>:
Bounds on the Cover Time (Preliminary Version).
479-487 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/BroderK88">BibTeX</a></font>
<li><a name="EppsteinGG88" href="../../indices/a-tree/e/Eppstein:David.html">David Eppstein</a>, <a href="../../indices/a-tree/g/Galil:Zvi.html">Zvi Galil</a>, <a href="../../indices/a-tree/g/Giancarlo:Raffaele.html">Raffaele Giancarlo</a>:
Speeding up Dynamic Programming.
488-496 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/EppsteinGG88">BibTeX</a></font>
<li><a name="AggarwalP88" href="../../indices/a-tree/a/Aggarwal:Alok.html">Alok Aggarwal</a>, <a href="../../indices/a-tree/p/Park:James_K=.html">James K. Park</a>:
Notes on Searching in Multidimensional Monotone Arrays (Preliminary Version).
497-512 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AggarwalP88">BibTeX</a></font>
<li><a name="FredmanG88" href="../../indices/a-tree/f/Fredman:Michael_L=.html">Michael L. Fredman</a>, <a href="../../indices/a-tree/g/Goldsmith:Deborah_L=.html">Deborah L. Goldsmith</a>:
Three Stacks.
514-523 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/FredmanG88">BibTeX</a></font>
<li><a name="DietzfelbingerKMHRT88" href="../../indices/a-tree/d/Dietzfelbinger:Martin.html">Martin Dietzfelbinger</a>, <a href="../../indices/a-tree/k/Karlin:Anna_R=.html">Anna R. Karlin</a>, <a href="../../indices/a-tree/m/Mehlhorn:Kurt.html">Kurt Mehlhorn</a>, <a href="../../indices/a-tree/h/Heide:Friedhelm_Meyer_auf_der.html">Friedhelm Meyer auf der Heide</a>, <a href="../../indices/a-tree/r/Rohnert:Hans.html">Hans Rohnert</a>, <a href="../../indices/a-tree/t/Tarjan:Robert_Endre.html">Robert Endre Tarjan</a>:
Dynamic Perfect Hashing: Upper and Lower Bounds.
524-531 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/DietzfelbingerKMHRT88">BibTeX</a></font>
<li><a name="Ben-AmramG88" href="../../indices/a-tree/b/Ben=Amram:Amir_M=.html">Amir M. Ben-Amram</a>, <a href="../../indices/a-tree/g/Galil:Zvi.html">Zvi Galil</a>:
On Pointers versus Addresses (Extended Abstract).
532-538 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Ben-AmramG88">BibTeX</a></font>
<li><a name="ChazelleF88" href="../../indices/a-tree/c/Chazelle:Bernard.html">Bernard Chazelle</a>, <a href="../../indices/a-tree/f/Friedman:Joel.html">Joel Friedman</a>:
A Deterministic View of Random Sampling and its Use in Geometry.
539-549 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/ChazelleF88">BibTeX</a></font>
<li><a name="OvermarsY88" href="../../indices/a-tree/o/Overmars:Mark_H=.html">Mark H. Overmars</a>, <a href="../../indices/a-tree/y/Yap:Chee=Keng.html">Chee-Keng Yap</a>:
New upper bounds in Klee's measure problem (extended abstract).
550-556 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/OvermarsY88">BibTeX</a></font>
<li><a name="PreparataT88" href="../../indices/a-tree/p/Preparata:Franco_P=.html">Franco P. Preparata</a>, <a href="../../indices/a-tree/t/Tamassia:Roberto.html">Roberto Tamassia</a>:
Fully Dynamic Techniques for Point Location and Transitive Closure in Planar Structures (Extended Abstract).
558-567 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/PreparataT88">BibTeX</a></font>
<li><a name="ClarksonEGSW88" href="../../indices/a-tree/c/Clarkson:Kenneth_L=.html">Kenneth L. Clarkson</a>, <a href="../../indices/a-tree/e/Edelsbrunner:Herbert.html">Herbert Edelsbrunner</a>, <a href="../../indices/a-tree/g/Guibas:Leonidas_J=.html">Leonidas J. Guibas</a>, <a href="../../indices/a-tree/s/Sharir:Micha.html">Micha Sharir</a>, <a href="../../indices/a-tree/w/Welzl:Emo.html">Emo Welzl</a>:
Combinatorial Complexity Bounds for Arrangements of Curves and Surfaces.
568-579 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/ClarksonEGSW88">BibTeX</a></font>
<li><a name="Mulmuley88" href="../../indices/a-tree/m/Mulmuley:Ketan.html">Ketan Mulmuley</a>:
A Fast Planar Partition Algorithm, I (Extended Abstract).
580-589 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Mulmuley88">BibTeX</a></font>
<li><a name="ChazelleE88" href="../../indices/a-tree/c/Chazelle:Bernard.html">Bernard Chazelle</a>, <a href="../../indices/a-tree/e/Edelsbrunner:Herbert.html">Herbert Edelsbrunner</a>:
An Optimal Algorithm for Intersecting Line Segments in the Plane.
590-600 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/ChazelleE88">BibTeX</a></font>
<li><a name="CulbersonR88" href="../../indices/a-tree/c/Culberson:Joseph_C=.html">Joseph C. Culberson</a>, <a href="../../indices/a-tree/r/Reckhow:Robert_A=.html">Robert A. Reckhow</a>:
Covering Polygons Is Hard (Preliminary Abstract).
601-611 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/CulbersonR88">BibTeX</a></font>
</ul><p><div class="footer">
<a href="../../index.html">Home</a> | <a href="../indexa.html">Conferences</a> | <a href="../../journals/index.html">Journals</a> | <a href="../../series/index.html">Series</a> | <a href="../../about/faq.html">FAQ</a> — Search: <a href="http://dblp.l3s.de">Faceted</a> | <a href="http://dblp.mpi-inf.mpg.de/dblp-mirror/index.php">Complete</a> | <a href="../../indices/a-tree/index.html">Author</a></div>
<small><a href="../../copyright.html">Copyright ©</a> Sat May 16 23:12:25 2009
by <a href="http://www.informatik.uni-trier.de/~ley/addr.html">Michael Ley</a> (<a href="mailto:ley@uni-trier.de">ley@uni-trier.de</a>)</small></p></body></html>
SIGMOD News
