focs86.html
Click here to view the file
or
click here to download the file
File contents
<html><head><title>27. FOCS 1986: Toronto, Canada</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>27. <a href="index.html">FOCS</a> 1986: Toronto, Canada</h1> 27th Annual Symposium on Foundations of Computer Science, Toronto, Canada, 27-29 October 1986. IEEE Computer Society <ul> <li><a name="GalilT86" href="../../indices/a-tree/g/Galil:Zvi.html">Zvi Galil</a>, <a href="../../indices/a-tree/t/Tardos:=Eacute=va.html">Éva Tardos</a>: An O(n^2 (m + n log n) log n) Min-Cost Flow Algorithm. 1-9 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/GalilT86">BibTeX</a></font> <li><a name="Raghavan86" href="../../indices/a-tree/r/Raghavan:Prabhakar.html">Prabhakar Raghavan</a>: Probabilistic Construction of Deterministic Algorithms: Approximating Packing Integer Programs. 10-18 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Raghavan86">BibTeX</a></font> <li><a name="KarpSW86" href="../../indices/a-tree/k/Karp:Richard_M=.html">Richard M. Karp</a>, <a href="../../indices/a-tree/s/Saks:Michael_E=.html">Michael E. Saks</a>, <a href="../../indices/a-tree/w/Wigderson:Avi.html">Avi Wigderson</a>: On a Search Problem Related to Branch-and-Bound Procedures. 19-28 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/KarpSW86">BibTeX</a></font> <li><a name="SaksW86" href="../../indices/a-tree/s/Saks:Michael_E=.html">Michael E. Saks</a>, <a href="../../indices/a-tree/w/Wigderson:Avi.html">Avi Wigderson</a>: Probabilistic Boolean Decision Trees and the Complexity of Evaluating Game Trees. 29-38 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/SaksW86">BibTeX</a></font> <li><a name="LinialLW86" href="../../indices/a-tree/l/Linial:Nathan.html">Nathan Linial</a>, <a href="../../indices/a-tree/l/Lov=aacute=sz:L=aacute=szl=oacute=.html">László Lovász</a>, <a href="../../indices/a-tree/w/Wigderson:Avi.html">Avi Wigderson</a>: A Physical Interpretation of Graph Connectivity, and Its Algorithmic Applications. 39-48 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/LinialLW86">BibTeX</a></font> <li><a name="Strassen86" href="../../indices/a-tree/s/Strassen:Volker.html">Volker Strassen</a>: The Asymptotic Spectrum of Tensors and the Exponent of Matrix Multiplication. 49-54 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Strassen86">BibTeX</a></font> <li><a name="AhoL86" href="../../indices/a-tree/a/Aho:Alfred_V=.html">Alfred V. Aho</a>, <a href="../../indices/a-tree/l/Lee:David.html">David Lee</a>: Storing a Dynamic Sparse Table. 55-60 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AhoL86">BibTeX</a></font> <li><a name="Wilber86" href="../../indices/a-tree/w/Wilber:Robert_E=.html">Robert E. Wilber</a>: Lower Bounds for Accessing Binary Search Trees With Rotations (Preliminary Version). 61-70 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Wilber86">BibTeX</a></font> <li><a name="Mutchler86" href="../../indices/a-tree/m/Mutchler:David.html">David Mutchler</a>: What search algorithm gives optimal average-case performance when search resources are highly limited? 71-76 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Mutchler86">BibTeX</a></font> <li><a name="SharirCKLPS86" href="../../indices/a-tree/s/Sharir:Micha.html">Micha Sharir</a>, <a href="../../indices/a-tree/c/Cole:Richard.html">Richard Cole</a>, <a href="../../indices/a-tree/k/Kedem:Klara.html">Klara Kedem</a>, <a href="../../indices/a-tree/l/Leven:Daniel.html">Daniel Leven</a>, <a href="../../indices/a-tree/p/Pollack:Richard.html">Richard Pollack</a>, <a href="../../indices/a-tree/s/Sifrony:Shmuel.html">Shmuel Sifrony</a>: Geometric Applications of Davenport-Schinzel Sequences. 77-86 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/SharirCKLPS86">BibTeX</a></font> <li><a name="Chazelle86" href="../../indices/a-tree/c/Chazelle:Bernard.html">Bernard Chazelle</a>: Lower Bounds on the Complexity of Multidimensional Searching (Extended Abstract). 87-96 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Chazelle86">BibTeX</a></font> <li><a name="Wiernik86" href="../../indices/a-tree/w/Wiernik:Ady.html">Ady Wiernik</a>: Planar Realizations of Nonlinear Davenport-Schinzel Sequences by Segments. 97-106 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Wiernik86">BibTeX</a></font> <li><a name="Hong86" href="../../indices/a-tree/h/Hong:Jiawei.html">Jiawei Hong</a>: Proving by Example and Gap Theorems. 107-116 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Hong86">BibTeX</a></font> <li><a name="Vaidya86" href="../../indices/a-tree/v/Vaidya:Pravin_M=.html">Pravin M. Vaidya</a>: An optimal algorithm for the All-Nearest-Neighbors Problem. 117-122 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Vaidya86">BibTeX</a></font> <li><a name="PlantingaD86" href="../../indices/a-tree/p/Plantinga:W=_Harry.html">W. Harry Plantinga</a>, <a href="../../indices/a-tree/d/Dyer:Charles_R=.html">Charles R. Dyer</a>: An Algorithm for Constructing the Aspect Graph. 123-131 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/PlantingaD86">BibTeX</a></font> <li><a name="Natarajan86" href="../../indices/a-tree/n/Natarajan:B=_K=.html">B. K. Natarajan</a>: An Algorithmic Approach to the Automated Design of Parts Orienters. 132-142 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Natarajan86">BibTeX</a></font> <li><a name="GreeneY86" href="../../indices/a-tree/g/Greene:Daniel_H=.html">Daniel H. Greene</a>, <a href="../../indices/a-tree/y/Yao:F=_Frances.html">F. Frances Yao</a>: Finite-Resolution Computational Geometry. 143-152 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/GreeneY86">BibTeX</a></font> <li><a name="Friedman86" href="../../indices/a-tree/f/Friedman:Joel.html">Joel Friedman</a>: On Newton's Method for Polynomials. 153-161 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Friedman86">BibTeX</a></font> <li><a name="Yao86" href="../../indices/a-tree/y/Yao:Andrew_Chi=Chih.html">Andrew Chi-Chih Yao</a>: How to Generate and Exchange Secrets (Extended Abstract). 162-167 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Yao86">BibTeX</a></font> <li><a name="BrassardCR86" href="../../indices/a-tree/b/Brassard:Gilles.html">Gilles Brassard</a>, <a href="../../indices/a-tree/c/Cr=eacute=peau:Claude.html">Claude Crépeau</a>, <a href="../../indices/a-tree/r/Robert:Jean=Marc.html">Jean-Marc Robert</a>: Information Theoretic Reductions among Disclosure Problems. 168-173 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/BrassardCR86">BibTeX</a></font> <li><a name="GoldreichMW86" href="../../indices/a-tree/g/Goldreich:Oded.html">Oded Goldreich</a>, <a href="../../indices/a-tree/m/Micali:Silvio.html">Silvio Micali</a>, <a href="../../indices/a-tree/w/Wigderson:Avi.html">Avi Wigderson</a>: Proofs that Yield Nothing But their Validity and a Methodology of Cryptographic Protocol Design (Extended Abstract). 174-187 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/GoldreichMW86">BibTeX</a></font> <li><a name="BrassardC86" href="../../indices/a-tree/b/Brassard:Gilles.html">Gilles Brassard</a>, <a href="../../indices/a-tree/c/Cr=eacute=peau:Claude.html">Claude Crépeau</a>: Non-Transitive Transfer of Confidence: A Perfect Zero-Knowledge Interactive Protocol for SAT and Beyond. 188-195 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/BrassardC86">BibTeX</a></font> <li><a name="AwerbuchM86" href="../../indices/a-tree/a/Awerbuch:Baruch.html">Baruch Awerbuch</a>, <a href="../../indices/a-tree/m/Micali:Silvio.html">Silvio Micali</a>: Dynamic deadlock resolution protocols (Extended Abstract). 196-207 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AwerbuchM86">BibTeX</a></font> <li><a name="MosesT86" href="../../indices/a-tree/m/Moses:Yoram.html">Yoram Moses</a>, <a href="../../indices/a-tree/t/Tuttle:Mark_R=.html">Mark R. Tuttle</a>: Programming Simultaneous Actions Using Common Knowledge: Preliminary Version. 208-221 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/MosesT86">BibTeX</a></font> <li><a name="DworkSS86" href="../../indices/a-tree/d/Dwork:Cynthia.html">Cynthia Dwork</a>, <a href="../../indices/a-tree/s/Shmoys:David_B=.html">David B. Shmoys</a>, <a href="../../indices/a-tree/s/Stockmeyer:Larry_J=.html">Larry J. Stockmeyer</a>: Flipping Persuasively in Constant Expected Time (Preliminary Version). 222-232 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/DworkSS86">BibTeX</a></font> <li><a name="VitanyiA86" href="../../indices/a-tree/v/Vit=aacute=nyi:Paul_M=_B=.html">Paul M. B. Vitányi</a>, <a href="../../indices/a-tree/a/Awerbuch:Baruch.html">Baruch Awerbuch</a>: Atomic Shared Register Access by Asynchronous Hardware (Detailed Abstract). 233-243 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/VitanyiA86">BibTeX</a></font> <li><a name="KarlinMRS86" href="../../indices/a-tree/k/Karlin:Anna_R=.html">Anna R. Karlin</a>, <a href="../../indices/a-tree/m/Manasse:Mark_S=.html">Mark S. Manasse</a>, <a href="../../indices/a-tree/r/Rudolph:Larry.html">Larry Rudolph</a>, <a href="../../indices/a-tree/s/Sleator:Daniel_Dominic.html">Daniel Dominic Sleator</a>: Competitive Snoopy Caching. 244-254 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/KarlinMRS86">BibTeX</a></font> <li><a name="MaSS86" href="../../indices/a-tree/m/Ma:Yiming.html">Yiming Ma</a>, <a href="../../indices/a-tree/s/Sen:Sandeep.html">Sandeep Sen</a>, <a href="../../indices/a-tree/s/Scherson:Isaac_D=.html">Isaac D. Scherson</a>: The Distance Bound for Sorting on Mesh-Connected Processor Arrays Is Tight (Preliminary Report). 255-263 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/MaSS86">BibTeX</a></font> <li><a name="Stout86" href="../../indices/a-tree/s/Stout:Quentin_F=.html">Quentin F. Stout</a>: Meshes with Multiple Buses. 264-273 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Stout86">BibTeX</a></font> <li><a name="BhattCLR86" href="../../indices/a-tree/b/Bhatt:Sandeep_N=.html">Sandeep N. Bhatt</a>, <a href="../../indices/a-tree/c/Chung:Fan_R=_K=.html">Fan R. K. Chung</a>, <a href="../../indices/a-tree/l/Leighton:Frank_Thomson.html">Frank Thomson Leighton</a>, <a href="../../indices/a-tree/r/Rosenberg:Arnold_L=.html">Arnold L. Rosenberg</a>: Optimal Simulations of Tree Machines (Preliminary Version). 274-282 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/BhattCLR86">BibTeX</a></font> <li><a name="BeckerS86" href="../../indices/a-tree/b/Becker:Bernd.html">Bernd Becker</a>, <a href="../../indices/a-tree/s/Simon:Hans=Ulrich.html">Hans-Ulrich Simon</a>: How Robust Is the n-Cube? (Extended Abstract). 283-291 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/BeckerS86">BibTeX</a></font> <li><a name="Luks86" href="../../indices/a-tree/l/Luks:Eugene_M=.html">Eugene M. Luks</a>: Parallel Algorithms for Permutation Groups and Graph Isomorphism. 292-302 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Luks86">BibTeX</a></font> <li><a name="Babai86" href="../../indices/a-tree/b/Babai:L=aacute=szl=oacute=.html">László Babai</a>: A Las Vegas-NC Algorithm for isomorphism of graphs with bounded multiplicity of eigenvalues. 303-312 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Babai86">BibTeX</a></font> <li><a name="GarzonZ86" href="../../indices/a-tree/g/Garzon:Max_H=.html">Max H. Garzon</a>, <a href="../../indices/a-tree/z/Zalcstein:Yechezkel.html">Yechezkel Zalcstein</a>: The Complexity of Isomorphism Testing. 313-321 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/GarzonZ86">BibTeX</a></font> <li><a name="FloydK86" href="../../indices/a-tree/f/Floyd:Sally.html">Sally Floyd</a>, <a href="../../indices/a-tree/k/Karp:Richard_M=.html">Richard M. Karp</a>: FFD Bin Packing for Item Sizes with Distributions on [0,1/2]. 322-330 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/FloydK86">BibTeX</a></font> <li><a name="DyerF86" href="../../indices/a-tree/d/Dyer:Martin_E=.html">Martin E. Dyer</a>, <a href="../../indices/a-tree/f/Frieze:Alan_M=.html">Alan M. Frieze</a>: Fast Solution of Some Random NP-Hard Problems. 331-336 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/DyerF86">BibTeX</a></font> <li><a name="BabaiFS86" href="../../indices/a-tree/b/Babai:L=aacute=szl=oacute=.html">László Babai</a>, <a href="../../indices/a-tree/f/Frankl:Peter.html">Peter Frankl</a>, <a href="../../indices/a-tree/s/Simon:Janos.html">Janos Simon</a>: Complexity classes in communication complexity theory (preliminary version). 337-347 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/BabaiFS86">BibTeX</a></font> <li><a name="VenkateswaranT86" href="../../indices/a-tree/v/Venkateswaran:H=.html">H. Venkateswaran</a>, <a href="../../indices/a-tree/t/Tompa:Martin.html">Martin Tompa</a>: A New Pebble Game that Characterizes Parallel Complexity Classes. 348-360 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/VenkateswaranT86">BibTeX</a></font> <li><a name="ChrobakL86" href="../../indices/a-tree/c/Chrobak:Marek.html">Marek Chrobak</a>, <a href="../../indices/a-tree/l/Li:Ming.html">Ming Li</a>: k+1 Heads Are Better than k for PDA's. 361-367 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/ChrobakL86">BibTeX</a></font> <li><a name="AielloGH86" href="../../indices/a-tree/a/Aiello:William.html">William Aiello</a>, <a href="../../indices/a-tree/g/Goldwasser:Shafi.html">Shafi Goldwasser</a>, <a href="../../indices/a-tree/h/H=aring=stad:Johan.html">Johan Håstad</a>: On the Power of Interaction. 368-379 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AielloGH86">BibTeX</a></font> <li><a name="KurtzMR86" href="../../indices/a-tree/k/Kurtz:Stuart_A=.html">Stuart A. Kurtz</a>, <a href="../../indices/a-tree/m/Mahaney:Stephen_R=.html">Stephen R. Mahaney</a>, <a href="../../indices/a-tree/r/Royer:James_S=.html">James S. Royer</a>: Collapsing Degrees (Extended Abstract). 380-389 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/KurtzMR86">BibTeX</a></font> <li><a name="GoldsmithJ86" href="../../indices/a-tree/g/Goldsmith:Judy.html">Judy Goldsmith</a>, <a href="../../indices/a-tree/j/Joseph:Deborah.html">Deborah Joseph</a>: Three Results on the Polynomial Isomorphism of Complete Sets. 390-397 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/GoldsmithJ86">BibTeX</a></font> <li><a name="Gathen86" href="../../indices/a-tree/g/Gathen:Joachim_von_zur.html">Joachim von zur Gathen</a>: Permanent and Determinant. 398-401 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Gathen86">BibTeX</a></font> <li><a name="Abrahamson86" href="../../indices/a-tree/a/Abrahamson:Karl_R=.html">Karl R. Abrahamson</a>: Time-Space Tradeoffs for Branching Programs Contrasted with those for Straight-Line Programs. 402-409 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Abrahamson86">BibTeX</a></font> <li><a name="AlonM86" href="../../indices/a-tree/a/Alon:Noga.html">Noga Alon</a>, <a href="../../indices/a-tree/m/Maass:Wolfgang.html">Wolfgang Maass</a>: Meanders, Ramsey Theory and Lower Bounds for Branching Programs. 410-417 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AlonM86">BibTeX</a></font> <li><a name="PelegU86" href="../../indices/a-tree/p/Peleg:David.html">David Peleg</a>, <a href="../../indices/a-tree/u/Upfal:Eli.html">Eli Upfal</a>: The Token Distribution Problem (Preliminary Version). 418-427 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/PelegU86">BibTeX</a></font> <li><a name="FredericksonJ86" href="../../indices/a-tree/f/Frederickson:Greg_N=.html">Greg N. Frederickson</a>, <a href="../../indices/a-tree/j/Janardan:Ravi.html">Ravi Janardan</a>: Separator-Based Strategies for Efficient Message Routing (Preliminary Version). 428-437 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/FredericksonJ86">BibTeX</a></font> <li><a name="UllmanG86" href="../../indices/a-tree/u/Ullman:Jeffrey_D=.html">Jeffrey D. Ullman</a>, <a href="../../indices/a-tree/g/Gelder:Allen_Van.html">Allen Van Gelder</a>: Parallel Complexity of Logical Query Programs. 438-454 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/UllmanG86">BibTeX</a></font> <li><a name="ChangIV86" href="../../indices/a-tree/c/Chang:Jik_H=.html">Jik H. Chang</a>, <a href="../../indices/a-tree/i/Ibarra:Oscar_H=.html">Oscar H. Ibarra</a>, <a href="../../indices/a-tree/v/Vergis:Anastasios.html">Anastasios Vergis</a>: On the Power of One-Way Communication. 455-464 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/ChangIV86">BibTeX</a></font> <li><a name="KleinR86" href="../../indices/a-tree/k/Klein:Philip_N=.html">Philip N. Klein</a>, <a href="../../indices/a-tree/r/Reif:John_H=.html">John H. Reif</a>: An Efficient Parallel Algorithm for Planarity. 465-477 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/KleinR86">BibTeX</a></font> <li><a name="ColeV86" href="../../indices/a-tree/c/Cole:Richard.html">Richard Cole</a>, <a href="../../indices/a-tree/v/Vishkin:Uzi.html">Uzi Vishkin</a>: Approximate and Exact Parallel Scheduling with Applications to List, Tree and Graph Problems. 478-491 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/ColeV86">BibTeX</a></font> <li><a name="Gazit86" href="../../indices/a-tree/g/Gazit:Hillel.html">Hillel Gazit</a>: An Optimal Randomized Parallel Algorithm for Finding Connected Components in a Graph. 492-501 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Gazit86">BibTeX</a></font> <li><a name="AlonAV86" href="../../indices/a-tree/a/Alon:Noga.html">Noga Alon</a>, <a href="../../indices/a-tree/a/Azar:Yossi.html">Yossi Azar</a>, <a href="../../indices/a-tree/v/Vishkin:Uzi.html">Uzi Vishkin</a>: Tight Complexity Bounds for Parallel Comparison Sorting. 502-510 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AlonAV86">BibTeX</a></font> <li><a name="Cole86" href="../../indices/a-tree/c/Cole:Richard.html">Richard Cole</a>: Parallel Merge Sort. 511-516 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Cole86">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
