Monien, B.
Overview
Works:  98 works in 307 publications in 4 languages and 4,076 library holdings 

Genres:  Conference papers and proceedings 
Roles:  Author, Editor, Other, Creator, Honoree 
Classifications:  QA76.88, 004 
Publication Timeline
.
Most widely held works by
B Monien
STACS 86 : 3rd Annual Symposium on Theoretical Aspects of Computer Science, Orsay, France, January 1618, 1986 by
B Monien(
Book
)
24 editions published between 1985 and 2007 in 3 languages and held by 319 WorldCat member libraries worldwide
24 editions published between 1985 and 2007 in 3 languages and held by 319 WorldCat member libraries worldwide
Data structures and efficient algorithms : final report on the DFG special joint initiative by
B Monien(
Book
)
18 editions published in 1992 in English and held by 292 WorldCat member libraries worldwide
"Algorithms are a central concept in computer science. The German Science Foundation (DFG) started a special joint initiative on data structures and efficient algorithms in 1986 with the aim of encouraging collaborative research on algorithms. For a period of five years about a dozen projects were funded with an emphasis on algorithms and data structures for geometric problems, on the one hand, and parallel and distributed algorithms, on the other. This volume contains 18 papers that are intended to give an impression of the achievements of this joint research initiative. The first group of papers addresses research on fundamental data structures, computational geometry, graph algorithms, computer graphics, and spatial databases. The second group of papers centers on the following problems: the design of parallel architectures and routing strategies, simulation of parallel machines, and the design of distributed algorithms for solving difficult problems."PUBLISHER'S WEBSITE
18 editions published in 1992 in English and held by 292 WorldCat member libraries worldwide
"Algorithms are a central concept in computer science. The German Science Foundation (DFG) started a special joint initiative on data structures and efficient algorithms in 1986 with the aim of encouraging collaborative research on algorithms. For a period of five years about a dozen projects were funded with an emphasis on algorithms and data structures for geometric problems, on the one hand, and parallel and distributed algorithms, on the other. This volume contains 18 papers that are intended to give an impression of the achievements of this joint research initiative. The first group of papers addresses research on fundamental data structures, computational geometry, graph algorithms, computer graphics, and spatial databases. The second group of papers centers on the following problems: the design of parallel architectures and routing strategies, simulation of parallel machines, and the design of distributed algorithms for solving difficult problems."PUBLISHER'S WEBSITE
Parallel architectures and their efficient use : First Heinz Nixdorf Symposium, Paderborn, Germany, November 1113, 1992 :
proceedings by
F Meyer(
Book
)
13 editions published in 1993 in English and Italian and held by 285 WorldCat member libraries worldwide
"Research in the field of parallel computer architectures and parallel algorithms has been very successful in recent years, and further progress isto be expected. On the other hand, the question of basic principles of the architecture of universal parallel computers and their realizations is still wide open. The answer to this question must be regarded as mostimportant for the further development of parallel computing and especially for user acceptance. The First Heinz Nixdorf Symposium brought together leading experts in the field of parallel computing and its applications to discuss the state of the art, promising directions of research, and future perspectives. It was the first in a series of Heinz Nixdorf Symposia, intended to cover varying subjects from the research spectrum of the Heinz Nixdorf Institute of the University of Paderborn. This volume presents the proceedings of the symposium, which was held in Paderborn in November 1992. The contributions are grouped into four parts: parallel computation models and simulations, existing parallel machines, communication and programming paradigms, and parallel algorithms."PUBLISHER'S WEBSITE
13 editions published in 1993 in English and Italian and held by 285 WorldCat member libraries worldwide
"Research in the field of parallel computer architectures and parallel algorithms has been very successful in recent years, and further progress isto be expected. On the other hand, the question of basic principles of the architecture of universal parallel computers and their realizations is still wide open. The answer to this question must be regarded as mostimportant for the further development of parallel computing and especially for user acceptance. The First Heinz Nixdorf Symposium brought together leading experts in the field of parallel computing and its applications to discuss the state of the art, promising directions of research, and future perspectives. It was the first in a series of Heinz Nixdorf Symposia, intended to cover varying subjects from the research spectrum of the Heinz Nixdorf Institute of the University of Paderborn. This volume presents the proceedings of the symposium, which was held in Paderborn in November 1992. The contributions are grouped into four parts: parallel computation models and simulations, existing parallel machines, communication and programming paradigms, and parallel algorithms."PUBLISHER'S WEBSITE
STACS 89 : 6th Annual Symposium on Theoretical Aspects of Computer Science, Paderborn, FRG, February 1618, 1989, proceedings by
B Monien(
Book
)
19 editions published between 1989 and 2008 in English and German and held by 269 WorldCat member libraries worldwide
Annotation This volume contains the presentations of the Sixth Symposium on Theoretical Aspects of Computer Science (STACS 89) held at the University of Paderborn, February 1618, 1989. In addition to papers presented in the regular program the volume contains abstracts of software systems demonstrations which were included in this conference series in order to show applications of research results in theoretical computer science. The papers are grouped into the following thematic sections: computational geometry, automata theory and formal languages, semantics of programming languages, parallel algorithms, graph algorithms, complexity, structures, fault tolerance, completeness, distributed computing and concurrency
19 editions published between 1989 and 2008 in English and German and held by 269 WorldCat member libraries worldwide
Annotation This volume contains the presentations of the Sixth Symposium on Theoretical Aspects of Computer Science (STACS 89) held at the University of Paderborn, February 1618, 1989. In addition to papers presented in the regular program the volume contains abstracts of software systems demonstrations which were included in this conference series in order to show applications of research results in theoretical computer science. The papers are grouped into the following thematic sections: computational geometry, automata theory and formal languages, semantics of programming languages, parallel algorithms, graph algorithms, complexity, structures, fault tolerance, completeness, distributed computing and concurrency
Automata, languages and programming : 18th international colloquium, Madrid, Spain, July 812, 1991 : proceedings by
J Leach Albert(
Book
)
22 editions published between 1991 and 1996 in English and Italian and held by 240 WorldCat member libraries worldwide
"This volume contains the proceedings of ICALP '91, the 18th annual summer conference sponsored by the European Association for Theoretical Computer Science (EATCS). ICALP stands for International Colloquium on Automata, Languages, and Programming, and this conference series covers all important areas of theoretical computer science, such as: computability, automata, formal languages, data types and structures, theory of databases and knowledge bases, semantics of programming languages, program specification, transformation and verification, foundations of logic and functional programming, theory of logical design and layout, parallel and distributed computation, theory of concurrency, symbolic and algebraic computation, term rewriting systems, computational geometry, cryptography, and theory of robotics."PUBLISHER'S WEBSITE
22 editions published between 1991 and 1996 in English and Italian and held by 240 WorldCat member libraries worldwide
"This volume contains the proceedings of ICALP '91, the 18th annual summer conference sponsored by the European Association for Theoretical Computer Science (EATCS). ICALP stands for International Colloquium on Automata, Languages, and Programming, and this conference series covers all important areas of theoretical computer science, such as: computability, automata, formal languages, data types and structures, theory of databases and knowledge bases, semantics of programming languages, program specification, transformation and verification, foundations of logic and functional programming, theory of logical design and layout, parallel and distributed computation, theory of concurrency, symbolic and algebraic computation, term rewriting systems, computational geometry, cryptography, and theory of robotics."PUBLISHER'S WEBSITE
EuroPar 2002 parallel processing : 8th International EuroPar Conference, Paderborn, Germany, August 2730, 2002 : proceedings by
B Monien(
Book
)
24 editions published in 2002 in English and held by 239 WorldCat member libraries worldwide
Annotation
24 editions published in 2002 in English and held by 239 WorldCat member libraries worldwide
Annotation
Automata, languages and programming : 23rd international colloquium, ICALP '96, Paderborn, Germany, July 812, 1996 : proceedings by
F Meyer auf der Heide(
Book
)
12 editions published in 1996 in English and held by 226 WorldCat member libraries worldwide
"This volume constitutes the refereed proceedings of the 23rd International Colloquium on Automata, Languages and Programming (ICALP '96), held at Paderborn, Germany, in July 1996. ICALP is an annual conference sponsored by the European Association on Theoretical Computer Science (EATCS). The proceedings contain 52 refereed papers selected from 172 submissions and 4 invited papers. The papers cover the whole range of theoretical computer science; they are organized in sections on: Process Theory; Fairness, Domination, and the uCalculus; Logic and Algebra; Languages and Processes; Algebraic Complexity; Graph Algorithms; Automata; Complexity Theory; Combinatorics on Words; Algorithms; Lower Bounds; Data Structures ..."PUBLISHER'S WEBSITE
12 editions published in 1996 in English and held by 226 WorldCat member libraries worldwide
"This volume constitutes the refereed proceedings of the 23rd International Colloquium on Automata, Languages and Programming (ICALP '96), held at Paderborn, Germany, in July 1996. ICALP is an annual conference sponsored by the European Association on Theoretical Computer Science (EATCS). The proceedings contain 52 refereed papers selected from 172 submissions and 4 invited papers. The papers cover the whole range of theoretical computer science; they are organized in sections on: Process Theory; Fairness, Domination, and the uCalculus; Logic and Algebra; Languages and Processes; Algebraic Complexity; Graph Algorithms; Automata; Complexity Theory; Combinatorics on Words; Algorithms; Lower Bounds; Data Structures ..."PUBLISHER'S WEBSITE
High performance computing  HiPC 2000 : 7th International Conference, Bangalore, India, December 1720, 2000 : proceedings by
B Monien(
Book
)
26 editions published in 2001 in English and held by 218 WorldCat member libraries worldwide
This book constitutes the refereed proceedings of the 11th International Conference on HighPerformance Computing, HiPC 2004, held in Bangalore, India in December 2004. The 48 revised full papers presented were carefully reviewed and selected from 253 submissions. The papers are organized in topical sections on wireless network management, compilers and runtime systems, high performance scientific applications, peertopeer and storage systems, high performance processors and routers, grids and storage systems, energyaware and highperformance networking, and distributed algorithms
26 editions published in 2001 in English and held by 218 WorldCat member libraries worldwide
This book constitutes the refereed proceedings of the 11th International Conference on HighPerformance Computing, HiPC 2004, held in Bangalore, India in December 2004. The 48 revised full papers presented were carefully reviewed and selected from 253 submissions. The papers are organized in topical sections on wireless network management, compilers and runtime systems, high performance scientific applications, peertopeer and storage systems, high performance processors and routers, grids and storage systems, energyaware and highperformance networking, and distributed algorithms
Algorithmic game theory : first international symposium, SAGT 2008, Paderborn, Germany, April 30  May 2, 2008 : proceedings by
B Monien(
Book
)
16 editions published in 2008 in English and held by 85 WorldCat member libraries worldwide
This book constitutes the refereed proceedings of the First International Symposium on Algorithmic Game Theory, SAGT 2008, held in Paderborn, Germany, in April/May 2008. The 28 revised full papes presented together with 3 invited lectures were carefully reviewed and selected from 60 submissions. The papers are organized in topical sections on routing and scheduling, markets, mechanism design, potpourri of games, solution concepts, and cost sharing
16 editions published in 2008 in English and held by 85 WorldCat member libraries worldwide
This book constitutes the refereed proceedings of the First International Symposium on Algorithmic Game Theory, SAGT 2008, held in Paderborn, Germany, in April/May 2008. The 28 revised full papes presented together with 3 invited lectures were carefully reviewed and selected from 60 submissions. The papers are organized in topical sections on routing and scheduling, markets, mechanism design, potpourri of games, solution concepts, and cost sharing
Proceedings, International Symposium on Parallel Architectures, Algorithms and Networks : ISPAN 2000 : December 79, 2000,
Dallas/Richardson, Texas, USA by
Algorithms, and Networks (5, 2000, Dallas, Tex. ; Richardson, Tex.) International Symposium on Parallel Architectures(
Book
)
6 editions published between 2000 and 2001 in English and held by 52 WorldCat member libraries worldwide
6 editions published between 2000 and 2001 in English and held by 52 WorldCat member libraries worldwide
Multiscale phenomenon and their simulation : proceedings of the international conference, Bielefeld, Germany, 30 September4
October, 1996(
Book
)
1 edition published in 1997 in English and held by 42 WorldCat member libraries worldwide
1 edition published in 1997 in English and held by 42 WorldCat member libraries worldwide
Einführung in parallele Algorithmen und Architekturen : Gitter, Bäume und Hypercubes by
Frank Thomson Leighton(
Book
)
1 edition published in 1997 in German and held by 34 WorldCat member libraries worldwide
1 edition published in 1997 in German and held by 34 WorldCat member libraries worldwide
Entwicklungssätze bei Operatorenbüscheln by
B Monien(
Book
)
9 editions published between 1968 and 1969 in German and held by 30 WorldCat member libraries worldwide
9 editions published between 1968 and 1969 in German and held by 30 WorldCat member libraries worldwide
Data structures and efficient algorithms Final Report on the DFG Special Joint Initiative by
B Monien(
)
1 edition published in 1992 in English and held by 29 WorldCat member libraries worldwide
1 edition published in 1992 in English and held by 29 WorldCat member libraries worldwide
STACS 89 6th Annual Symposium on Theoretical Aspects of Computer Science, Paderborn, FRG, Febr. 1989 ; proceedings by STACS(
)
1 edition published in 1989 in English and held by 19 WorldCat member libraries worldwide
1 edition published in 1989 in English and held by 19 WorldCat member libraries worldwide
On the hardness of computing local optima Über die Schwierigkeit der Berechnung Lokaler Optima by
Dominic Dumrauf(
)
2 editions published in 2011 in English and held by 16 WorldCat member libraries worldwide
In dieser Arbeit untersuchen wir die Komplexität der Berechnung lokal optimaler Lösungen von Problemen aus den Bereichen der Spieltheorie und der Optimierung. Für unsere Untersuchungen verwenden wir das Framework PLS (Abkürzung für "Polynomialzeit lokale Suche"), wie von Johnson, Papadimtriou und Yannakakis eingeführt. In der Spieltheorie sind Congestion Games ein weit verbreitetes und akzeptiertes Modell um das Verhalten und die Performanz von großen verteilten Netzwerken mit autonomen Teilnehmern zu untersuchen. Die Klasse der Restricted Network Congestion Games ist eine Teilklasse der Congestion Games bei der für jeden Spieler eine Menge von Kanten existiert, die er nicht verwenden darf. In Kapitel 5 zeigen wir mittels einer tighten Reduktion von MAXCUT, dass die Berechnung eines Nash Equilibriums in einem Restricted Network Congestion Game mit zwei Spielern PLSvollständig ist. Aus dem Bereich der Optimierung untersuchen wir die Komplexität der Berechnung lokal optimaler Lösungen des MAXIMUM CONSTRAINT ASSIGNMENT (abgekürzt MCA) Problems und von gewichteten StandardMengenproblemen. Die Parameter in (p,q,r)MCA_{kpar} beschränken hierbei simultan die maximale Länge p jedes Constraints, das maximale Auftreten q jeder Variable und deren Wertigkeit r; zusätzlich ist die Menge der Constraints kpartit. Wir konzentrieren uns auf Härteergebnisse und zeigen in Kapitel 6 mittels tighter Reduktionen von CIRCUIT/FLIP die PLSVollständigkeit von (3,2,3)MCA_{3par}, (2,3,6)MCA_{2par} und (6,2,2)MCA. Abschließend untersuchen wir in Kapitel 7 die Komplexität der Berechnung lokal optimaler Lösungen von gewichteten StandardMengenproblemen wie SETPACKING, SETCOVER und vieler anderer Probleme, wie sie in [SP1][SP10] im Buch von Garey und Johnson [Seite 221ff.] zusammengefasst sind..  In this thesis, we investigate the complexity of computing locally optimal solutions of problems arising in the fields of game theory and optimization. For our investigation, we use the framework of PLS (short for "Polynomialtime Local Search"), as introduced by Johnson, Papadimtriou, and Yannakakis. In game theory, congestion games are a widely accepted model to investigate the behavior and performance of largescale distributed networks with autonomous participants. The class of restricted network congestion games is a subclass of congestion games where for each player there exists a set of edges which he is not allowed to use. In Chapter 5, we show that computing a Nash equilibrium in a restricted network congestion game with two players is PLScomplete, using a tight reduction from MAXCUT. From the field of optimization, we investigate the complexity of computing locally optimal solutions of the MAXIMUM CONSTRAINT ASSIGNMENT (in short MCA) problem and of weighted standard set problems. The parameters in (p,q,r)MCA_{kpar} simultaneously limit the maximum length p of each constraint, the maximum appearance q of each variable and its valence r; additionally, the set of constraints is kpartite. We focus on hardness results and show PLScompleteness of (3,2,3)MCA_{3par}, (2,3,6)MCA_{2par} and (6,2,2)MCA, using tight reductions from CIRCUIT/FLIP in Chapter 6. Finally, in Chapter 7 we study the complexity of computing locally optimal solutions of weighted standard set problems such as SETPACKING, SETCOVER, and many more, as pooled in problems [SP1][SP10] in the book of Garey and Johnson [page 221ff.]
2 editions published in 2011 in English and held by 16 WorldCat member libraries worldwide
In dieser Arbeit untersuchen wir die Komplexität der Berechnung lokal optimaler Lösungen von Problemen aus den Bereichen der Spieltheorie und der Optimierung. Für unsere Untersuchungen verwenden wir das Framework PLS (Abkürzung für "Polynomialzeit lokale Suche"), wie von Johnson, Papadimtriou und Yannakakis eingeführt. In der Spieltheorie sind Congestion Games ein weit verbreitetes und akzeptiertes Modell um das Verhalten und die Performanz von großen verteilten Netzwerken mit autonomen Teilnehmern zu untersuchen. Die Klasse der Restricted Network Congestion Games ist eine Teilklasse der Congestion Games bei der für jeden Spieler eine Menge von Kanten existiert, die er nicht verwenden darf. In Kapitel 5 zeigen wir mittels einer tighten Reduktion von MAXCUT, dass die Berechnung eines Nash Equilibriums in einem Restricted Network Congestion Game mit zwei Spielern PLSvollständig ist. Aus dem Bereich der Optimierung untersuchen wir die Komplexität der Berechnung lokal optimaler Lösungen des MAXIMUM CONSTRAINT ASSIGNMENT (abgekürzt MCA) Problems und von gewichteten StandardMengenproblemen. Die Parameter in (p,q,r)MCA_{kpar} beschränken hierbei simultan die maximale Länge p jedes Constraints, das maximale Auftreten q jeder Variable und deren Wertigkeit r; zusätzlich ist die Menge der Constraints kpartit. Wir konzentrieren uns auf Härteergebnisse und zeigen in Kapitel 6 mittels tighter Reduktionen von CIRCUIT/FLIP die PLSVollständigkeit von (3,2,3)MCA_{3par}, (2,3,6)MCA_{2par} und (6,2,2)MCA. Abschließend untersuchen wir in Kapitel 7 die Komplexität der Berechnung lokal optimaler Lösungen von gewichteten StandardMengenproblemen wie SETPACKING, SETCOVER und vieler anderer Probleme, wie sie in [SP1][SP10] im Buch von Garey und Johnson [Seite 221ff.] zusammengefasst sind..  In this thesis, we investigate the complexity of computing locally optimal solutions of problems arising in the fields of game theory and optimization. For our investigation, we use the framework of PLS (short for "Polynomialtime Local Search"), as introduced by Johnson, Papadimtriou, and Yannakakis. In game theory, congestion games are a widely accepted model to investigate the behavior and performance of largescale distributed networks with autonomous participants. The class of restricted network congestion games is a subclass of congestion games where for each player there exists a set of edges which he is not allowed to use. In Chapter 5, we show that computing a Nash equilibrium in a restricted network congestion game with two players is PLScomplete, using a tight reduction from MAXCUT. From the field of optimization, we investigate the complexity of computing locally optimal solutions of the MAXIMUM CONSTRAINT ASSIGNMENT (in short MCA) problem and of weighted standard set problems. The parameters in (p,q,r)MCA_{kpar} simultaneously limit the maximum length p of each constraint, the maximum appearance q of each variable and its valence r; additionally, the set of constraints is kpartite. We focus on hardness results and show PLScompleteness of (3,2,3)MCA_{3par}, (2,3,6)MCA_{2par} and (6,2,2)MCA, using tight reductions from CIRCUIT/FLIP in Chapter 6. Finally, in Chapter 7 we study the complexity of computing locally optimal solutions of weighted standard set problems such as SETPACKING, SETCOVER, and many more, as pooled in problems [SP1][SP10] in the book of Garey and Johnson [page 221ff.]
The complexity of local maxcut by
Tobias Tscheuschner(
)
1 edition published in 2012 in German and held by 16 WorldCat member libraries worldwide
1 edition published in 2012 in German and held by 16 WorldCat member libraries worldwide
The price of anarchy for polynomial social cost(
)
1 edition published in 2005 in English and held by 15 WorldCat member libraries worldwide
1 edition published in 2005 in English and held by 15 WorldCat member libraries worldwide
STACS 89 : 6th Annual Symposium on Theoretical Aspects of Computer Science, Paderborn, FRG, Febr. 1989 : proceedings by
1989, Paderborn) STACS (6(
Book
)
1 edition published in 1989 in English and held by 14 WorldCat member libraries worldwide
1 edition published in 1989 in English and held by 14 WorldCat member libraries worldwide
STACS 89 proceedings by Symposium on Theoretical Aspects of Computer Science(
Book
)
3 editions published in 1989 in English and held by 13 WorldCat member libraries worldwide
3 editions published in 1989 in English and held by 13 WorldCat member libraries worldwide
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Meyer auf der Heide, F. (Friedhelm) 1954 Other Author Editor
 Schroeder, UlfPeter
 Gesellschaft für Informatik Organizer of meeting
 European Association for Theoretical Computer Science Publisher
 Ottmann, Thomas Editor
 Rosenberg, Arnold L. 1941 Editor
 Cori, Robert Author Editor
 VidalNaquet, G. Editor
 Rodríquez Artalejo, M. (Mario) Editor
 Leach Albert, J. Author Editor
Useful Links
Associated Subjects
Algorithms Artificial intelligence Combinatorial analysis Computational complexity Computer algorithms Computer architecture Computer graphics Computer network architectures Computer networks Computer programming Computers Computer science Computer scienceMathematics Computer software Database management Data structures (Computer science) Electronic commerce Electronic data processing Formal languages Game theory GeometryData processing High performance computing Hilbert space HydrodynamicsComputer simulation Information storage and retrieval systems Information theory Logic design Machine theory MacromoleculesComputer simulation Microprogramming Numerical analysis Parallel computers Parallel processing (Electronic computers) Particles (Nuclear physics)Computer simulation Programming languages (Electronic computers) Software engineering