Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/conf/wads/wads93.bht:"
download as .bib file
@inproceedings{DBLP:conf/wads/AgarwalK93,
author = {Pankaj K. Agarwal and
Marc J. van Kreveld},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro and
Sue Whitesides},
title = {Connected Component and Simple Polygon Intersection Searching (Extended
Abstract)},
booktitle = {Algorithms and Data Structures, Third Workshop, {WADS} '93, Montr{\'{e}}al,
Canada, August 11-13, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {709},
pages = {36--47},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57155-8\_234},
doi = {10.1007/3-540-57155-8\_234},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/wads/AgarwalK93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/Amato93,
author = {Nancy M. Amato},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro and
Sue Whitesides},
title = {An Optimal Algorithm for Finding the Separation of Simple Polygons},
booktitle = {Algorithms and Data Structures, Third Workshop, {WADS} '93, Montr{\'{e}}al,
Canada, August 11-13, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {709},
pages = {48--59},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57155-8\_235},
doi = {10.1007/3-540-57155-8\_235},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/Amato93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/Andersson93,
author = {Arne Andersson},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro and
Sue Whitesides},
title = {Balanced Search Trees Made Simple},
booktitle = {Algorithms and Data Structures, Third Workshop, {WADS} '93, Montr{\'{e}}al,
Canada, August 11-13, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {709},
pages = {60--71},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57155-8\_236},
doi = {10.1007/3-540-57155-8\_236},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wads/Andersson93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/AokiIIR93,
author = {Yasukazu Aoki and
Hiroshi Imai and
Keiko Imai and
David Rappaport},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro and
Sue Whitesides},
title = {Probing a Set of Hyperplanes by Lines and Related Problems},
booktitle = {Algorithms and Data Structures, Third Workshop, {WADS} '93, Montr{\'{e}}al,
Canada, August 11-13, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {709},
pages = {72--82},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57155-8\_237},
doi = {10.1007/3-540-57155-8\_237},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/AokiIIR93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/ArgeKL93,
author = {Lars Arge and
Mikael B. Knudsen and
Kirsten Larsen},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro and
Sue Whitesides},
title = {A General Lower Bound on the I/O-Complexity of Comparison-based Algorithms},
booktitle = {Algorithms and Data Structures, Third Workshop, {WADS} '93, Montr{\'{e}}al,
Canada, August 11-13, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {709},
pages = {83--94},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57155-8\_238},
doi = {10.1007/3-540-57155-8\_238},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/ArgeKL93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/ArkinGMMPS93,
author = {Esther M. Arkin and
Michael T. Goodrich and
Joseph S. B. Mitchell and
David M. Mount and
Christine D. Piatko and
Steven Skiena},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro and
Sue Whitesides},
title = {Point Probe Decision Trees for Geometric Concept Classes},
booktitle = {Algorithms and Data Structures, Third Workshop, {WADS} '93, Montr{\'{e}}al,
Canada, August 11-13, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {709},
pages = {95--106},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57155-8\_239},
doi = {10.1007/3-540-57155-8\_239},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/ArkinGMMPS93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/ArmonR93,
author = {Deganit Armon and
John H. Reif},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro and
Sue Whitesides},
title = {A Dynamic Separator Algorithm},
booktitle = {Algorithms and Data Structures, Third Workshop, {WADS} '93, Montr{\'{e}}al,
Canada, August 11-13, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {709},
pages = {107--118},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57155-8\_240},
doi = {10.1007/3-540-57155-8\_240},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/ArmonR93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/AtallahC93,
author = {Mikhail J. Atallah and
Danny Z. Chen},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro and
Sue Whitesides},
title = {Computing the All-Pairs Longest Chain in the Plane},
booktitle = {Algorithms and Data Structures, Third Workshop, {WADS} '93, Montr{\'{e}}al,
Canada, August 11-13, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {709},
pages = {1--13},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57155-8\_229},
doi = {10.1007/3-540-57155-8\_229},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/AtallahC93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/AzarKPPW93,
author = {Yossi Azar and
Bala Kalyanasundaram and
Serge A. Plotkin and
Kirk Pruhs and
Orli Waarts},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro and
Sue Whitesides},
title = {Online Load Balancing of Temporary Tasks},
booktitle = {Algorithms and Data Structures, Third Workshop, {WADS} '93, Montr{\'{e}}al,
Canada, August 11-13, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {709},
pages = {119--130},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57155-8\_241},
doi = {10.1007/3-540-57155-8\_241},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/AzarKPPW93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BalakrishnanRR93,
author = {Hari Balakrishnan and
Anand Rajaraman and
C. Pandu Rangan},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro and
Sue Whitesides},
title = {Connected Domination and Steiner Set on Asteroidal Triple-Free Graphs},
booktitle = {Algorithms and Data Structures, Third Workshop, {WADS} '93, Montr{\'{e}}al,
Canada, August 11-13, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {709},
pages = {131--141},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57155-8\_242},
doi = {10.1007/3-540-57155-8\_242},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/BalakrishnanRR93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BalasubramanianRS93,
author = {R. Balasubramanian and
Venkatesh Raman and
G. Srinivasaraghavan},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro and
Sue Whitesides},
title = {The Complexity of Finding Certain Trees in Tournaments},
booktitle = {Algorithms and Data Structures, Third Workshop, {WADS} '93, Montr{\'{e}}al,
Canada, August 11-13, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {709},
pages = {142--150},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57155-8\_243},
doi = {10.1007/3-540-57155-8\_243},
timestamp = {Fri, 21 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/BalasubramanianRS93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BattistaLV93,
author = {Giuseppe Di Battista and
Giuseppe Liotta and
Francesco Vargiu},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro and
Sue Whitesides},
title = {Spirality of Orthogonal Representations and Optimal Drawings of Series-Parallel
Graphs and 3-Planar Graphs (Extended Abstract)},
booktitle = {Algorithms and Data Structures, Third Workshop, {WADS} '93, Montr{\'{e}}al,
Canada, August 11-13, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {709},
pages = {151--162},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57155-8\_244},
doi = {10.1007/3-540-57155-8\_244},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/BattistaLV93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BeameFS93,
author = {Paul Beame and
Faith E. Fich and
Rakesh K. Sinha},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro and
Sue Whitesides},
title = {Separating the Power of {EREW} and {CREW} PRAMs with Small Communication
Width},
booktitle = {Algorithms and Data Structures, Third Workshop, {WADS} '93, Montr{\'{e}}al,
Canada, August 11-13, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {709},
pages = {163--174},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57155-8\_245},
doi = {10.1007/3-540-57155-8\_245},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/BeameFS93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BerkmanMR93,
author = {Omer Berkman and
Yossi Matias and
Prabhakar Ragde},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro and
Sue Whitesides},
title = {Triply-Logarithmic Upper and Lower Bounds for Minimum, Range Minima,
and Related Problems with Integer Inputs},
booktitle = {Algorithms and Data Structures, Third Workshop, {WADS} '93, Montr{\'{e}}al,
Canada, August 11-13, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {709},
pages = {175--187},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57155-8\_246},
doi = {10.1007/3-540-57155-8\_246},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/BerkmanMR93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BernET93,
author = {Marshall W. Bern and
David Eppstein and
Shang{-}Hua Teng},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro and
Sue Whitesides},
title = {Parallel Construction of Quadtrees and Quality Triangulations},
booktitle = {Algorithms and Data Structures, Third Workshop, {WADS} '93, Montr{\'{e}}al,
Canada, August 11-13, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {709},
pages = {188--199},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57155-8\_247},
doi = {10.1007/3-540-57155-8\_247},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/BernET93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/Borodin93,
author = {Allan Borodin},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro and
Sue Whitesides},
title = {Towards a Better Understanding of the Pure Packet Routing},
booktitle = {Algorithms and Data Structures, Third Workshop, {WADS} '93, Montr{\'{e}}al,
Canada, August 11-13, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {709},
pages = {14--25},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57155-8\_230},
doi = {10.1007/3-540-57155-8\_230},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/Borodin93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BoseBL93,
author = {Prosenjit Bose and
Jonathan F. Buss and
Anna Lubiw},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro and
Sue Whitesides},
title = {Pattern Matching for Permutations},
booktitle = {Algorithms and Data Structures, Third Workshop, {WADS} '93, Montr{\'{e}}al,
Canada, August 11-13, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {709},
pages = {200--209},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57155-8\_248},
doi = {10.1007/3-540-57155-8\_248},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/BoseBL93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BoseKT93,
author = {Prosenjit Bose and
Marc J. van Kreveld and
Godfried T. Toussaint},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro and
Sue Whitesides},
title = {Filling Polyhedral Molds},
booktitle = {Algorithms and Data Structures, Third Workshop, {WADS} '93, Montr{\'{e}}al,
Canada, August 11-13, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {709},
pages = {210--221},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57155-8\_249},
doi = {10.1007/3-540-57155-8\_249},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/BoseKT93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/ChangPL93,
author = {Maw{-}Shang Chang and
Sheng{-}Lung Peng and
Jenn{-}Liang Liaw},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro and
Sue Whitesides},
title = {Deferred-Query - An Efficient Approach for Problems on interval and
Circular-Arc Graphs (Extended Abstract)},
booktitle = {Algorithms and Data Structures, Third Workshop, {WADS} '93, Montr{\'{e}}al,
Canada, August 11-13, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {709},
pages = {222--233},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57155-8\_250},
doi = {10.1007/3-540-57155-8\_250},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/ChangPL93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/ChenKK93,
author = {Jianer Chen and
Saroja P. Kanchi and
Arkady Kanevsky},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro and
Sue Whitesides},
title = {On the Complexity of Graph Embeddings (Extended Abstract)},
booktitle = {Algorithms and Data Structures, Third Workshop, {WADS} '93, Montr{\'{e}}al,
Canada, August 11-13, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {709},
pages = {234--245},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57155-8\_251},
doi = {10.1007/3-540-57155-8\_251},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/ChenKK93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/Clarkson93,
author = {Kenneth L. Clarkson},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro and
Sue Whitesides},
title = {Algorithms for Polytope Covering and Approximation},
booktitle = {Algorithms and Data Structures, Third Workshop, {WADS} '93, Montr{\'{e}}al,
Canada, August 11-13, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {709},
pages = {246--252},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57155-8\_252},
doi = {10.1007/3-540-57155-8\_252},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/Clarkson93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/CodenottiMMR93,
author = {Bruno Codenotti and
Giovanni Manzini and
Luciano Margara and
Giovanni Resta},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro and
Sue Whitesides},
title = {Global Strategies for Augmenting the Efficiency of {TSP} Heuristics},
booktitle = {Algorithms and Data Structures, Third Workshop, {WADS} '93, Montr{\'{e}}al,
Canada, August 11-13, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {709},
pages = {253--264},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57155-8\_253},
doi = {10.1007/3-540-57155-8\_253},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/CodenottiMMR93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/Cole93,
author = {Richard Cole},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro and
Sue Whitesides},
title = {Tolerating Faults in Meshes and Other Networks (Abstract)},
booktitle = {Algorithms and Data Structures, Third Workshop, {WADS} '93, Montr{\'{e}}al,
Canada, August 11-13, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {709},
pages = {26},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57155-8\_231},
doi = {10.1007/3-540-57155-8\_231},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/Cole93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/DattaLSS93,
author = {Amitava Datta and
Hans{-}Peter Lenhof and
Christian Schwarz and
Michiel H. M. Smid},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro and
Sue Whitesides},
title = {Static and Dynamic Algorithms for k-Point Clustering Problems},
booktitle = {Algorithms and Data Structures, Third Workshop, {WADS} '93, Montr{\'{e}}al,
Canada, August 11-13, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {709},
pages = {265--276},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57155-8\_254},
doi = {10.1007/3-540-57155-8\_254},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/DattaLSS93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/DevillersF93,
author = {Olivier Devillers and
Andreas Fabri},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro and
Sue Whitesides},
title = {Scalable Algorithms for Bichromatic Line Segment Intersection Problems
on Coarse Grained Multicomputers},
booktitle = {Algorithms and Data Structures, Third Workshop, {WADS} '93, Montr{\'{e}}al,
Canada, August 11-13, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {709},
pages = {277--288},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57155-8\_255},
doi = {10.1007/3-540-57155-8\_255},
timestamp = {Sat, 16 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/DevillersF93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/DietzR93,
author = {Paul F. Dietz and
Rajeev Raman},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro and
Sue Whitesides},
title = {Persistence, Randomization and Parallelization: On Some Combinatorial
Games and their Applications (Abstract)},
booktitle = {Algorithms and Data Structures, Third Workshop, {WADS} '93, Montr{\'{e}}al,
Canada, August 11-13, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {709},
pages = {289--301},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57155-8\_256},
doi = {10.1007/3-540-57155-8\_256},
timestamp = {Mon, 06 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wads/DietzR93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/DingW93,
author = {Yuzheng Ding and
Mark Allen Weiss},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro and
Sue Whitesides},
title = {The {K-D} Heap: An Efficient Multi-dimensional Priority Queue},
booktitle = {Algorithms and Data Structures, Third Workshop, {WADS} '93, Montr{\'{e}}al,
Canada, August 11-13, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {709},
pages = {302--313},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57155-8\_257},
doi = {10.1007/3-540-57155-8\_257},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/DingW93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/DobrindtMY93,
author = {Katrin Dobrindt and
Kurt Mehlhorn and
Mariette Yvinec},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro and
Sue Whitesides},
title = {A Complete and Efficient Algorithm for the Intersection of a General
and a Convex Polyhedron},
booktitle = {Algorithms and Data Structures, Third Workshop, {WADS} '93, Montr{\'{e}}al,
Canada, August 11-13, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {709},
pages = {314--324},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57155-8\_258},
doi = {10.1007/3-540-57155-8\_258},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/DobrindtMY93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/EfratSZ93,
author = {Alon Efrat and
Micha Sharir and
Alon Ziv},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro and
Sue Whitesides},
title = {Computing the Smallest k-Enclosing Circle and Related Problems},
booktitle = {Algorithms and Data Structures, Third Workshop, {WADS} '93, Montr{\'{e}}al,
Canada, August 11-13, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {709},
pages = {325--336},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57155-8\_259},
doi = {10.1007/3-540-57155-8\_259},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/EfratSZ93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/Giancarlo93,
author = {Raffaele Giancarlo},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro and
Sue Whitesides},
title = {An Index Data Structure For Matrices, with Applications to Fast Two-Dimensional
Pattern Matching},
booktitle = {Algorithms and Data Structures, Third Workshop, {WADS} '93, Montr{\'{e}}al,
Canada, August 11-13, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {709},
pages = {337--348},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57155-8\_260},
doi = {10.1007/3-540-57155-8\_260},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/Giancarlo93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/GrafH93,
author = {Thorsten Graf and
Klaus H. Hinrichs},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro and
Sue Whitesides},
title = {A Plane-Sweep Algorithm for the All-Nearest-Neighbors Problem for
a Set of Convex Planar Objects},
booktitle = {Algorithms and Data Structures, Third Workshop, {WADS} '93, Montr{\'{e}}al,
Canada, August 11-13, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {709},
pages = {349--360},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57155-8\_261},
doi = {10.1007/3-540-57155-8\_261},
timestamp = {Wed, 10 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/GrafH93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/GuptaJS93,
author = {Prosenjit Gupta and
Ravi Janardan and
Michiel H. M. Smid},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro and
Sue Whitesides},
title = {Further Results on Generalized Intersection Searching Problems: Counting,
Reporting, and Dynamization},
booktitle = {Algorithms and Data Structures, Third Workshop, {WADS} '93, Montr{\'{e}}al,
Canada, August 11-13, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {709},
pages = {361--372},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57155-8\_262},
doi = {10.1007/3-540-57155-8\_262},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/GuptaJS93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/Heffernan93,
author = {Paul J. Heffernan},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro and
Sue Whitesides},
title = {Generalized Approzimate Algorithms for Point Set Congruence},
booktitle = {Algorithms and Data Structures, Third Workshop, {WADS} '93, Montr{\'{e}}al,
Canada, August 11-13, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {709},
pages = {373--384},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57155-8\_263},
doi = {10.1007/3-540-57155-8\_263},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/Heffernan93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/JiangL93,
author = {Tao Jiang and
Ming Li},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro and
Sue Whitesides},
title = {Approximating Shortest Superstrings with Constraints (Extended Abstract)},
booktitle = {Algorithms and Data Structures, Third Workshop, {WADS} '93, Montr{\'{e}}al,
Canada, August 11-13, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {709},
pages = {385--396},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57155-8\_264},
doi = {10.1007/3-540-57155-8\_264},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/JiangL93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/KannanW93,
author = {Sampath Kannan and
Tandy J. Warnow},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro and
Sue Whitesides},
title = {Tree Reconstruction from Partial Orders},
booktitle = {Algorithms and Data Structures, Third Workshop, {WADS} '93, Montr{\'{e}}al,
Canada, August 11-13, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {709},
pages = {397--408},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57155-8\_265},
doi = {10.1007/3-540-57155-8\_265},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/KannanW93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/KaoTT93,
author = {Ming{-}Yang Kao and
Shang{-}Hua Teng and
Kentaro Toyama},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro and
Sue Whitesides},
title = {Improved Parallel Depth-First Search in Undirected Planar Graphs},
booktitle = {Algorithms and Data Structures, Third Workshop, {WADS} '93, Montr{\'{e}}al,
Canada, August 11-13, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {709},
pages = {409--420},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57155-8\_266},
doi = {10.1007/3-540-57155-8\_266},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/KaoTT93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/KargerMR93,
author = {David R. Karger and
Rajeev Motwani and
G. D. S. Ramkumar},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro and
Sue Whitesides},
title = {On Approximating the Longest Path in a Graph (Preliminary Version)},
booktitle = {Algorithms and Data Structures, Third Workshop, {WADS} '93, Montr{\'{e}}al,
Canada, August 11-13, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {709},
pages = {421--432},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57155-8\_267},
doi = {10.1007/3-540-57155-8\_267},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/KargerMR93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/Karp93,
author = {Richard M. Karp},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro and
Sue Whitesides},
title = {A Generalization of Binary Search},
booktitle = {Algorithms and Data Structures, Third Workshop, {WADS} '93, Montr{\'{e}}al,
Canada, August 11-13, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {709},
pages = {27--34},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57155-8\_232},
doi = {10.1007/3-540-57155-8\_232},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/Karp93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/KhullerRY93,
author = {Samir Khuller and
Balaji Raghavachari and
Neal E. Young},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro and
Sue Whitesides},
title = {Designing Multi-Commodity Flow Trees},
booktitle = {Algorithms and Data Structures, Third Workshop, {WADS} '93, Montr{\'{e}}al,
Canada, August 11-13, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {709},
pages = {433--441},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57155-8\_268},
doi = {10.1007/3-540-57155-8\_268},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wads/KhullerRY93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/KleinS93,
author = {Philip N. Klein and
Sairam Subramanian},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro and
Sue Whitesides},
title = {A Fully Dynamic Approximation Scheme for All-Pairs Shortest Paths
in Planar Graphs},
booktitle = {Algorithms and Data Structures, Third Workshop, {WADS} '93, Montr{\'{e}}al,
Canada, August 11-13, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {709},
pages = {442--451},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57155-8\_269},
doi = {10.1007/3-540-57155-8\_269},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/KleinS93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/Kreveld93,
author = {Marc J. van Kreveld},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro and
Sue Whitesides},
title = {On Fat Partitioning, Fat Covering and the Union Size of Polygons (Extended
Abstract)},
booktitle = {Algorithms and Data Structures, Third Workshop, {WADS} '93, Montr{\'{e}}al,
Canada, August 11-13, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {709},
pages = {452--463},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57155-8\_270},
doi = {10.1007/3-540-57155-8\_270},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/Kreveld93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/Krizanc93,
author = {Danny Krizanc},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro and
Sue Whitesides},
title = {A Time-Randomness Tradeoff for Selection in Parallel},
booktitle = {Algorithms and Data Structures, Third Workshop, {WADS} '93, Montr{\'{e}}al,
Canada, August 11-13, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {709},
pages = {464--470},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57155-8\_271},
doi = {10.1007/3-540-57155-8\_271},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/Krizanc93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/LuAKN93,
author = {Hsueh{-}I Lu and
Philip N. Klein and
Robert H. B. Netzer},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro and
Sue Whitesides},
title = {Detecting Race Conditions in Parallel Programs that Use One Semaphore},
booktitle = {Algorithms and Data Structures, Third Workshop, {WADS} '93, Montr{\'{e}}al,
Canada, August 11-13, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {709},
pages = {471--482},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57155-8\_272},
doi = {10.1007/3-540-57155-8\_272},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/LuAKN93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/MaggsR93,
author = {Bruce M. Maggs and
Monika Rauch},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro and
Sue Whitesides},
title = {An Algorithm for Finding Predecessors in Integer Sets},
booktitle = {Algorithms and Data Structures, Third Workshop, {WADS} '93, Montr{\'{e}}al,
Canada, August 11-13, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {709},
pages = {483--493},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57155-8\_273},
doi = {10.1007/3-540-57155-8\_273},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/MaggsR93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/MaierS93,
author = {Robert S. Maier and
Ren{\'{e}} Schott},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro and
Sue Whitesides},
title = {The Exhaustion of Shared Memory: Stochastic Results},
booktitle = {Algorithms and Data Structures, Third Workshop, {WADS} '93, Montr{\'{e}}al,
Canada, August 11-13, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {709},
pages = {494--505},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57155-8\_274},
doi = {10.1007/3-540-57155-8\_274},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wads/MaierS93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/Mirzaian93,
author = {Andy Mirzaian},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro and
Sue Whitesides},
title = {Minimum Weight Euclidean Matching and Weighted Relative Neighborhood
Graphs},
booktitle = {Algorithms and Data Structures, Third Workshop, {WADS} '93, Montr{\'{e}}al,
Canada, August 11-13, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {709},
pages = {506--517},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57155-8\_275},
doi = {10.1007/3-540-57155-8\_275},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/Mirzaian93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/MitraB93,
author = {Pinaki Mitra and
Binay K. Bhattacharya},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro and
Sue Whitesides},
title = {Efficient Approximate Shortest-Path Queries Among Isothetic Rectangular
Obstacles},
booktitle = {Algorithms and Data Structures, Third Workshop, {WADS} '93, Montr{\'{e}}al,
Canada, August 11-13, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {709},
pages = {518--529},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57155-8\_276},
doi = {10.1007/3-540-57155-8\_276},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/MitraB93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/PalazziS93,
author = {Larry F. Palazzi and
Jack Snoeyink},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro and
Sue Whitesides},
title = {Counting and Reporting Red/Blue Segment Intersections},
booktitle = {Algorithms and Data Structures, Third Workshop, {WADS} '93, Montr{\'{e}}al,
Canada, August 11-13, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {709},
pages = {530--540},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57155-8\_277},
doi = {10.1007/3-540-57155-8\_277},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/PalazziS93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/Pellegrini93,
author = {Marco Pellegrini},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro and
Sue Whitesides},
title = {Repetivive Hidden-Surface-Removal for Polyhedral Scenes},
booktitle = {Algorithms and Data Structures, Third Workshop, {WADS} '93, Montr{\'{e}}al,
Canada, August 11-13, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {709},
pages = {541--552},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57155-8\_278},
doi = {10.1007/3-540-57155-8\_278},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/Pellegrini93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/PriscoM93,
author = {Roberto De Prisco and
Angelo Monti},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro and
Sue Whitesides},
title = {On Reconfigurability of {VLSI} Linear Arrays},
booktitle = {Algorithms and Data Structures, Third Workshop, {WADS} '93, Montr{\'{e}}al,
Canada, August 11-13, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {709},
pages = {553--564},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57155-8\_279},
doi = {10.1007/3-540-57155-8\_279},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/PriscoM93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/SkienaS93,
author = {Steven Skiena and
Gopalakrishnan Sundaram},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro and
Sue Whitesides},
title = {Reconstructing Strings from Substrings (Extended Abstract)},
booktitle = {Algorithms and Data Structures, Third Workshop, {WADS} '93, Montr{\'{e}}al,
Canada, August 11-13, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {709},
pages = {565--576},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57155-8\_280},
doi = {10.1007/3-540-57155-8\_280},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/SkienaS93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/SouvaineY93,
author = {Diane L. Souvaine and
Chee{-}Keng Yap},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro and
Sue Whitesides},
title = {Combinatorial Complexity of Signed Discs (Extended Abstract)},
booktitle = {Algorithms and Data Structures, Third Workshop, {WADS} '93, Montr{\'{e}}al,
Canada, August 11-13, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {709},
pages = {577--588},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57155-8\_281},
doi = {10.1007/3-540-57155-8\_281},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/SouvaineY93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/StallmannH93,
author = {Matthias F. M. Stallmann and
Thomas A. Hughes},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro and
Sue Whitesides},
title = {Fast Algorithms for One-Dimensional Compaction with Jog Insertion},
booktitle = {Algorithms and Data Structures, Third Workshop, {WADS} '93, Montr{\'{e}}al,
Canada, August 11-13, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {709},
pages = {589--600},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57155-8\_282},
doi = {10.1007/3-540-57155-8\_282},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/StallmannH93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/Swanson93,
author = {Kurt Swanson},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro and
Sue Whitesides},
title = {An Optimal Algorithm for Roundness Determination on Convex Polygons},
booktitle = {Algorithms and Data Structures, Third Workshop, {WADS} '93, Montr{\'{e}}al,
Canada, August 11-13, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {709},
pages = {601--609},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57155-8\_283},
doi = {10.1007/3-540-57155-8\_283},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/Swanson93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/TelleP93,
author = {Jan Arne Telle and
Andrzej Proskurowski},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro and
Sue Whitesides},
title = {Practical Algorithms on Partial k-Trees with an Application to Domination-like
Problems},
booktitle = {Algorithms and Data Structures, Third Workshop, {WADS} '93, Montr{\'{e}}al,
Canada, August 11-13, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {709},
pages = {610--621},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57155-8\_284},
doi = {10.1007/3-540-57155-8\_284},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/TelleP93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/WestbrookY93,
author = {Jeffery R. Westbrook and
Dicky C. K. Yan},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro and
Sue Whitesides},
title = {Greedy Algorithms for the On-Line Steiner Tree and Generalized Steiner
Problems},
booktitle = {Algorithms and Data Structures, Third Workshop, {WADS} '93, Montr{\'{e}}al,
Canada, August 11-13, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {709},
pages = {622--633},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57155-8\_285},
doi = {10.1007/3-540-57155-8\_285},
timestamp = {Mon, 08 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/WestbrookY93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/Yao93,
author = {Andrew Chi{-}Chih Yao},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro and
Sue Whitesides},
title = {Groups and Algebraic Complexity (Abstract)},
booktitle = {Algorithms and Data Structures, Third Workshop, {WADS} '93, Montr{\'{e}}al,
Canada, August 11-13, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {709},
pages = {35},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57155-8\_233},
doi = {10.1007/3-540-57155-8\_233},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/Yao93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/wads/1993,
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro and
Sue Whitesides},
title = {Algorithms and Data Structures, Third Workshop, {WADS} '93, Montr{\'{e}}al,
Canada, August 11-13, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {709},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57155-8},
doi = {10.1007/3-540-57155-8},
isbn = {3-540-57155-8},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/1993.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
retrieved on 2024-05-07 12:45 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
