Peter Sanders

Sabine Storandt

Carina Truschel

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

A Sweep-Plane Algorithm for Calculating the Isolation of Mountains.

[BibT_eX]

[DOI]

Daniel Funke

Nicolai Hüning

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

Learned Monotone Minimal Perfect Hashing.

[BibT_eX]

[DOI]

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

High Performance Construction of RecSplit Based Minimal Perfect Hash Functions.

[BibT_eX]

[DOI]

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

SicHash - Small Irregular Cuckoo Tables for Perfect Hashing.

[BibT_eX]

[DOI]

Hans-Peter Lehmann

Stefan Walzer

Proceedings of the Symposium on Algorithm Engineering and Experiments, 2023

PaCHash: Packed and Compressed Hash Tables.

[BibT_eX]

[DOI]

Florian Kurpicz

Hans-Peter Lehmann

Proceedings of the Symposium on Algorithm Engineering and Experiments, 2023

2022

High-Quality Hypergraph Partitioning.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, December, 2022

Mallob: Scalable SAT Solving On Demand With Decentralized Job Scheduling.

[BibT_eX]

[DOI]

Dataset, July, 2022

Engineering In-place (Shared-memory) Sorting Algorithms.

[BibT_eX]

[DOI]

ACM Trans. Parallel Comput., 2022

Parallel Weighted Random Sampling.

[BibT_eX]

[DOI]

ACM Trans. Math. Softw., 2022

Vectorized and performance-portable quicksort.

[BibT_eX]

[DOI]

Softw. Pract. Exp., 2022

Mallob: Scalable SAT Solving On Demand With Decentralized Job Scheduling.

[BibT_eX]

[DOI]

J. Open Source Softw., 2022

Parallel Flow-Based Hypergraph Partitioning.

[BibT_eX]

[DOI]

Lars Gottesbüren

Tobias Heuer

Proceedings of the 20th International Symposium on Experimental Algorithms, 2022

Fast Succinct Retrieval and Approximate Membership Using Ribbon.

[BibT_eX]

[DOI]

Peter C. Dillinger

Stefan Walzer

Proceedings of the 20th International Symposium on Experimental Algorithms, 2022

Communication-efficient Massively Distributed Connected Components.

[BibT_eX]

[DOI]

Proceedings of the 2022 IEEE International Parallel and Distributed Processing Symposium, 2022

ReStore: In-Memory REplicated STORagE for Rapid Recovery in Fault-Tolerant Algorithms.

[BibT_eX]

[DOI]

Lukas Hübner

Demian Hespe

Alexandros Stamatakis

Proceedings of the 12th IEEE/ACM Workshop on Fault Tolerance for HPC at eXtreme Scale, 2022

Decentralized Online Scheduling of Malleable NP-hard Jobs.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2022: Parallel Processing, 2022

Shared-Memory n-level Hypergraph Partitioning.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Algorithm Engineering and Experiments, 2022

Scalable Text Index Construction.

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Big Data - DFG Priority Program 1736, 2022

Recent Advances in Scalable Network Generation1.

[BibT_eX]

[DOI]

Proceedings of the Massive Graph Analytics, 2022

Multi-Objective Shortest Paths.

[BibT_eX]

[DOI]

Proceedings of the Massive Graph Analytics, 2022

2021

Exploring parallel MPI fault tolerance mechanisms for phylogenetic inference with RAxML-NG.

[BibT_eX]

[DOI]

Alexandros Stamatakis

Bioinform., November, 2021

Engineering faster sorters for small sets of items.

[BibT_eX]

[DOI]

Jasper Marianczuk

Softw. Pract. Exp., 2021

Weighted Random Sampling on GPUs.

[BibT_eX]

[DOI]

Hans-Peter Lehmann

CoRR, 2021

Scalable SAT Solving in the Cloud.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2021, 2021

Engineering MultiQueues: Fast Relaxed Concurrent Priority Queues.

[BibT_eX]

[DOI]

Marvin Williams

Proceedings of the 29th Annual European Symposium on Algorithms, 2021

Deep Multilevel Graph Partitioning.

[BibT_eX]

[DOI]

Proceedings of the 29th Annual European Symposium on Algorithms, 2021

Scalable Shared-Memory Hypergraph Partitioning.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Algorithm Engineering and Experiments, 2021

Fast, Exact and Scalable Dynamic Ridesharing.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Algorithm Engineering and Experiments, 2021

2020

High-Quality Shared-Memory Graph Partitioning.

[BibT_eX]

[DOI]

Yaroslav Akhremtsev

IEEE Trans. Parallel Distributed Syst., 2020

Linear work generation of R-MAT graphs.

[BibT_eX]

[DOI]

Netw. Sci., 2020

Recent Advances in Scalable Network Generation.

[BibT_eX]

[DOI]

CoRR, 2020

Concurrent Expandable AMQs on the Basis of Quotient Filters.

[BibT_eX]

[DOI]

Robert Williger

Proceedings of the 18th International Symposium on Experimental Algorithms, 2020

Communication-Efficient Weighted Reservoir Sampling from Fully Distributed Data Streams.

[BibT_eX]

[DOI]

Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020

Communication-Efficient String Sorting.

[BibT_eX]

[DOI]

Matthias Schimek

Proceedings of the 2020 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2020

Connecting MapReduce Computations to Realistic Machine Models.

[BibT_eX]

[DOI]

Proceedings of the 2020 IEEE International Conference on Big Data (IEEE BigData 2020), 2020

2019

Concurrent Hash Tables: Fast and General(?)!

[BibT_eX]

[DOI]

ACM Trans. Parallel Comput., 2019

Communication-free massively distributed graph generation.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2019

Network Flow-Based Refinement for Multilevel Hypergraph Partitioning.

[BibT_eX]

[DOI]

Tobias Heuer

Sebastian Schlag

ACM J. Exp. Algorithmics, 2019

Real-time Traffic Assignment Using Engineered Customizable Contraction Hierarchies.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2019

Novel Parallel Algorithms for Fast Multi-GPU-Based Generation of Massive Scale-Free Networks.

[BibT_eX]

[DOI]

Md. Maksudul Alam

Kalyan S. Perumalla

Data Sci. Eng., 2019

Communication-Efficient (Weighted) Reservoir Sampling.

[BibT_eX]

[DOI]

CoRR, 2019

Dynamic Space Efficient Hashing.

[BibT_eX]

[DOI]

Stefan Walzer

Algorithmica, 2019

Efficient Calculation of Microscopic Travel Demand Data with Low Calibration Effort.

[BibT_eX]

[DOI]

Proceedings of the 27th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2019

Load-Balancing for Parallel Delaunay Triangulations.

[BibT_eX]

[DOI]

Daniel Funke

Vincent Winkler

Proceedings of the Euro-Par 2019: Parallel Processing, 2019

More Hierarchy in Route Planning Using Edge Hierarchies.

[BibT_eX]

[DOI]

Demian Hespe

Proceedings of the 19th Symposium on Algorithmic Approaches for Transportation Modelling, 2019

Sequential and Parallel Algorithms and Data Structures - The Basic Toolbox

[BibT_eX]

[DOI]

Martin Dietzfelbinger

Springer, ISBN: 978-3-030-25208-3, 2019

2018

Benchmarking for Graph Clustering and Partitioning.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Social Network Analysis and Mining, 2nd Edition, 2018

Efficient Parallel Random Sampling - Vectorized, Cache-Efficient, and Online.

[BibT_eX]

[DOI]

Emanuel Schrade

Carsten Dachsbacher

ACM Trans. Math. Softw., 2018

Hashing with Linear Probing and Referential Integrity.

[BibT_eX]

[DOI]

CoRR, 2018

Proving Equivalence Between Imperative and MapReduce Implementations Using Program Transformations.

[BibT_eX]

[DOI]

Proceedings of the Proceedings Third Workshop on Models for Formal Analysis of Real Systems and Sixth International Workshop on Verification and Program Transformation, 2018

Real-Time Traffic Assignment Using Fast Queries in Customizable Contraction Hierarchies.

[BibT_eX]

[DOI]

Proceedings of the 17th International Symposium on Experimental Algorithms, 2018

Relational Equivalence Proofs Between Imperative and MapReduce Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Verified Software. Theories, Tools, and Experiments, 2018

Communication Efficient Checking of Big Data Operations.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE International Parallel and Distributed Processing Symposium, 2018

Communication-Free Massively Distributed Graph Generation.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE International Parallel and Distributed Processing Symposium, 2018

Lightweight MPI Communicators with Applications to Perfectly Balanced Quicksort.

[BibT_eX]

[DOI]

Michael Axtmann

Armin Wiebigke

Proceedings of the 2018 IEEE International Parallel and Distributed Processing Symposium, 2018

An equal opportunity concept for the coordinated research effort AESC.

[BibT_eX]

[DOI]

Anne Koziolek

Proceedings of the 12th European Conference on Software Architecture: Companion Proceedings, 2018

Optimizing energy consumption and user experience in a mobile video streaming scenario.

[BibT_eX]

[DOI]

Thomas Breitbach

Proceedings of the 15th IEEE Annual Consumer Communications & Networking Conference, 2018

2017

Parallel Graph Partitioning for Complex Networks.

[BibT_eX]

[DOI]

Henning Meyerhenke

IEEE Trans. Parallel Distributed Syst., 2017

Finding near-optimal independent sets at scale.

[BibT_eX]

[DOI]

J. Heuristics, 2017

Lightweight MPI Communicators with Applications to Perfectly Balanced Schizophrenic Quicksort.

[BibT_eX]

[DOI]

Michael Axtmann

Armin Wiebigke

CoRR, 2017

Fast OLAP Query Execution in Main Memory on Large Data in a Cluster.

[BibT_eX]

[DOI]

CoRR, 2017

Engineering DFS-Based Graph Algorithms.

[BibT_eX]

[DOI]

Stefan Näher

CoRR, 2017

3D Cell Nuclei Segmentation with Balanced Graph Partitioning.

[BibT_eX]

[DOI]

CoRR, 2017

Distributed Evolutionary k-way Node Separators.

[BibT_eX]

[DOI]

CoRR, 2017

Engineering Parallel String Sorting.

[BibT_eX]

[DOI]

Andreas Eberle

Algorithmica, 2017

Distributed evolutionary k-way node separators.

[BibT_eX]

[DOI]

Proceedings of the Genetic and Evolutionary Computation Conference, 2017

Dynamic Space Efficient Hashing.

[BibT_eX]

[DOI]

Proceedings of the 25th Annual European Symposium on Algorithms, 2017

In-Place Parallel Super Scalar Samplesort (IPSSSSo).

[BibT_eX]

[DOI]

Proceedings of the 25th Annual European Symposium on Algorithms, 2017

Parallel d-D Delaunay Triangulations in Shared and Distributed Memory.

[BibT_eX]

[DOI]

Daniel Funke

Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments, 2017

Robust Massively Parallel Sorting.

[BibT_eX]

[DOI]

Michael Axtmann

Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments, 2017

Engineering a direct k-way Hypergraph Partitioning Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments, 2017

Engineering a Distributed Full-Text Index.

[BibT_eX]

[DOI]

Johannes Fischer

Florian Kurpicz

Matthias Müller-Hannemann

Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments, 2017

2016

Recent Advances in Graph Partitioning.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Engineering - Selected Results and Surveys, 2016

Route Planning in Transportation Networks.

[BibT_eX]

[DOI]

Hannah Bast

Daniel Delling

Andrew V. Goldberg

Proceedings of the Algorithm Engineering - Selected Results and Surveys, 2016

Introduction to the Special Issue on SPAA 2014.

[BibT_eX]

[DOI]

Friedhelm Meyer auf der Heide

Nodari Sitchinava

ACM Trans. Parallel Comput., 2016

Introduction to Special Issue ALENEX 2013.

[BibT_eX]

[DOI]

Norbert Zeh

ACM J. Exp. Algorithmics, 2016

Scalable generation of scale-free graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2016

Partitioning (hierarchically clustered) complex networks via size-constrained graph clustering.

[BibT_eX]

[DOI]

Henning Meyerhenke

J. Heuristics, 2016

Efficient Random Sampling - Parallel, Vectorized, Cache-Efficient, and Online.

[BibT_eX]

[DOI]

Emanuel Schrade

Carsten Dachsbacher

CoRR, 2016

Advanced Multilevel Node Separator Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms - 15th International Symposium, 2016

Accelerating Local Search for the Maximum Independent Set Problem.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms - 15th International Symposium, 2016

Concurrent hash tables: fast and general?(!).

[BibT_eX]

[DOI]

Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2016

Generating semi-synthetic validation benchmarks for embryomics.

[BibT_eX]

[DOI]

Proceedings of the 13th IEEE International Symposium on Biomedical Imaging, 2016

Communication Efficient Algorithms for Top-k Selection Problems.

[BibT_eX]

[DOI]

Proceedings of the 2016 IEEE International Parallel and Distributed Processing Symposium, 2016

Fast Parallel Operations on Search Trees.

[BibT_eX]

[DOI]

Yaroslav Akhremtsev

Proceedings of the 23rd IEEE International Conference on High Performance Computing, 2016

Thrill: High-performance algorithmic distributed batch data processing with C++.

[BibT_eX]

[DOI]

Proceedings of the 2016 IEEE International Conference on Big Data (IEEE BigData 2016), 2016

k-way Hypergraph Partitioning via n-Level Recursive Bisection.

[BibT_eX]

[DOI]

Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments, 2016

2015

Work-Efficient Matrix Inversion in Polylogarithmic Time.

[BibT_eX]

[DOI]

Raoul Steffen

ACM Trans. Parallel Comput., 2015

k-way Hypergraph Partitioning via n-Level Recursive Bisection.

[BibT_eX]

[DOI]

CoRR, 2015

Communication Efficient Algorithms for Top-k Selection Problems.

[BibT_eX]

[DOI]

Matthias Müller-Hannemann

Ingo Müller

CoRR, 2015

n-Level Hypergraph Partitioning.

[BibT_eX]

[DOI]

CoRR, 2015

Route Planning in Transportation Networks.

[BibT_eX]

[DOI]

Hannah Bast

Daniel Delling

Andrew V. Goldberg

CoRR, 2015

Graph Partitioning for Independent Sets.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms - 14th International Symposium, 2015

A Bulk-Parallel Priority Queue in External Memory with STXXL.

[BibT_eX]

[DOI]

Thomas Keh

Proceedings of the Experimental Algorithms - 14th International Symposium, 2015

Parallel Algorithms Reconsidered (Invited Talk).

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

Faster Exact Search Using Document Clustering.

[BibT_eX]

[DOI]

Jonathan Dimond

Proceedings of the String Processing and Information Retrieval, 2015

Brief Announcement: MultiQueues: Simple Relaxed Concurrent Priority Queues.

[BibT_eX]

[DOI]

Hamza Rihani

Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015

Practical Massively Parallel Sorting.

[BibT_eX]

[DOI]

Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015

Cache-Efficient Aggregation: Hashing Is Sorting.

[BibT_eX]

[DOI]

Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, Melbourne, Victoria, Australia, May 31, 2015

HordeSat: A Massively Parallel Portfolio SAT Solver.

[BibT_eX]

[DOI]

Tomás Balyo

Carsten Sinz

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2015, 2015

Locality Aware DAG-Scheduling for LU-Decomposition.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE International Parallel and Distributed Processing Symposium, 2015

Report from Dagstuhl: SocioPaths - Multimodal Door-to-Door Route Planning via Social Paths.

[BibT_eX]

[DOI]

Proceedings of the 2nd International Workshop on Mining Urban Data co-located with 32nd International Conference on Machine Learning (ICML 2015), 2015

Incorporating road networks into territory design.

[BibT_eX]

[DOI]

Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2015

Operating Power Grids with Few Flow Control Buses.

[BibT_eX]

[DOI]

Proceedings of the 2015 ACM Sixth International Conference on Future Energy Systems, 2015

(Semi-)External Algorithms for Graph Partitioning and Clustering.

[BibT_eX]

[DOI]

Yaroslav Akhremtsev

Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments, 2015

2014

Benchmarking for Graph Clustering and Partitioning.

[BibT_eX]

[DOI]

Encyclopedia of Social Network Analysis and Mining, 2014

Engineering Parallel Algorithms: The multicore transformation (Ubiquity symposium).

[BibT_eX]

[DOI]

Ubiquity, 2014

Advanced Coarsening Schemes for Graph Partitioning.

[BibT_eX]

[DOI]

Ilya Safro

ACM J. Exp. Algorithmics, 2014

MultiQueues: Simpler, Faster, and Better Relaxed Concurrent Priority Queues.

[BibT_eX]

[DOI]

Hamza Rihani

CoRR, 2014

Practical Massively Parallel Sorting - Basic Algorithmic Ideas.

[BibT_eX]

[DOI]

CoRR, 2014

Partitioning Complex Networks via Size-Constrained Clustering.

[BibT_eX]

[DOI]

Henning Meyerhenke

Proceedings of the Experimental Algorithms - 13th International Symposium, 2014

Parallel Bi-objective Shortest Paths Using Weight-Balanced B-trees with Bulk Updates.

[BibT_eX]

[DOI]

Stephan Erb

Moritz Kobitzsch

Proceedings of the Experimental Algorithms - 13th International Symposium, 2014

Retrieval and Perfect Hashing Using Fingerprinting.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms - 13th International Symposium, 2014

Algorithm Engineering for Big Data.

[BibT_eX]

[DOI]

Proceedings of the 44. Jahrestagung der Gesellschaft für Informatik, Big Data, 2014

PReaCH: A Fast Lightweight Reachability Index Using Pruning and Contraction Hierarchies.

[BibT_eX]

[DOI]

Florian Merz

Proceedings of the Algorithms - ESA 2014, 2014

Algorithmen und Datenstrukturen - die Grundwerkzeuge.

[BibT_eX]

[DOI]

Martin Dietzfelbinger

eXamen.press, Springer, ISBN: 978-3-642-05471-6, 2014

2013

Real-time integrated prefetching and caching.

[BibT_eX]

[DOI]

Rob van Stee

J. Sched., 2013

Minimum time-dependent travel times with contraction hierarchies.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2013

Algorithm Engineering.

[BibT_eX]

[DOI]

Inform. Spektrum, 2013

Algorithmenbibliotheken.

[BibT_eX]

[DOI]

Inform. Spektrum, 2013

KaHIP v0.53 - Karlsruhe High Quality Partitioning - User Guide.

[BibT_eX]

[DOI]

CoRR, 2013

Recent Advances in Graph Partitioning.

[BibT_eX]

[DOI]

CoRR, 2013

Think Locally, Act Globally: Highly Balanced Graph Partitioning.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms, 12th International Symposium, 2013

Transit Node Routing Reconsidered.

[BibT_eX]

[DOI]

Julian Arz

Dennis Luxen

Proceedings of the Experimental Algorithms, 12th International Symposium, 2013

On (Dynamic) Range Minimum Queries in External Memory.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

Engineering Algorithms for Large Data Sets.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2013: Theory and Practice of Computer Science, 2013

Parallel Label-Setting Multi-objective Shortest Path Search.

[BibT_eX]

[DOI]

Lawrence Mandow

Proceedings of the 27th IEEE International Symposium on Parallel and Distributed Processing, 2013

Malleable Sorting.

[BibT_eX]

[DOI]

Patrick Flick

Proceedings of the 27th IEEE International Symposium on Parallel and Distributed Processing, 2013

Efficient many-core query execution in main memory column-stores.

[BibT_eX]

[DOI]

Jonathan Dees

Proceedings of the 29th IEEE International Conference on Data Engineering, 2013

Efficient Parallel and External Matching.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2013 Parallel Processing, 2013

Parallel String Sample Sort.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2013, 2013

Fast OLAP query execution in main memory on large data in a cluster.

[BibT_eX]

[DOI]

Martin Weidner

Jonathan Dees

Proceedings of the 2013 IEEE International Conference on Big Data (IEEE BigData 2013), 2013

Communication efficient algorithms for fundamental big data problems.

[BibT_eX]

[DOI]

Sebastian Schlag

Ingo Müller

Proceedings of the 2013 IEEE International Conference on Big Data (IEEE BigData 2013), 2013

2012

Exact Routing in Large Road Networks Using Contraction Hierarchies.

[BibT_eX]

[DOI]

Transp. Sci., 2012

Engineering highway hierarchies.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2012

Route planning with flexible edge restrictions.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2012

Think Locally, Act Globally: Perfectly Balanced Graph Partitioning

[BibT_eX]

[DOI]

CoRR, 2012

Engineering Graph Partitioning Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms - 11th International Symposium, 2012

Efficient Route Compression for Hybrid Route Planning.

[BibT_eX]

[DOI]

Proceedings of the Design and Analysis of Algorithms, 2012

Energy Efficient Frequency Scaling and Scheduling for Malleable Tasks.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2012 Parallel Processing - 18th International Conference, 2012

Optimized Hybrid Parallel Lattice Boltzmann Fluid Flow Simulations on Complex Geometries.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2012 Parallel Processing - 18th International Conference, 2012

Time-Dependent Route Planning with Generalized Objective Functions.

[BibT_eX]

[DOI]

Gernot Veit Batz

Proceedings of the Algorithms - ESA 2012, 2012

High quality graph partitioning.

[BibT_eX]

[DOI]

Proceedings of the Graph Partitioning and Graph Clustering, 2012

Distributed Evolutionary Graph Partitioning.

[BibT_eX]

[DOI]

Proceedings of the 14th Meeting on Algorithm Engineering & Experiments, 2012

2011

Algorithm Engineering.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Parallel Computing, 2011

Towards optimal range medians.

[BibT_eX]

[DOI]

Gerth Stølting Brodal

Beat Gfeller

Allan Grønlund Jørgensen

Theor. Comput. Sci., 2011

Energy-efficient sorting using solid state disks.

[BibT_eX]

[DOI]

Sustain. Comput. Informatics Syst., 2011

Stronger Quickheaps.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2011

Efficient Error-Correcting Geocoding

[BibT_eX]

[DOI]

CoRR, 2011

Energy-Efficient Paths in Radio Networks.

[BibT_eX]

[DOI]

Algorithmica, 2011

Displaying Cell Broadcast messages.

[BibT_eX]

[DOI]

Proceedings of the 14th International Symposium on Wireless Personal Multimedia Communications, 2011

Hierarchy Decomposition for Faster User Equilibria on Road Networks.

[BibT_eX]

[DOI]

Dennis Luxen

Proceedings of the Experimental Algorithms - 10th International Symposium, 2011

Alternative Route Graphs in Road Networks.

[BibT_eX]

[DOI]

Proceedings of the Theory and Practice of Algorithms in (Computer) Systems, 2011

The PEPPHER Approach to Programmability and Performance Portability for Heterogeneous many-core Architectures.

[BibT_eX]

[DOI]

Proceedings of the Applications, Tools and Techniques on the Road to Exascale Computing, Proceedings of the conference ParCo 2011, 31 August, 2011

Efficient Parallel Scheduling of Malleable Tasks.

[BibT_eX]

[DOI]

Proceedings of the 25th IEEE International Symposium on Parallel and Distributed Processing, 2011

Algorithm Engineering for Scalable Parallel External Sorting.

[BibT_eX]

[DOI]

Proceedings of the 25th IEEE International Symposium on Parallel and Distributed Processing, 2011

Engineering efficient error-correcting geocoding.

[BibT_eX]

[DOI]

Proceedings of the 19th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, 2011

Engineering a Multi-core Radix Sort.

[BibT_eX]

[DOI]

Jan Wassenberg

Proceedings of the Euro-Par 2011 Parallel Processing - 17th International Conference, 2011

Engineering Multilevel Graph Partitioning Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2011, 2011

Shortest Paths.

[BibT_eX]

[DOI]

Proceedings of the Algorithms Unplugged, 2011

2010

Engineering basic algorithms of an in-memory text search engine.

[BibT_eX]

[DOI]

ACM Trans. Inf. Syst., 2010

Heuristic initialization for bipartite matching problems.

[BibT_eX]

[DOI]

Johannes Langguth

Fredrik Manne

ACM J. Exp. Algorithmics, 2010

Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm.

[BibT_eX]

[DOI]

Reinhard Bauer

Daniel Delling

Dennis Schieferdecker

ACM J. Exp. Algorithmics, 2010

Algorithm Engineering.

[BibT_eX]

[DOI]

Inform. Spektrum, 2010

Compressed Transmission of Route Descriptions

[BibT_eX]

[DOI]

CoRR, 2010

Faster Radix Sort via Virtual Memory and Write-Combining

[BibT_eX]

[DOI]

Jan Wassenberg

CoRR, 2010

n-Level Graph Partitioning

[BibT_eX]

[DOI]

CoRR, 2010

Defining and Computing Alternative Routes in Road Networks

[BibT_eX]

[DOI]

CoRR, 2010

Distributed Time-Dependent Contraction Hierarchies.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms, 9th International Symposium, 2010

Time-Dependent Contraction Hierarchies and Approximation.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms, 9th International Symposium, 2010

Improved Fast Similarity Search in Dictionaries.

[BibT_eX]

[DOI]

Daniel Karch

Dennis Luxen

Proceedings of the String Processing and Information Retrieval, 2010

GPU sample sort.

[BibT_eX]

[DOI]

Nikolaj Leischner

Proceedings of the 24th IEEE International Symposium on Parallel and Distributed Processing, 2010

Engineering a scalable high quality graph partitioner.

[BibT_eX]

[DOI]

Manuel Holtgrewe

Proceedings of the 24th IEEE International Symposium on Parallel and Distributed Processing, 2010

Scalable distributed-memory external sorting.

[BibT_eX]

[DOI]

Mirko Rahn

Proceedings of the 26th International Conference on Data Engineering, 2010

n-Level Graph Partitioning.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2010

10261 Executive Summary - Algorithm Engineering.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Engineering, 27.06. - 02.07.2010, 2010

10261 Abstracts Collection - Algorithm Engineering.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Engineering, 27.06. - 02.07.2010, 2010

Engineering Time-Dependent Many-to-Many Shortest Paths Computation.

[BibT_eX]

[DOI]

Robert Geisberger

Proceedings of the ATMOS 2010, 2010

Fast Detour Computation for Ride Sharing.

[BibT_eX]

[DOI]

Proceedings of the ATMOS 2010, 2010

Lifetime Maximization of Monitoring Sensor Networks.

[BibT_eX]

[DOI]

Dennis Schieferdecker

Proceedings of the Algorithms for Sensor Systems, 2010

Algorithm Engineering - An Attempt at a Definition Using Sorting as an Example.

[BibT_eX]

[DOI]

Proceedings of the Twelfth Workshop on Algorithm Engineering and Experiments, 2010

Route Planning with Flexible Objective Functions.

[BibT_eX]

[DOI]

Robert Geisberger

Moritz Kobitzsch

Proceedings of the Twelfth Workshop on Algorithm Engineering and Experiments, 2010

Simple and Fast Nearest Neighbor Search.

[BibT_eX]

[DOI]

Proceedings of the Twelfth Workshop on Algorithm Engineering and Experiments, 2010

2009

Two-tree algorithms for full bandwidth broadcast, reduction and scan.

[BibT_eX]

[DOI]

Parallel Comput., 2009

Online Scheduling with Bounded Migration.

[BibT_eX]

[DOI]

Naveen Sivadasan

Martin Skutella

Math. Oper. Res., 2009

Cache-, hash-, and space-efficient bloom filters.

[BibT_eX]

[DOI]

Felix Putze

ACM J. Exp. Algorithmics, 2009

Goal-directed shortest-path queries using precomputed cluster distances.

[BibT_eX]

[DOI]

Jens Maue

Domagoj Matijevic

ACM J. Exp. Algorithmics, 2009

Towards Optimal Range Medians.

[BibT_eX]

[DOI]

Beat Gfeller

Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009

Engineering Route Planning Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Algorithmics of Large and Complex Networks - Design, 2009

09491 Abstracts Collection - Graph Search Engineering.

[BibT_eX]

[DOI]

Proceedings of the Graph Search Engineering, 29.11. - 04.12.2009, 2009

An Efficient Parallel Algorithm for Graph-Based Image Segmentation.

[BibT_eX]

[DOI]

Jan Wassenberg

Wolfgang Middelmann

Proceedings of the Computer Analysis of Images and Patterns, 13th International Conference, 2009

Algorithm Engineering - An Attempt at a Definition.

[BibT_eX]

[DOI]

Proceedings of the Efficient Algorithms, 2009

The Filter-Kruskal Minimum Spanning Tree Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments, 2009

Time-Dependent Contraction Hierarchies.

[BibT_eX]

[DOI]

Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments, 2009

2008

Kürzeste Wege.

[BibT_eX]

[DOI]

Proceedings of the Taschenbuch der Algorithmen, 2008

An asymptotic approximation scheme for multigraph edge coloring.

[BibT_eX]

[DOI]

David Steurer

ACM Trans. Algorithms, 2008

STXXL: standard template library for XXL data sets.

[BibT_eX]

[DOI]

Lutz Kettner

Softw. Pract. Exp., 2008

Single-Pass List Partitioning.

[BibT_eX]

[DOI]

Leonor Frias

Scalable Comput. Pract. Exp., 2008

Better external memory suffix array construction.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2008

Time Dependent Contraction Hierarchies -- Basic Algorithmic Ideas

[BibT_eX]

[DOI]

CoRR, 2008

Constant Time Queries for Energy Efficient Paths in Multi-hop Wireless Networks.

[BibT_eX]

[DOI]

Stefan Funke

Domagoj Matijevic

J. Comput. Inf. Technol., 2008

Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms, 7th International Workshop, 2008

Out of the Box Phrase Indexing.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2008

Mobile Route Planning.

[BibT_eX]

[DOI]

Christian Vetter

Proceedings of the Algorithms, 2008

Semi-external LTL Model Checking.

[BibT_eX]

[DOI]

Stefan Edelkamp

Pavel Simecek

Proceedings of the Computer Aided Verification, 20th International Conference, 2008

Compressed Inverted Indexes for In-Memory Search Engines.

[BibT_eX]

[DOI]

Proceedings of the Tenth Workshop on Algorithm Engineering and Experiments, 2008

Better Approximation of Betweenness Centrality.

[BibT_eX]

[DOI]

Robert Geisberger

Proceedings of the Tenth Workshop on Algorithm Engineering and Experiments, 2008

Algorithms and Data Structures: The Basic Toolbox.

[BibT_eX]

[DOI]

Springer, ISBN: 978-3-540-77977-3, 2008

2007

Scalable parallel suffix array construction.

[BibT_eX]

[DOI]

Fabian Kulla

Parallel Comput., 2007

Dynamic Highway-Node Routing.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms, 6th International Workshop, 2007

Engineering Fast Route Planning Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms, 6th International Workshop, 2007

Engineering Algorithms for Approximate Weighted Matching.

[BibT_eX]

[DOI]

Jens Maue

Proceedings of the Experimental Algorithms, 6th International Workshop, 2007

The random graph threshold for k-orientiability and a fast algorithm for optimal multiple-choice allocation.

[BibT_eX]

[DOI]

Julie Anne Cain

Nicholas C. Wormald

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Full Bandwidth Broadcast, Reduction and Scan with Only Two Trees.

[BibT_eX]

[DOI]

Proceedings of the Recent Advances in Parallel Virtual Machine and Message Passing Interface, 14th European PVM/MPI User's Group Meeting, Paris, France, September 30, 2007

MCSTL: The Multi-core Standard Template Library.

[BibT_eX]

[DOI]

Felix Putze

Proceedings of the Euro-Par 2007, 2007

Intersection in Integer Inverted Indices.

[BibT_eX]

[DOI]

Proceedings of the Nine Workshop on Algorithm Engineering and Experiments, 2007

Computing Many-to-Many Shortest Paths Using Highway Hierarchies.

[BibT_eX]

[DOI]

Proceedings of the Nine Workshop on Algorithm Engineering and Experiments, 2007

In Transit to Constant Time Shortest-Path Queries in Road Networks.

[BibT_eX]

[DOI]

Proceedings of the Nine Workshop on Algorithm Engineering and Experiments, 2007

2006

Foreword.

[BibT_eX]

[DOI]

Aravind Srinivasan

Theory Comput. Syst., 2006

Linear work suffix array construction.

[BibT_eX]

[DOI]

Juha Kärkkäinen

Stefan Burkhardt

J. ACM, 2006

Parallel Prefix (Scan) Algorithms for MPI.

[BibT_eX]

[DOI]

Proceedings of the Recent Advances in Parallel Virtual Machine and Message Passing Interface, 2006

How Branch Mispredictions Affect Quicksort.

[BibT_eX]

[DOI]

Kanela Kaligosi

Proceedings of the Algorithms, 2006

Robust, Almost Constant Time Shortest-Path Queries in Road Networks.

[BibT_eX]

[DOI]

Proceedings of the Shortest Path Problem, 2006

Highway Hierarchies Star.

[BibT_eX]

[DOI]

Proceedings of the Shortest Path Problem, 2006

2005

Polynomial time algorithms for multicast network code construction.

[BibT_eX]

[DOI]

Ludo M. G. M. Tolhuizen

IEEE Trans. Inf. Theory, 2005

Duality Between Prefetching and Queued Writing with Parallel Disks.

[BibT_eX]

[DOI]

David A. Hutchinson

Jeffrey Scott Vitter

SIAM J. Comput., 2005

Space Efficient Hash Tables with Worst Case Constant Access Time.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2005

Towards Optimal Multiple Selection.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Highway Hierarchies Hasten Exact Shortest Path Queries.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2005

: Standard Template Library for XXL Data Sets.

[BibT_eX]

[DOI]

Lutz Kettner

Proceedings of the Algorithms, 2005

2004

A simpler linear time 2/3-epsilon approximation for maximum weight matching.

[BibT_eX]

[DOI]

Seth Pettie

Inf. Process. Lett., 2004

Algorithms for Memory Hierarchies (Column: Algorithmics).

[BibT_eX]

Bull. EATCS, 2004

Algorithms for Scalable Storage Servers.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2004: Theory and Practice of Computer Science, 2004

Engineering an External Memory Minimum Spanning Tree Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Exploring New Frontiers of Theoretical Informatics, 2004

Super Scalar Sample Sort.

[BibT_eX]

[DOI]

Sebastian Winkel

Proceedings of the Algorithms, 2004

Engineering a Sorted List Data Structure for 32 Bit Key.

[BibT_eX]

Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics, 2004

2003

Asynchronous Scheduling of Redundant Disk Arrays.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2003

[Delta]-stepping: a parallelizable shortest path algorithm.

[BibT_eX]

[DOI]

Ulrich Meyer

J. Algorithms, 2003

A bandwidth latency tradeoff for broadcast and reduction.

[BibT_eX]

[DOI]

Jop F. Sibeyn

Inf. Process. Lett., 2003

Tail Bounds And Expectations For Random Arc Allocation And Applications.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2003

Fast Concurrent Access to Parallel Disks.

[BibT_eX]

[DOI]

Sebastian Egner

Jan H. M. Korst

Algorithmica, 2003

Scanning Multiple Sequences Via Cache Memory.

[BibT_eX]

[DOI]

Algorithmica, 2003

Polynomial time algorithms for network information flow.

[BibT_eX]

[DOI]

Sebastian Egner

Ludo M. G. M. Tolhuizen

Proceedings of the SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2003

Asynchronous parallel disk sorting.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2003

Scheduling and Traffic Allocation for Tasks with Bounded Splittability.

[BibT_eX]

[DOI]

Piotr Krysta

Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

Simple Linear Work Suffix Array Construction.

[BibT_eX]

[DOI]

Juha Kärkkäinen

Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

A Practical Minimum Spanning Tree Algorithm Using the Cycle Property.

[BibT_eX]

[DOI]

Irit Katriel

Proceedings of the Algorithms, 2003

Approximating Energy Efficient Paths in Wireless Multi-hop Networks.

[BibT_eX]

[DOI]

Stefan Funke

Domagoj Matijevic

Proceedings of the Algorithms, 2003

2002

SKaMPI: a comprehensive benchmark for public benchmarking of MPI.

[BibT_eX]

[DOI]

Ralf H. Reussner

Sci. Program., 2002

Reconciling simplicity and realism in parallel disk models.

[BibT_eX]

[DOI]

Parallel Comput., 2002

Cellular Automata: Energy Consumption and Physical Feasibility.

[BibT_eX]

[DOI]

Roland Vollmar

Thomas Worsch

Fundam. Informaticae, 2002

Towards optimal locality in mesh-indexings.

[BibT_eX]

[DOI]

Rolf Niedermeier

Klaus Reinhardt

Discret. Appl. Math., 2002

Randomized Receiver Initiated Load-balancing Algorithms for Tree-shaped Computations.

[BibT_eX]

[DOI]

Comput. J., 2002

Random Arc Allocation and Applications.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2002

Energy Optimal Routing in Radio Networks Using Geometric Data Structures.

[BibT_eX]

[DOI]

René Beier

Naveen Sivadasan

Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

The Hierarchical Factor Algorithm for All-to-All Communication (Research Note).

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2002, 2002

Memory Hierarchies - Models and Lower Bounds.

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Memory Hierarchies, 2002

2001

How Helpers Hasten h-Relations.

[BibT_eX]

[DOI]

Roberto Solis-Oba

J. Algorithms, 2001

The power of duality for prefetching and sorting with parallel disks.

[BibT_eX]

[DOI]

David A. Hutchinson

Jeffrey Scott Vitter

Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2001

2000

Fast Priority Queues for Cached Memory.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2000

Parallel Integer Optimization for Crew Scheduling.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2000

Asymptotic Complexity from Experiments? A Case Study for Randomized Algorithms.

[BibT_eX]

[DOI]

Rudolf Fleischer

Proceedings of the Algorithm Engineering, 2000

Parallel Shortest Path for Arbitrary Graphs.

[BibT_eX]

[DOI]

Ulrich Meyer

Proceedings of the Euro-Par 2000, Parallel Processing, 6th International Euro-Par Conference, Munich, Germany, August 29, 2000

How Helpers Hasten h-Relations.

[BibT_eX]

[DOI]

Roberto Solis-Oba

Proceedings of the Algorithms, 2000

Presenting Data from Experiments in Algorithmics.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithmics, 2000

Using Finite Experiments to Study Asymptotic Performance.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithmics, 2000

Algorithm Engineering for Parallel Computation.

[BibT_eX]

[DOI]

David A. Bader

Bernard M. E. Moret

Proceedings of the Experimental Algorithmics, 2000

1999

Analysis of nearest neighbor load balancing algorithms for random loads.

[BibT_eX]

[DOI]

Parallel Comput., 1999

A case study in scalability: An ADI method for the two-dimensional time-dependent Dirac equation.

[BibT_eX]

[DOI]

U. W. Rathe

P. L. Knight

Parallel Comput., 1999

Asynchronous Random Polling Dynamic Load Balancing.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 10th International Symposium, 1999

Accessing Multiple Sequences Through Set Associative Caches.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1999

High Performance Integer Optimization for Crew Scheduling.

[BibT_eX]

[DOI]

Tuomo Takkula

Dag Wedelin

Proceedings of the High-Performance Computing and Networking, 7th International Conference, 1999

1998

Randomized Priority Queues for Fast Parallel Access.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 1998

Random Permutations on Distributed, External and Hierarchical Memory.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1998

An Implementation of the Binary Blocking Flow Algorithm.

[BibT_eX]

Torben Hagerup

Proceedings of the Algorithm Engineering, 2nd International Workshop, 1998

SKaMPI: A Detailed, Accurate MPI Benchmark.

[BibT_eX]

[DOI]

Proceedings of the Recent Advances in Parallel Virtual Machine and Message Passing Interface, 1998

A Parallelization of Dijkstra's Shortest Path Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

Parallel Crew Scheduling in PAROS.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par '98 Parallel Processing, 1998

Delta-Stepping: A Parallel Single Source Shortest Path Algorithm.

[BibT_eX]

[DOI]

Ulrich Meyer

Proceedings of the Algorithms, 1998

1997

Lastverteilungsalgorithmen für parallele Tiefensuche.

[BibT_eX]

[DOI]

PhD thesis, 1997

Efficient Massively Parallel Quicksort.

[BibT_eX]

[DOI]

Thomas Hansch

Proceedings of the Solving Irregularly Structured Problems in Parallel, 1997

Feasible Models of Computation: Three-Dimensionality and Energy Consumption.

[BibT_eX]

[DOI]

Roland Vollmar

Thomas Worsch

Proceedings of the Euro-Par '97 Parallel Processing, 1997

Parallele Programmierung mit MPI - ein Praktikum, Programmtexte im Internet.

[BibT_eX]

Thomas Worsch

Logos Verlag, ISBN: 978-3-931216-76-4, 1997

1996

Optimizing the Emulation of MIMD Behavior on SIMD Machines.

[BibT_eX]

Proceedings of the Parcella 1996, 1996

On the Efficiency of Nearest Neighbor Load Balancing for Random Loads.

[BibT_eX]

Proceedings of the Parcella 1996, 1996

1995

Fast Priority Queues for Parallel Branch-and-Bound.

[BibT_eX]

[DOI]

Proceedings of the Parallel Algorithms for Irregularly Structured Problems, 1995

Better Algorithms for Parallel Backtracking.

[BibT_eX]

[DOI]

Proceedings of the Parallel Algorithms for Irregularly Structured Problems, 1995

Parallel Game Tree Search on SIMD Machines.

[BibT_eX]

[DOI]

Holger Hopp

Proceedings of the Parallel Algorithms for Irregularly Structured Problems, 1995

1994

Massively Parallel Search for Transition-Tables of Polyautomata.

[BibT_eX]

Proceedings of the Parcella 1994, 1994

A detailed analysis of random polling dynamic load balancing.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Parallel Architectures, 1994

Emulating MIMD Behaviour on SIMD-Machines.

[BibT_eX]

Proceedings of the Massively Parallel Processing Applications and Develompent, 1994

1993

A Case Study in Object Oriented Programming: Algebraic Structures in Eiffel.

[BibT_eX]