Friedhelm Meyer auf der Heide

Burkhard Monien

HNI-Verlagsschriftenreihe 181, Heinz Nixdorf Institut, ISBN: 978-3-939350-00-2, 2006

2005

De Dictionariis Dynamicis Pauco Spatio Utentibus

[BibT_eX]

[DOI]

Erik D. Demaine

Rasmus Pagh

Mihai Patrascu

CoRR, 2005

Load Balancing Strategies in a Web Computing Environment.

[BibT_eX]

[DOI]

Olaf Bonorden

Joachim Gehweiler

Proceedings of the Parallel Processing and Applied Mathematics, 2005

Page Migration in Dynamic Networks.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

Dynamic Load Balancing in Distributed Hash Tables.

[BibT_eX]

[DOI]

Miroslaw Korzeniowski

Proceedings of the Peer-to-Peer Systems IV, 4th International Workshop, 2005

Average case complexity of Voronoi diagrams of n sites from the unit cube.

[BibT_eX]

[DOI]

Valentina Damerow

Christian Sohler

Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

05361 Abstracts Collection - Algorithmic Aspects of Large and Complex Networks.

[BibT_eX]

[DOI]

Stefano Leonardi

Dorothea Wagner

Proceedings of the Algorithmic Aspects of Large and Complex Networks, 4.-9. September 2005, 2005

2004

The Randomized Sample Tree: A Data Structure for Interactive Walkthroughs in Externally Stored Virtual Environments.

[BibT_eX]

[DOI]

Presence Teleoperators Virtual Environ., 2004

Congestion, Dilation, and Energy in Radio Networks.

[BibT_eX]

[DOI]

Alberto Marchetti-Spaccamela

Christian Schindelhauer

Klaus Volbert

Matthias Grünewald

Theory Comput. Syst., 2004

Scheduling against an adversarial network.

[BibT_eX]

[DOI]

Stefano Leonardi

Proceedings of the SPAA 2004: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2004

Fighting against two adversaries: page migration in dynamic networks.

[BibT_eX]

[DOI]

Miroslaw Korzeniowski

Proceedings of the SPAA 2004: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2004

V: Drive - Costs and Benefits of an Out-of-Band Storage Virtualization System.

[BibT_eX]

[DOI]

André Brinkmann

Michael Heidebuer

Ulrich Rückert

Kay Salzwedel

Mario Vodisek

Proceedings of the 21st IEEE Conference on Mass Storage Systems and Technologies / 12th NASA Goddard Conference on Mass Storage Systems and Technologies, 2004

Labeling Smart Dust.

[BibT_eX]

[DOI]

Vikas Bansal

Christian Sohler

Proceedings of the Algorithms, 2004

2003

Optimal broadcast on parallel locality models.

[BibT_eX]

[DOI]

Ben H. H. Juurlink

Petr Kolman

Ingo Rieping

J. Discrete Algorithms, 2003

Sonderforschungsbereich 376 Massive Parallelität: Algorithmen - Entwurfsmethoden - Anwendungen (Massively Parallel Computing: Algorithms - Design Methods - Applications).

[BibT_eX]

[DOI]

it Inf. Technol., 2003

A holistic methodology for network processor design.

[BibT_eX]

[DOI]

Jörg-Christian Niemann

Proceedings of the 28th Annual IEEE Conference on Local Computer Networks (LCN 2003), 2003

Smoothed Motion Complexity.

[BibT_eX]

[DOI]

Valentina Damerow

Harald Räcke

Christian Sohler

Proceedings of the Algorithms, 2003

2002

Data Management in Networks: Experimental Evaluation of a Provably Good Strategy.

[BibT_eX]

[DOI]

Christof Krick

Harald Räcke

Theory Comput. Syst., 2002

Energy, congestion and dilation in radio networks.

[BibT_eX]

[DOI]

Christian Schindelhauer

Klaus Volbert

Matthias Grünewald

Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2002

Mobile Computing, Mobile Networks.

[BibT_eX]

[DOI]

Mohan Kumar

Sotiris E. Nikoletseas

Paul G. Spirakis

Proceedings of the Euro-Par 2002, 2002

2001

Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols.

[BibT_eX]

[DOI]

Comb., 2001

Invited Presentation: Data Management in Networks.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2001

The randomized z-buffer algorithm: interactive rendering of highly complex scenes.

[BibT_eX]

[DOI]

Michael Wand

Matthias Fischer

Ingmar Peter

Wolfgang Straßer

Proceedings of the 28th Annual Conference on Computer Graphics and Interactive Techniques, 2001

Parallel Bridging Models and Their Impact on Algorithm Design.

[BibT_eX]

[DOI]

Proceedings of the Computational Science - ICCS 2001, 2001

2000

Contention Resolution in Hashing Based Shared Memory Simulations.

[BibT_eX]

[DOI]

SIAM J. Comput., 2000

Data management in hierarchical bus networks.

[BibT_eX]

[DOI]

Harald Räcke

Proceedings of the Twelfth annual ACM Symposium on Parallel Algorithms and Architectures, 2000

Caching in networks (extended abstract).

[BibT_eX]

[DOI]

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Complexity Theory and Algorithms.

[BibT_eX]

[DOI]

Miroslaw Kutylowski

Prabhakar Ragde

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

1999

Allocating Weighted Jobs in Parallel.

[BibT_eX]

[DOI]

Petra Berenbrink

Klaus Schröder

Theory Comput. Syst., 1999

Shortest-Path Routing in Arbitrary Networks.

[BibT_eX]

[DOI]

J. Algorithms, 1999

Vorwort: Junge Informatik.

[BibT_eX]

Friedemann Mattern

Proceedings of the Informatik '99, 1999

International Workshop on Communication and Data Management in Large Networks.

[BibT_eX]

[DOI]

Ernst W. Mayr

Proceedings of the Informatik '99, 1999

Provably Good and Practical Strategies for Non-Uniform Data Management in Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1999

1998

Routing on Networks of Optical Crossbars.

[BibT_eX]

[DOI]

Klaus Schröder

Frank Schwarze

Theor. Comput. Sci., 1998

Truly Efficient Parallel Algorithms: 1-optimal Multisearch for an Extension of the BSP Model.

[BibT_eX]

[DOI]

Wolfgang Dittrich

Theor. Comput. Sci., 1998

Randomized Protocols for Low Congestion Circuit Routing in Multistage Interconnection Networks.

[BibT_eX]

[DOI]

Richard Cole

Bruce M. Maggs

Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998

Communication-Efficient Parallel Multiway and Approximate Minimum Cut Computation.

[BibT_eX]

[DOI]

Gabriel Terán Martinez

Proceedings of the LATIN '98: Theoretical Informatics, 1998

1997

Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks.

[BibT_eX]

[DOI]

Martin Storch

Theory Comput. Syst., 1997

Transforming Comparison Model Lower Bounds to the Parallel-Random-Access-Machine.

[BibT_eX]

[DOI]

Dany Breslauer

Devdatt P. Dubhashi

Inf. Process. Lett., 1997

Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures.

[BibT_eX]

[DOI]

Inf. Comput., 1997

A Lower Bound for Randomized Algebraic Decision Trees.

[BibT_eX]

[DOI]

Dima Grigoriev

Marek Karpinski

Roman Smolensky

Comput. Complex., 1997

Communication Efficient Parallel Searching.

[BibT_eX]

[DOI]

Proceedings of the Solving Irregularly Structured Problems in Parallel, 1997

Optimal Wormhole Routing in the (n, d)-Torus.

[BibT_eX]

[DOI]

Stefan Bock

Proceedings of the 11th International Parallel Processing Symposium (IPPS '97), 1997

Parallel Computing in Paderborn: The SFB 376 "Massive Parallelism - Algorithms, Design Methods, Applications".

[BibT_eX]

[DOI]

Thomas Decker

Proceedings of the Informatik '97, 1997

Exploiting Locality for Data Management in Systems of Limited Bandwidth.

[BibT_eX]

[DOI]

Bruce M. Maggs

Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997

Routing on Asyncronous Processor Networks.

[BibT_eX]

[DOI]

Efstratios Karaivazoglou

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

Static and Dynamic Data Management in Networks.

[BibT_eX]

[DOI]

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

Dynamic Data Structures for Realtime Management of Large Geormetric Scences (Extended Abstract).

[BibT_eX]

[DOI]

Matthias Fischer

Willy-Bernhard Strothmann

Proceedings of the Algorithms, 1997

1996

Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1996

The Tree Model for Hashing: Lower and Upper Bounds.

[BibT_eX]

[DOI]

Joseph Gil

SIAM J. Comput., 1996

Efficient PRAM Simulation on a Distributed Memory Machine.

[BibT_eX]

[DOI]

Richard M. Karp

Michael Luby

Algorithmica, 1996

Strongly Adaptive Token Distribution.

[BibT_eX]

[DOI]

Brigitte Oesterdiekhoff

Algorithmica, 1996

Trial and Error. A New Approach to Space-Bounded Learning.

[BibT_eX]

[DOI]

Foued Ameur

Paul Fischer

Klaus-Uwe Höffgen

Acta Informatica, 1996

Universal Algorithms for Store-and-Forward and Wormhole Routing.

[BibT_eX]

[DOI]

Robert Cypher

Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

Fault-Tolerant Shared Memory Simulations.

[BibT_eX]

[DOI]

Petra Berenbrink

Proceedings of the STACS 96, 1996

Communication in Parallel Systems.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM '96: Theory and Practice of Informatics, 1996

Routing on Networks of Optical Crossbars (Extended Abstract).

[BibT_eX]

[DOI]

Klaus Schröder

Frank Schwarze

Proceedings of the Euro-Par '96 Parallel Processing, 1996

Realistic Parallel Algorithms: Priority Queue Operations and Selection for the BSP Model.

[BibT_eX]

[DOI]

Wolfgang Dittrich

Ingo Rieping

Proceedings of the Euro-Par '96 Parallel Processing, 1996

1995

Hot-Potato Routing on Multi-Dimensional Tori.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1995

A Packet Routing Protocol for Arbitrary Networks.

[BibT_eX]

[DOI]

Proceedings of the STACS 95, 1995

Optimal Trade-Offs Between Size and Slowdown for Universal Parallel Networks.

[BibT_eX]

[DOI]

Martin Storch

Proceedings of the 7th Annual ACM Symposium on Parallel Algorithms and Architectures, 1995

Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the 7th Annual ACM Symposium on Parallel Algorithms and Architectures, 1995

Improved Optimal Shared Memory Simulations, and the Power of Reconfiguration.

[BibT_eX]

[DOI]

Proceedings of the Third Israel Symposium on Theory of Computing and Systems, 1995

Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1995

Shared Memory Simulations with Triple-Logarithmic Delay.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1995

Truly Efficient Parallel Algorithms: c-Optimal Multisearch for an Extension of the BSP Model (Extended Abstract).

[BibT_eX]

[DOI]

Wolfgang Dittrich

Proceedings of the Algorithms, 1995

1994

Dynamic Perfect Hashing: Upper and Lower Bounds.

[BibT_eX]

[DOI]

Anna R. Karlin

Kurt Mehlhorn

Hans Rohnert

Robert Endre Tarjan

SIAM J. Comput., 1994

1993

An Optimal Parallel Dictionary

[BibT_eX]

[DOI]

Katharina Lürwer-Brüggemeier

Inf. Comput., February, 1993

Capabilities and Complexity of Computations with Integer Division.

[BibT_eX]

[DOI]

Proceedings of the STACS 93, 1993

Simple, Efficient Shared Memory Simulations.

[BibT_eX]

[DOI]

Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, 1993

1992

On the Performance of Networks with Multiple Busses.

[BibT_eX]

[DOI]

Hieu Thien Pham

Proceedings of the STACS 92, 1992

Hashing Strategies for Simulating Shared Memory on Distributed Memory Machines.

[BibT_eX]

[DOI]

Proceedings of the Parallel Architectures and Their Efficient Use, 1992

High Performance Universal Hashing, with Applications to Shared Memory Simulations.

[BibT_eX]

[DOI]

Proceedings of the Data Structures and Efficient Algorithms, 1992

Dynamic Hashing in Real Time.

[BibT_eX]

[DOI]

Proceedings of the Informatik, Festschrift zum 60. Geburtstag von Günter Hotz, 1992

1990

Das Heinz Nixdorf-Institut der Universität-GH Paderborn.

[BibT_eX]

Inform. Spektrum, 1990

Not All Keys Can Be Hashed in Constant Time (Preliminary Version)

[BibT_eX]

[DOI]

Joseph Gil

Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990

How to Distribute a Dictionary in a Complete Network

[BibT_eX]

[DOI]

Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990

On the Complexity of Genuinely Polynomial Computation.

[BibT_eX]

[DOI]

Marek Karpinski

Proceedings of the Mathematical Foundations of Computer Science 1990, 1990

Dynamic Hashing Strategies.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1990, 1990

A New Universal Class of Hash Functions and Dynamic Hashing in Real Time.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 17th International Colloquium, 1990

1989

On Computations with Integer Division.

[BibT_eX]

[DOI]

Bettina Just

RAIRO Theor. Informatics Appl., 1989

Time-Optimal Simulations of Networks by Universal Parallel Computers.

[BibT_eX]

[DOI]

Proceedings of the STACS 89, 1989

Computing Minimum Spanning Forests on 1- and 2-Dimensional Processor Arrays.

[BibT_eX]

[DOI]

Proceedings of the STACS 89, 1989

On Genuinely Time Bounded Compuations.

[BibT_eX]

[DOI]

Proceedings of the STACS 89, 1989

1988

On the Limits of Computations with the Floor Function

[BibT_eX]

[DOI]

László Babai

Bettina Just

Inf. Comput., August, 1988

A Tradeoff Between Search and Update Time for the Implicit Dictionary Problem.

[BibT_eX]

[DOI]

Allan Borodin

Faith E. Fich

Eli Upfal

Theor. Comput. Sci., 1988

Fast algorithms for N-dimensional restrictions of hard problems.

[BibT_eX]

[DOI]

J. ACM, 1988

Upper and Lower Bounds for the Dictionary Problem (Abstract).

[BibT_eX]

[DOI]

Kurt Mehlhorn

Hans Rohnert

Proceedings of the SWAT 88, 1988

1987

The Complexity of Parallel Sorting.

[BibT_eX]

[DOI]

SIAM J. Comput., 1987

A Time-Space Tradeoff for Element Distinctness.

[BibT_eX]

[DOI]

Allan Borodin

Faith E. Fich

Eli Upfal

SIAM J. Comput., 1987

1986

Efficient Simulations Among Several Models of Parallel Computers.

[BibT_eX]

[DOI]

SIAM J. Comput., 1986

Speeding up Random Access Machines by Few Processors.

[BibT_eX]

[DOI]

Proceedings of the STACS 86, 1986

1985

Lower Bounds for Solving Linear Diophantine Equations on Random Access Machines

[BibT_eX]

[DOI]

J. ACM, October, 1985

Simulating Probabilistic by Deterministic Algebraic Computation Trees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1985

Lower Time Bounds for Integer Programming with Two Variables.

[BibT_eX]

[DOI]

Clemens Lautemann

Inf. Process. Lett., 1985

Lower Time Bounds for Solving Linear Diophantine Equations on Several Parallel Computational Models

[BibT_eX]

[DOI]

Inf. Control., 1985

One, Two, Three \dots Infinity: Lower Bounds for Parallel Computation

[BibT_eX]

[DOI]

Faith E. Fich

Prabhakar Ragde

Proceedings of the 17th Annual ACM Symposium on Theory of Computing, 1985

Nondeterministic versus Probabilistic Linear Search Algorithms

[BibT_eX]

[DOI]

Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985

1984

A Polynomial Linear Search Algorithm for the n-Dimensional Knapsack Problem.

[BibT_eX]

[DOI]

J. ACM, 1984

On the Limits to Speed Up Parallel Machines by Large Hardware and Unbounded Communication

[BibT_eX]

[DOI]

Rüdiger Reischuk

Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984

1983

Infinite Cube-Connected Cycles.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1983

A Lower Time Bound for the Knapsack Problem on Random Access Machines.

[BibT_eX]

[DOI]

Peter Klein

Acta Informatica, 1983

Efficiency of Universal Parallel Computers.

[BibT_eX]

[DOI]

Acta Informatica, 1983

1981

Effizienz universeller Parallelrechner.

[BibT_eX]

[DOI]

PhD thesis, 1981

A Comparison of two Variations of a Pebble Game on Graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1981

Time-Processor Trade-offs for Universal Parallel Computers.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1981, Strbske Pleso, Czechoslovakia, August 31, 1981

Random Access Machines and Straight-Line Programs.

[BibT_eX]

[DOI]

Hans-Anton Rollik

Proceedings of the Fundamentals of Computation Theory, 1981

1980

Untere Zeitschranken für das Rucksack-Problem.

[BibT_eX]

[DOI]

Peter Klein

Proceedings of the GI - 10. Jahrestagung, Saarbrücken, 30. September, 1980

1979

A Comparison Between Two Variations of a Pebble Game on Graphs.

[BibT_eX]

[DOI]