Friedhelm Meyer auf der Heide

According to our database1, Friedhelm Meyer auf der Heide
  • authored at least 203 papers between 1979 and 2017.
  • has a "Dijkstra number"2 of three.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
Gathering Anonymous, Oblivious Robots on a Grid.
CoRR, 2017

2016
Algorithm Engineering Aspects of Real-Time Rendering Algorithms.
Proceedings of the Algorithm Engineering - Selected Results and Surveys, 2016

Introduction to the Special Issue on SPAA 2014.
TOPC, 2016

Towards the price of leasing online.
J. Comb. Optim., 2016

Cost-efficient Scheduling on Machines from the Cloud.
CoRR, 2016

On Competitive Algorithms for Approximations of Top-k-Position Monitoring of Distributed Streams.
CoRR, 2016

Asymptotically Optimal Gathering on a Grid.
CoRR, 2016

Asymptotically Optimal Gathering on a Grid.
Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, 2016

On Competitive Algorithms for Approximations of Top-k-Position Monitoring of Distributed Streams.
Proceedings of the 2016 IEEE International Parallel and Distributed Processing Symposium, 2016

Gathering a Closed Chain of Robots on a Grid.
Proceedings of the 2016 IEEE International Parallel and Distributed Processing Symposium, 2016

The Monotone Circuit Value Problem with Bounded Genus Is in NC.
Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

Cost-Efficient Scheduling on Machines from the Cloud.
Proceedings of the Combinatorial Optimization and Applications, 2016

Scheduling with Interjob Communication on Parallel Processors.
Proceedings of the Combinatorial Optimization and Applications, 2016

On the Parameterized Parallel Complexity and the Vertex Cover Problem.
Proceedings of the Combinatorial Optimization and Applications, 2016

The Impact of the Gabriel Subgraph of the Visibility Graph on the Gathering of Mobile Autonomous Robots.
Proceedings of the Algorithms for Sensor Systems, 2016

2015
Linear and Competitive Strategies for Continuous Robot Formation Problems.
TOPC, 2015

Non-Preemptive Scheduling on Machines with Setup Times.
CoRR, 2015

Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-Hoc Networks.
CoRR, 2015

Towards Gathering Robots with Limited View in Linear Time: The Closed Chain Case.
CoRR, 2015

Gathering a Closed Chain of Robots on a Grid.
CoRR, 2015

Non-preemptive Scheduling on Machines with Setup Times.
Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Online Resource Leasing.
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015

Online Top-k-Position Monitoring of Distributed Data Streams.
Proceedings of the 2015 IEEE International Parallel and Distributed Processing Symposium, 2015

Towards Flexible Demands in Online Leasing Problems.
Proceedings of the Computing and Combinatorics - 21st International Conference, 2015

2014
Online Top-k-Position Monitoring of Distributed Data Streams.
CoRR, 2014

Quality of Service in Network Creation Games.
CoRR, 2014

Quality of Service in Network Creation Games.
Proceedings of the Web and Internet Economics - 10th International Conference, 2014

Scheduling shared continuous resources on many-cores.
Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, 2014

Algorithmic Aspects of Resource Management in the Cloud.
Proceedings of the Structural Information and Communication Complexity, 2014

Continuous Aggregation in Dynamic Ad-Hoc Networks.
Proceedings of the Structural Information and Communication Complexity, 2014

Fast Collisionless Pattern Formation by Anonymous, Position-Aware Robots.
Proceedings of the Principles of Distributed Systems - 18th International Conference, 2014

Randomized Online Algorithms for Set Cover Leasing Problems.
Proceedings of the Combinatorial Optimization and Applications, 2014

2013
Energy-efficient strategies for building short chains of mobile robots locally.
Theor. Comput. Sci., 2013

Hierarchies.
CoRR, 2013

Spherical Visibility Sampling.
Comput. Graph. Forum, 2013

On Two-Party Communication through Dynamic Networks.
Proceedings of the Principles of Distributed Systems - 17th International Conference, 2013

Real-Time 3D Rendering of Heterogeneous Scenes.
Proceedings of the Advances in Visual Computing - 9th International Symposium, 2013

Evaluation of Rendering Algorithms Using Position-Dependent Scene Properties.
Proceedings of the Advances in Visual Computing - 9th International Symposium, 2013

On-The-Fly Computing: A novel paradigm for individualized IT services.
Proceedings of the 16th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing, 2013

A Distributed Approximation Algorithm for Strongly Connected Dominating-Absorbent Sets in Asymmetric Wireless Ad-Hoc Networks.
Proceedings of the Algorithms for Sensor Systems, 2013

Token Dissemination in Geometric Dynamic Networks.
Proceedings of the Algorithms for Sensor Systems, 2013

2012
Smoothed analysis of left-to-right maxima with applications.
ACM Trans. Algorithms, 2012

The EATCS Award 2013. Call for nominations.
Bulletin of the EATCS, 2012

Continuous Local Strategies for Robotic Formation Problems.
Proceedings of the Experimental Algorithms - 11th International Symposium, 2012

Distributed computing in fault-prone dynamic networks.
Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems, 2012

Optimal and competitive runtime bounds for continuous, local gathering of mobile robots.
Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, 2012

An Algorithm for Online Facility Leasing.
Proceedings of the Structural Information and Communication Complexity, 2012

Asynchronous Occlusion Culling on Heterogeneous PC Clusters for Distributed 3D Scenes.
Proceedings of the Advances in Visual Computing - 8th International Symposium, 2012

2011
Building Simple Formations in Large Societies of Tiny Mobile Robots.
Proceedings of the 2nd European Future Technologies Conference and Exhibition, 2011

Editorial.
Journal of Interconnection Networks, 2011

A survey on relay placement with runtime and approximation guarantees.
Computer Science Review, 2011

Convergence of local communication chain strategies via linear transformations: or how to trade locality for speed.
Proceedings of the SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2011

A tight runtime bound for synchronous gathering of autonomous robots with limited visibility.
Proceedings of the SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2011

Collisionless Gathering of Robots with an Extent.
Proceedings of the SOFSEM 2011: Theory and Practice of Computer Science, 2011

Energy-Efficient Strategies for Building Short Chains of Mobile Robots Locally.
Proceedings of the Structural Information and Communication Complexity, 2011

An Experimental Comparison of Load Balancing Strategies in a Web Computing Environment.
Proceedings of the Parallel Processing and Applied Mathematics, 2011

A New Approach for Analyzing Convergence Algorithms for Mobile Robots.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

Local, Self-organizing Strategies for Robotic Formation Problems.
Proceedings of the Algorithms for Sensor Systems, 2011

Bin Packing - How Do I Get My Stuff into the Boxes.
Proceedings of the Algorithms Unplugged, 2011

Energy-Awareness in Self-organising Robotic Exploration Teams.
Proceedings of the Organic Computing - A Paradigm Shift for Complex Systems, 2011

2010
Algorithmische Grundlagen verteilter Speichersysteme.
Informatik Spektrum, 2010

A local O(n2) gathering algorithm.
Proceedings of the SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2010

A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots.
Proceedings of the Structural Information and Communication Complexity, 2010

2009
Optimal strategies for maintaining a chain of relays between an explorer and a base camp.
Theor. Comput. Sci., 2009

Optimal algorithms for page migration in dynamic networks.
J. Discrete Algorithms, 2009

Power-aware online file allocation in mobile ad hoc networks: [extended abstract].
Proceedings of the SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2009

2008
Bin Packing oder "Wie bekomme ich die Klamotten in die Kisten?".
Proceedings of the Taschenbuch der Algorithmen, 2008

Planar Visibility Counting
CoRR, 2008

Local Strategies for Connecting Stations by Small Robotic Networks.
Proceedings of the Biologically-Inspired Collaborative Computing, 2008

2007
Local strategies for maintaining a chain of relay stations between an explorer and a base station.
Proceedings of the SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2007

Dynamic and Redundant Data Placement.
Proceedings of the 27th IEEE International Conference on Distributed Computing Systems (ICDCS 2007), 2007

2006
A Web Computing Environment for Parallel Algorithms in Java.
Scalable Computing: Practice and Experience, 2006

Smart Robot Teams Exploring Sparse Trees.
Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

De Dictionariis Dynamicis Pauco Spatio Utentibus (lat. On Dynamic Dictionaries Using Little Space).
Proceedings of the LATIN 2006: Theoretical Informatics, 2006

Maintaining Communication Between an Explorer and a Base Station.
Proceedings of the Biologically Inspired Cooperative Computing, 2006

2005
De Dictionariis Dynamicis Pauco Spatio Utentibus
CoRR, 2005

Load Balancing Strategies in a Web Computing Environment.
Proceedings of the Parallel Processing and Applied Mathematics, 2005

A Web Computing Environment for Parallel Algorithms in Java.
Proceedings of the Parallel Processing and Applied Mathematics, 2005

Page Migration in Dynamic Networks.
Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

Dynamic Load Balancing in Distributed Hash Tables.
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.
Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

05361 Abstracts Collection - Algorithmic Aspects of Large and Complex Networks.
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.
Presence, 2004

Congestion, Dilation, and Energy in Radio Networks.
Theory Comput. Syst., 2004

Scheduling against an adversarial network.
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.
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.
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.
Proceedings of the Algorithms, 2004

2003
Optimal broadcast on parallel locality models.
J. Discrete Algorithms, 2003

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

A holistic methodology for network processor design.
Proceedings of the 28th Annual IEEE Conference on Local Computer Networks (LCN 2003), 2003

Smoothed Motion Complexity.
Proceedings of the Algorithms, 2003

2002
Data Management in Networks: Experimental Evaluation of a Provably Good Strategy.
Theory Comput. Syst., 2002

The randomized sample tree: a data structure for interactive walkthroughs in externally stored virtual environments.
Proceedings of the ACM Symposium on Virtual Reality Software and Technology, 2002

Energy, congestion and dilation in radio networks.
SPAA, 2002

Mobile Computing, Mobile Networks.
Proceedings of the Euro-Par 2002, 2002

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

Invited Presentation: Data Management in Networks.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2001

The randomized z-buffer algorithm: interactive rendering of highly complex scenes.
Proceedings of the 28th Annual Conference on Computer Graphics and Interactive Techniques, 2001

Parallel Bridging Models and Their Impact on Algorithm Design.
Proceedings of the Computational Science - ICCS 2001, 2001

2000
Contention Resolution in Hashing Based Shared Memory Simulations.
SIAM J. Comput., 2000

Data management in hierarchical bus networks.
SPAA, 2000

Caching in networks (extended abstract).
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Optimal broadcast on parallel locality models.
Proceedings of the SIROCCO 7, 2000

Complexity Theory and Algorithms.
Proceedings of the Euro-Par 2000, Parallel Processing, 6th International Euro-Par Conference, Munich, Germany, August 29, 2000

1999
Allocating Weighted Jobs in Parallel.
Theory Comput. Syst., 1999

Shortest-Path Routing in Arbitrary Networks.
J. Algorithms, 1999

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

Vorwort: Junge Informatik.
Proceedings of the Informatik '99, 1999

International Workshop on Communication and Data Management in Large Networks.
Proceedings of the Informatik '99, 1999

Provably Good and Practical Strategies for Non-Uniform Data Management in Networks.
Proceedings of the Algorithms, 1999

1998
Routing on Networks of Optical Crossbars.
Theor. Comput. Sci., 1998

Truly Efficient Parallel Algorithms: 1-optimal Multisearch for an Extension of the BSP Model.
Theor. Comput. Sci., 1998

Randomized Protocols for Low Congestion Circuit Routing in Multistage Interconnection Networks.
Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998

Communication-Efficient Parallel Multiway and Approximate Minimum Cut Computation.
Proceedings of the LATIN '98: Theoretical Informatics, 1998

1997
Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks.
Theory Comput. Syst., 1997

Transforming Comparison Model Lower Bounds to the Parallel-Random-Access-Machine.
Inf. Process. Lett., 1997

Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures.
Inf. Comput., 1997

A Lower Bound for Randomized Algebraic Decision Trees.
Computational Complexity, 1997

Allocating Weighted Jobs in Parallel.
SPAA, 1997

Communication Efficient Parallel Searching.
Proceedings of the Solving Irregularly Structured Problems in Parallel, 1997

Optimal Wormhole Routing in the (n, d)-Torus.
Proceedings of the 11th International Parallel Processing Symposium (IPPS '97), 1997

Parallel Computing in Paderborn: The SFB 376 "Massive Parallelism - Algorithms, Design Methods, Applications".
Proceedings of the Informatik '97, 1997

Exploiting Locality for Data Management in Systems of Limited Bandwidth.
Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997

Routing on Asyncronous Processor Networks.
Proceedings of the Euro-Par '97 Parallel Processing, 1997

Static and Dynamic Data Management in Networks.
Proceedings of the Euro-Par '97 Parallel Processing, 1997

Dynamic Data Structures for Realtime Management of Large Geormetric Scences (Extended Abstract).
Proceedings of the Algorithms, 1997

1996
Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations.
Theor. Comput. Sci., 1996

The Tree Model for Hashing: Lower and Upper Bounds.
SIAM J. Comput., 1996

Efficient PRAM Simulation on a Distributed Memory Machine.
Algorithmica, 1996

Strongly Adaptive Token Distribution.
Algorithmica, 1996

Trial and Error. A New Approach to Space-Bounded Learning.
Acta Inf., 1996

A Lower Bound for Randomized Algebraic Decision Trees.
Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

Universal Algorithms for Store-and-Forward and Wormhole Routing.
Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

Fault-Tolerant Shared Memory Simulations.
Proceedings of the STACS 96, 1996

Communication in Parallel Systems.
Proceedings of the SOFSEM '96: Theory and Practice of Informatics, 1996

Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols.
Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996

Routing on Networks of Optical Crossbars (Extended Abstract).
Proceedings of the Euro-Par '96 Parallel Processing, 1996

Realistic Parallel Algorithms: Priority Queue Operations and Selection for the BSP Model.
Proceedings of the Euro-Par '96 Parallel Processing, 1996

1995
A Lower Bound for Randomized Algebraic Decision Trees
Electronic Colloquium on Computational Complexity (ECCC), 1995

Hot-Potato Routing on Multi-Dimensional Tori.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1995

A Packet Routing Protocol for Arbitrary Networks.
STACS, 1995

Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations.
STACS, 1995

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

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

Improved Optimal Shared Memory Simulations, and the Power of Reconfiguration.
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.
Proceedings of the Algorithms, 1995

Shared Memory Simulations with Triple-Logarithmic Delay.
Proceedings of the Algorithms, 1995

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

1994
Dynamic Perfect Hashing: Upper and Lower Bounds.
SIAM J. Comput., 1994

1993
An Optimal Parallel Dictionary
Inf. Comput., February, 1993

Capabilities and Complexity of Computations with Integer Division.
Proceedings of the STACS 93, 1993

Simple, Efficient Shared Memory Simulations.
SPAA, 1993

Strongly Adaptive Token Distribution.
Proceedings of the Automata, Languages and Programming, 20nd International Colloquium, 1993

1992
Efficient PRAM Simulation on a Distributed Memory Machine
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

On the Performance of Networks with Multiple Busses.
Proceedings of the STACS 92, 1992

Hashing Strategies for Simulating Shared Memory on Distributed Memory Machines.
Proceedings of the Parallel Architectures and Their Efficient Use, 1992

High Performance Universal Hashing, with Applications to Shared Memory Simulations.
Proceedings of the Data Structures and Efficient Algorithms, 1992

1990
Das Heinz Nixdorf-Institut der Universität-GH Paderborn.
Informatik Spektrum, 1990

Not All Keys Can Be Hashed in Constant Time (Preliminary Version)
Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990

How to Distribute a Dictionary in a Complete Network
Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990

On the Complexity of Genuinely Polynomial Computation.
Proceedings of the Mathematical Foundations of Computer Science 1990, 1990

Dynamic Hashing Strategies.
Proceedings of the Mathematical Foundations of Computer Science 1990, 1990

A New Universal Class of Hash Functions and Dynamic Hashing in Real Time.
Proceedings of the Automata, Languages and Programming, 17th International Colloquium, 1990

1989
On Computations with Integer Division.
ITA, 1989

Time-Optimal Simulations of Networks by Universal Parallel Computers.
Proceedings of the STACS 89, 1989

Computing Minimum Spanning Forests on 1- and 2-Dimensional Processor Arrays.
Proceedings of the STACS 89, 1989

On Genuinely Time Bounded Compuations.
Proceedings of the STACS 89, 1989

An Optimal Parallel Dictionary.
SPAA, 1989

1988
On the Limits of Computations with the Floor Function
Inf. Comput., August, 1988

A Tradeoff Between Search and Update Time for the Implicit Dictionary Problem.
Theor. Comput. Sci., 1988

Fast algorithms for N-dimensional restrictions of hard problems.
J. ACM, 1988

Upper and Lower Bounds for the Dictionary Problem (Abstract).
Proceedings of the SWAT 88, 1988

On Computations with Integer Division.
Proceedings of the STACS 88, 1988

Dynamic Perfect Hashing: Upper and Lower Bounds
Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988

1987
The Complexity of Parallel Sorting.
SIAM J. Comput., 1987

A Time-Space Tradeoff for Element Distinctness.
SIAM J. Comput., 1987

1986
Efficient Simulations Among Several Models of Parallel Computers.
SIAM J. Comput., 1986

Speeding up Random Access Machines by Few Processors.
Proceedings of the STACS 86, 1986

A Time-Space Tradeoff for Element Distinctness.
Proceedings of the STACS 86, 1986

A Tradeoff Between Search and Update Time for the Implicit Dictionary Problem.
Proceedings of the Automata, Languages and Programming, 13th International Colloquium, 1986

1985
Lower Bounds for Solving Linear Diophantine Equations on Random Access Machines
J. ACM, October, 1985

Simulating Probabilistic by Deterministic Algebraic Computation Trees.
Theor. Comput. Sci., 1985

Lower Time Bounds for Integer Programming with Two Variables.
Inf. Process. Lett., 1985

Lower Time Bounds for Solving Linear Diophantine Equations on Several Parallel Computational Models
Information and Control, 1985

Fast Algorithms for N-Dimensional Restrictions of Hard Problems
Proceedings of the 17th Annual ACM Symposium on Theory of Computing, 1985

One, Two, Three \dots Infinity: Lower Bounds for Parallel Computation
Proceedings of the 17th Annual ACM Symposium on Theory of Computing, 1985

The Complexity of Parallel Sorting
Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985

Nondeterministic versus Probabilistic Linear Search Algorithms
Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985

1984
A Polynomial Linear Search Algorithm for the n-Dimensional Knapsack Problem.
J. ACM, 1984

Efficient Simulations among Several Models of Parallel Computers.
Proceedings of the STACS 84, 1984

On the Limits to Speed Up Parallel Machines by Large Hardware and Unbounded Communication
Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984

1983
Infinite Cube-Connected Cycles.
Inf. Process. Lett., 1983

A Lower Time Bound for the Knapsack Problem on Random Access Machines.
Acta Inf., 1983

Efficiency of Universal Parallel Computers.
Acta Inf., 1983

Efficiency of universal parallel computers.
Proceedings of the Theoretical Computer Science, 1983

A Polynomial Linear Search Algorithm for the N-Dimensional Knapsack Problem
Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 1983

1981
Effizienz universeller Parallelrechner.
PhD thesis, 1981

A Comparison of two Variations of a Pebble Game on Graphs.
Theor. Comput. Sci., 1981

Time-Processor Trade-offs for Universal Parallel Computers.
Proceedings of the Mathematical Foundations of Computer Science 1981, Strbske Pleso, Czechoslovakia, August 31, 1981

Random Access Machines and Straight-Line Programs.
Proceedings of the Fundamentals of Computation Theory, 1981

1980
Untere Zeitschranken für das Rucksack-Problem.
Proceedings of the GI - 10. Jahrestagung, Saarbrücken, 30. September, 1980

1979
A Comparison Between Two Variations of a Pebble Game on Graphs.
Proceedings of the Automata, 1979


  Loading...