Burkhard Monien

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

2005

Structure and complexity of extreme Nash equilibria.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

Edge-disjoint spanning trees for the generalized butterfly networks and their applications.

[BibT_eX]

[DOI]

Abderezak Touzene

Khaled Day

J. Parallel Distributed Comput., 2005

A Simple Graph-Theoretic Model for Selfish Restricted Scheduling.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics, First International Workshop, 2005

Nash Equilibria, the Price of Anarchy and the Fully Mixed Nash Equilibrium Conjecture.

[BibT_eX]

[DOI]

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

2004

Error analysis in minimax trees.

[BibT_eX]

[DOI]

Ulf Lorenz

Theor. Comput. Sci., 2004

New spectral lower bounds on the bisection width of graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

Improved bounds on cutwidths of shuffle-exchange and de Bruijn graphs.

[BibT_eX]

[DOI]

Imrich Vrto

Parallel Process. Lett., 2004

Optimal Diffusion Schemes And Load Balancing On Product Graphs.

[BibT_eX]

[DOI]

Parallel Process. Lett., 2004

Graph Partitioning with the Party Library: Helpful-Sets in Practice.

[BibT_eX]

[DOI]

Proceedings of the 16th Symposium on Computer Architecture and High Performance Computing (SBAC-PAD 2004), 2004

Load Balancing in Dynamic Networks.

[BibT_eX]

[DOI]

Proceedings of the 7th International Symposium on Parallel Architectures, 2004

Load Balancing of Indivisible Unit Size Tokens in Dynamic and Heterogeneous Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2004

2003

Sparse topologies with small spectrum size.

[BibT_eX]

[DOI]

Rastislav Kralovic

Theor. Comput. Sci., 2003

On Spectral Bounds for the k-Partitioning of Graphs.

[BibT_eX]

[DOI]

Thomas Lücking

Theory Comput. Syst., 2003

Selfish Routing in Non-Cooperative Networks: A Survey.

[BibT_eX]

Bull. EATCS, 2003

Load balancing of unit size tokens and expansion properties of graphs.

[BibT_eX]

[DOI]

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

Which Is the Worst-Case Nash Equilibrium?

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

Extreme Nash Equilibria.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 8th Italian Conference, 2003

Nashification and the Coordination Ratio for a Selfish Routing Game.

[BibT_eX]

[DOI]

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

Fault Tolerances Analysis of Distributed Reconfigurable Systems Using SAT-Based Techniques.

[BibT_eX]

[DOI]

Proceedings of the Field Programmable Logic and Application, 13th International Conference, 2003

SAT-Based Techniques in System Synthesis.

[BibT_eX]

[DOI]

Proceedings of the 2003 Design, 2003

The Aircraft Sequencing Problem.

[BibT_eX]

[DOI]

Proceedings of the Computer Science in Perspective, Essays Dedicated to Thomas Ottmann, 2003

2002

Diffusion Schemes for Load Balancing on Heterogeneous Networks.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2002

The Secret of Selective Game Tree Search, When Using Random-Error Evaluations.

[BibT_eX]

[DOI]

Ulf Lorenz

Proceedings of the STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes, 2002

On the Problem of Scheduling Flows on Distributed Networks.

[BibT_eX]

[DOI]

Thomas Lücking

Manuel Rode

Proceedings of the Mathematical Foundations of Computer Science 2002, 2002

Toward Optimal Diffusion Matrices.

[BibT_eX]

[DOI]

Proceedings of the 16th International Parallel and Distributed Processing Symposium (IPDPS 2002), 2002

2001

Scalable Sparse Topologies with Small Spectrum.

[BibT_eX]

[DOI]

Rastislav Kralovic

Proceedings of the STACS 2001, 2001

New spectral bounds on k-partitioning of graphs.

[BibT_eX]

[DOI]

Thomas Lücking

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

2000

Quality matching and local improvement for multilevel graph-partitioning.

[BibT_eX]

[DOI]

Parallel Comput., 2000

Diffusive load balancing schemes on heterogeneous networks.

[BibT_eX]

[DOI]

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

Towards Optimal Load Balancing Topologies.

[BibT_eX]

[DOI]

Thomas Decker

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

A Distributed Algorithm to Evaluate Quantified Boolean Formulae.

[BibT_eX]

[DOI]

Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on on Innovative Applications of Artificial Intelligence, July 30, 2000

1999

Efficient schemes for nearest neighbor load balancing.

[BibT_eX]

[DOI]

Andreas Frommer

Parallel Comput., 1999

The Latest Information on the 9th World Computer-Chess Championship.

[BibT_eX]

[DOI]

J. Int. Comput. Games Assoc., 1999

More Information on the 9th World Computer-Chess Championship.

[BibT_eX]

[DOI]

J. Int. Comput. Games Assoc., 1999

Programme of the ACC9 Conference.

[BibT_eX]

[DOI]

J. Int. Comput. Games Assoc., 1999

Call for Participation: Advances in Computer Chess 9 Conference.

[BibT_eX]

[DOI]

J. Int. Comput. Games Assoc., 1999

Optimal and Alternating-Direction Load Balancing Schemes.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par '99 Parallel Processing, 5th International Euro-Par Conference, Toulouse, France, August 31, 1999

1998

Specifying Resources and Services in Metacomputing Environments.

[BibT_eX]

[DOI]

Parallel Comput., 1998

Compressing cube-connected cycles and butterfly networks.

[BibT_eX]

[DOI]

Ralf Klasing

Networks, 1998

Optimal Embedding of Complete Binary Trees into Lines and Grids.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 1998

The 9th World Computer-Chess Championship.

[BibT_eX]

[DOI]

J. Int. Comput. Games Assoc., 1998

Call for Papers Advances in Computer Chess 9 Conference.

[BibT_eX]

[DOI]

J. Int. Comput. Games Assoc., 1998

Embedding ladders and caterpillars into the hypercube.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1998

Parallel Decomposition of Unstructured FEM-Meshes.

[BibT_eX]

[DOI]

Derk Meyer

Concurr. Pract. Exp., 1998

Nearest Neighbor Load Balancing on Graphs.

[BibT_eX]

[DOI]

Andreas Frommer

Proceedings of the Algorithms, 1998

An Integrated Approach to Semantic Evaluation and Content-Based Retrieval of Multimedia Documents.

[BibT_eX]

[DOI]

Alois C. Knoll

Christian Altenschmidt

Proceedings of the Research and Advanced Technology for Digital Libraries, 1998

1997

The Construction of Large Scale Reconfigurable Parallel Computing Systems (The Architecture of the SC320).

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 1997

A Better Upper Bound on the Bisection Width of de Bruijn Networks (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27, 1997

A Local Graph Partitioning Heuristic Meeting Bisection Bounds.

[BibT_eX]

Proceedings of the Eighth SIAM Conference on Parallel Processing for Scientific Computing, 1997

Parallel Sparse Cholesky Factorization.

[BibT_eX]

[DOI]

Jürgen Schulze

Proceedings of the Solving Irregularly Structured Problems in Parallel, 1997

Online Scheduling of Continuous Media Streams.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Computer Science: Potential - Theory, 1997

1996

Combining Helpful Sets and Parallel Simulated Annealing for the Graph-partitioning Problem.

[BibT_eX]

[DOI]

Parallel Algorithms Appl., 1996

On the Communication Throughput of Buffered Multistage Interconnection Networks.

[BibT_eX]

[DOI]

Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures, 1996

Mapping tree-structured combinatorial optimization problems onto parallel computers.

[BibT_eX]

[DOI]

Proceedings of the Solving Combinatorial Optimization Problems in Parallel, 1996

1995

Verteilte Spielbaumsuche.

[BibT_eX]

[DOI]

Peter Mysliwietz

Informationstechnik Tech. Inform., 1995

Nearest-neighbor algorithms for load-balancing in parallel computers.

[BibT_eX]

[DOI]

Concurr. Pract. Exp., 1995

Performance evaluation of load distribution strategies in parallel branch and bound computations.

[BibT_eX]

[DOI]

Cheng-Zhong Xu

Stefan Tschöke

Proceedings of the Seventh IEEE Symposium on Parallel and Distributed Processing, 1995

Towards developing universal dynamic mapping algorithms.

[BibT_eX]

[DOI]

Proceedings of the Seventh IEEE Symposium on Parallel and Distributed Processing, 1995

An analytical comparison of nearest neighbor algorithms for load balancing in parallel computers.

[BibT_eX]

[DOI]

Proceedings of IPPS '95, 1995

Solving the traveling salesman problem with a distributed branch-and-bound algorithm on a 1024 processor network.

[BibT_eX]

[DOI]

Stefan Tschöke

Proceedings of IPPS '95, 1995

A parallel local-search algorithm for the k-partitioning problem.

[BibT_eX]

[DOI]

Proceedings of the 28th Annual Hawaii International Conference on System Sciences (HICSS-28), 1995

A Parallel Simulated Annealing Algorithm for Generating 3D Layouts of Undirected Graphs.

[BibT_eX]

[DOI]

Friedhelm Ramme

Helmut Salmen

Proceedings of the Graph Drawing, Symposium on Graph Drawing, 1995

Efficient Use of Parallel & Distributed Systems: From Theory to Practice.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Today: Recent Trends and Developments, 1995

1994

Corrigendum: Fast Recognition of Deterministic CFL's with a Smaller Number of Processors.

[BibT_eX]

Wojciech Rytter

Helmut Schäpers

Theor. Comput. Sci., 1994

Note on Optimal Gossiping in Some Weak-Connected Graphs.

[BibT_eX]

[DOI]

Claus-Dieter Jeschke

Theor. Comput. Sci., 1994

Broadcasting in Butterfly and deBruijn Networks.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1994

Optimal algorithms for dissemination of information in generalized communication modes.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1994

Sorting large data sets on a massively parallel system.

[BibT_eX]

[DOI]

Proceedings of the Sixth IEEE Symposium on Parallel and Distributed Processing, 1994

Studying Overheads in Massively Parallel MIN/MAX-Tree Evaluation.

[BibT_eX]

[DOI]

Peter Mysliwietz

Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures, 1994

Communication Throughput of Interconnection Networks.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1994, 1994

Using helpful sets to improve graph bisections.

[BibT_eX]

[DOI]

Proceedings of the Workshop on Interconnection Networks and Mapping and Scheduling Parallel Computations, 1994

1993

Fast recognition of deterministic cfl's with a smaller number of processors.

[BibT_eX]

[DOI]

Wojciech Rytter

Leopold Schäpers

Theor. Comput. Sci., 1993

Optimal Algorithms for Dissemination of Information in Some Interconnection Networks.

[BibT_eX]

[DOI]

Claus-Dieter Jeschke

Algorithmica, 1993

Parallel Architectures: Design and Efficient Use.

[BibT_eX]

[DOI]

Proceedings of the STACS 93, 1993

A Dynamic Distributed Load Balancing Algorithm with Provable Good Performance.

[BibT_eX]

[DOI]

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

1992

Mapping und Lastverteilung in parallelen Systemen.

[BibT_eX]

Proceedings of the Parallele Datenverarbeitung mit dem Transputer, 1992

Optimal Algorithms for Disemination of Information in Generalized Communication Modes.

[BibT_eX]

[DOI]

Proceedings of the PARLE '92: Parallel Architectures and Languages Europe, 1992

A Realizable Efficient Parallel Architecture.

[BibT_eX]

[DOI]

Falk Langhammer

Proceedings of the Parallel Architectures and Their Efficient Use, 1992

Load Balancing for Distributed Branch and Bound Algorithms.

[BibT_eX]

[DOI]

Proceedings of the 6th International Parallel Processing Symposium, 1992

Distributed Game Tree Search on a Massively Parallel System.

[BibT_eX]

[DOI]

Peter Mysliwietz

Proceedings of the Data Structures and Efficient Algorithms, 1992

The Bisection Problem for Graphs of Degree 4 (Configuring Transputer Systems).

[BibT_eX]

[DOI]

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

1991

On the Parallel Recognition of Unambiguous Context-Free Languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1991

Bandwidth Minimization: An Approximation Algorithm for Caterpillars.

[BibT_eX]

[DOI]

James Haralambides

Fillia Makedon

Math. Syst. Theory, 1991

Implementierung von Simulated Annealing auf Transputer-Systemen.

[BibT_eX]

Proceedings of the Parallele Datenverarbeitung mit dem Transputer, 1991

Load balancing in large networks: a comparative study.

[BibT_eX]

[DOI]

Friedhelm Ramme

Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, 1991

Simulating Binary Trees on X-Trees (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, 1991

The Bisection Problem for Graphs of Degree 4 (Configuring Transputer Systems).

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1991, 1991

1990

Response to a Comment on 'Distributed Game-Tree Search'.

[BibT_eX]

[DOI]

J. Int. Comput. Games Assoc., 1990

An Improved Algorithm to Detect Communication Deadlocks in Distributed Systems.

[BibT_eX]

[DOI]

Proceedings of the Distributed Algorithms, 4th International Workshop, 1990

Caterpillars and Context-Free Languages.

[BibT_eX]

[DOI]

Michal Chytil

Proceedings of the STACS 90, 1990

Approximation algorithms for the bandwidth minimization problem for caterpillar graphs.

[BibT_eX]

[DOI]

James Haralambides

Fillia Makedon

Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing, 1990

Optimal Algorithms for Dissemination of Information in Some Interconnection Networks (Extended Abstract).

[BibT_eX]

[DOI]

Claus-Dieter Jeschke

Proceedings of the Mathematical Foundations of Computer Science 1990, 1990

1989

Distributed Game-Tree Search.

[BibT_eX]

[DOI]

J. Int. Comput. Games Assoc., 1989

WEighted Parallel Triangulation of Simple Polygons.

[BibT_eX]

[DOI]

Knut Menzel

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

Two Strategies for Solving the Vertex Cover Problem on a Transputer Network.

[BibT_eX]

[DOI]

Proceedings of the Distributed Algorithms, 1989

On the Number of Rounds Necessary to Disseminate Information.

[BibT_eX]

[DOI]

Shimon Even

Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, 1989

1988

Min Cut is NP-Complete for Edge Weighted Treees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1988

Bandwidth and Profile Minimization.

[BibT_eX]

[DOI]

Manfred Wiegers

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

Comparing Interconnection Networks.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1988, 1988

Simulating Binary Trees on Hypercubes.

[BibT_eX]

[DOI]

Proceedings of the VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, 1988

1987

Parallel Processing of Combinatorial Search.

[BibT_eX]

[DOI]

Oliver Vornberger

Proceedings of the Parallel Algorithms and Architectures, 1987

Superlinear Speedup for Parallel Backtracking.

[BibT_eX]

[DOI]

Oliver Vornberger

Proceedings of the Supercomputing, 1987

1986

Min Cut is NP-Complete for Edge Weigthed Trees.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 13th International Colloquium, 1986

1985

Bandwidth Constrained NP-Complete Problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1985

Solving satisfiability in less than 2n steps.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1985

Ramsey Numbers and an Approximation Algorithm for the Vertex Cover Problem.

[BibT_eX]

[DOI]

Acta Informatica, 1985

On the Complexity of Deadlock Recovery.

[BibT_eX]

[DOI]

Joseph Y.-T. Leung

Proceedings of the STACS 85, 1985

The complexity of embedding graphs into binary trees.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 1985

1984

Deterministic Two-Way One-Head Pushdown Automata are Very Powerful.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1984

1983

The complexity of determining a shortest cycle of even length.

[BibT_eX]

[DOI]

Computing, 1983

The Complexity of Determining Paths of Length k.

[BibT_eX]

Proceedings of the WG '83, 1983

Some Further Approximation Algorithms for the Vertex Cover Problem.

[BibT_eX]

[DOI]

Proceedings of the CAAP'83, 1983

1982

On Eliminating Nondeterminism from Turing Machines which Use less than Logarithm Worktape Space.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1982

The Complexity of Determing a Shortest Cycle of Even Length.

[BibT_eX]

Proceedings of the 8th Conference Graphtheoretic Concepts in Computer Science (WG '82), 1982

1981

Four Approximation Algorithms for the Feedback Vertex Set Problem.

[BibT_eX]

Reinald Schulz

Proceedings of the 7th Conference Graphtheoretic Concepts in Computer Science (WG '81), 1981

Time and Space Bounded Complexity Classes and Bandwidth Constrained Problems (A Survey).

[BibT_eX]

[DOI]

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

On the Complexity of Word Problems in Certain Thue Systems (Preliminary Report).

[BibT_eX]

[DOI]

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

On the LBA Problem.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 1981

1980

Two-Way Multihead Automata Over a One-Letter Alphabet.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1980

Bounding the Bandwidth of NP-Complete Problems.

[BibT_eX]

[DOI]

Proceedings of the Graphtheoretic Concepts in Computer Science, 1980

On a Subclass of Pseudopolynomial Problems.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1980 (MFCS'80), 1980

1979

On Eliminating Nondeterminism From Turing Machines Which Use Less Than Logarithmic Worktape Space.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1979

1977

Corrigenda: Transformational Methods and Their Application to Complexity Problems

[BibT_eX]

[DOI]

Acta Informatica, 1977

The LBA-Problem and the Deterministic Tape Complexity of Two-Way One-Counter Languages over a One-Letter Alphabet.

[BibT_eX]

[DOI]

Acta Informatica, 1977

The LBA-problem and the transormability of the class epsilon2.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 1977

About the Derivation Languages of Grammars and Machines.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1977

1976

A Recursive and a Grammatical Characterization of the Exponential-Time Languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1976

Transformational Methods and their Application to Complexity Problems.

[BibT_eX]

[DOI]

Acta Informatica, 1976

1975

Relationships between Pushdown Automata with Counters and Complexity Classes.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1975

About the deterministic simulation of nondeterministic (log n)-tape bounded Turing machines.

[BibT_eX]

[DOI]

Proceedings of the Automata Theory and Formal Languages, 1975

1974

Beschreibung von Zeitkomplexitätsklassen bei Turingmaschinen durch andere Automatenmodelle.

[BibT_eX]

J. Inf. Process. Cybern., 1974

Characterizations of Time-Bounded Computations by Limited Primitive Recursion.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 2nd Colloquium, University of Saarbrücken, Germany, July 29, 1974

1973

On the simulation of time bounded machines.

[BibT_eX]

[DOI]

Proceedings of the 1. Fachtagung über Automatentheorie und Formale Sprachen, 1973

1972

Relationship between Pushdown Automata and Tape-Bounded Turing Machines.

[BibT_eX]

Proceedings of the Automata, 1972

1970

Über die Konvergenzordnung von Differenzenverfahren, die parabolische Anfangsrandwertaufgaben approximieren.

[BibT_eX]

[DOI]