default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID2. WAE 1998: Saarbrücken, Germany
- Kurt Mehlhorn:
Algorithm Engineering, 2nd International Workshop, WAE '92, Saarbrücken, Germany, August 20-22, 1998, Proceedings. Max-Planck-Institut für Informatik 1998 - Karsten Weihe, Thomas Willhalm:
Why CAD Data Repair Requires Discrete Algorithmic Techniques. WAE 1998: 1-12 - Thomas Erlebach, Klaus Jansen:
Efficient Implementation of an Optimal Greedy Algorithm for Wavelength Assignment in Directed Tree Networks. WAE 1998: 13-24 - Stefan Nilsson, Matti Tikkanen:
Implementing a Dynamic Compressed Trie. WAE 1998: 25-36 - John R. Black, Charles U. Martel, Hongbin Qi:
Graph and Hashing Algorithms for Modern Architectures: Design and Performance. WAE 1998: 37-48 - Yossi Matias, Nasir M. Rajpoot, Süleyman Cenk Sahinalp:
Implementation and Experimental Evaluation of Flexible Parsing for Dynamic Dictionary Based Data Compression. WAE 1998: 49-61 - Jörg Schwerdt, Michiel H. M. Smid, Jayanth Majhi, Ravi Janardan:
Computing the Width of a Three-Dimensional Point Set: An Experimental Study. WAE 1998: 62-73 - Kostas P. Hatzis, George P. Pentaris, Paul G. Spirakis, Vasilis T. Tampakas:
Implementation and Testing Eavesdropper Protocols Using the DSP Tool. WAE 1998: 74-85 - Matthias Müller-Hannemann, Alexander Schwartz:
Implementing Weighted b-Matching Algorithms: Towards a Flexible Software Design. WAE 1998: 86-97 - Nadav Eiron, Michael Rodeh, Iris Steinwarts:
Matrix Multiplication: A Case Study of Algorithm Engineering. WAE 1998: 98-109 - Mark de Berg, Haggai David, Matthew J. Katz, Mark H. Overmars, A. Frank van der Stappen, Jules Vleugels:
Guarding Scenes against Invasive Hypercubes. WAE 1998: 110-120 - John D. Kececioglu, A. Justin Pecqueur:
Computing Maximum-Cardinality Matchings in Sparse General Graphs. WAE 1998: 121-132 - Matthias Fischer, Tamás Lukovszki, Martin Ziegler:
A Network Based Approach for Realtime Walkthrough of Massive Models. WAE 1998: 133-142 - Torben Hagerup, Peter Sanders, Jesper Larsson Träff:
An Implementation of the Binary Blocking Flow Algorithm. WAE 1998: 143-154 - Elena Marchiori, Adri G. Steenbeek:
An Iterated Heuristic Algorithm for the Set Covering Problem. WAE 1998: 155-166 - Riko Jacob, Madhav V. Marathe, Kai Nagel:
A Computational Study of Routing Algorithms for Realistic Transportation Networks. WAE 1998: 167-178 - Daniel H. Huson, Scott Nettles, Kenneth Rice, Tandy J. Warnow, Shibu Yooseph:
Hybrid Tree Reconstruction Methods. WAE 1998: 179-192 - Naila Rahman, Rajeev Raman:
An Experimental Study of Word-level Parallelism in Some Sorting Algorithms. WAE 1998: 193-203 - Steven Skiena:
Who is Interested in Algorithms and why? Lessons from the Stony Brook Algorithms Repository. WAE 1998: 204-212
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.
last updated on 2024-11-22 19:31 CET 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:
