The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Burkhard Monien: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Rainer Feldmann, Burkhard Monien, Stefan Schamberger
    A Distributed Algorithm to Evaluate Quantified Boolean Formulae. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, 2000, pp:285-290 [Conf]
  2. Burkhard Monien
    On the simulation of time bounded machines. [Citation Graph (0, 0)][DBLP]
    Automatentheorie und Formale Sprachen, 1973, pp:239-248 [Conf]
  3. Burkhard Monien
    About the deterministic simulation of nondeterministic (log n)-tape bounded Turing machines. [Citation Graph (0, 0)][DBLP]
    Automata Theory and Formal Languages, 1975, pp:118-126 [Conf]
  4. Burkhard Monien, Ivan Hal Sudborough
    Simulating Binary Trees on Hypercubes. [Citation Graph (0, 0)][DBLP]
    AWOC, 1988, pp:170-180 [Conf]
  5. Torsten Fahle, Rainer Feldmann, Silvia Götz, Sven Grothklags, Burkhard Monien
    The Aircraft Sequencing Problem. [Citation Graph (0, 0)][DBLP]
    Computer Science in Perspective, 2003, pp:152-166 [Conf]
  6. Burkhard Monien, Petra Berenbrink, Reinhard Lüling, Marco Riedel
    Online Scheduling of Continuous Media Streams. [Citation Graph (0, 0)][DBLP]
    Foundations of Computer Science: Potential - Theory - Cognition, 1997, pp:313-320 [Conf]
  7. Burkhard Monien, Ewald Speckenmeyer
    Some Further Approximation Algorithms for the Vertex Cover Problem. [Citation Graph (0, 0)][DBLP]
    CAAP, 1983, pp:341-349 [Conf]
  8. Yvonne Bleischwitz, Burkhard Monien
    Fair Cost-Sharing Methods for Scheduling Jobs on Parallel Machines. [Citation Graph (0, 0)][DBLP]
    CIAC, 2006, pp:175-186 [Conf]
  9. Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien
    The Price of Anarchy for Polynomial Social Cost. [Citation Graph (0, 0)][DBLP]
    Computing and Markets, 2005, pp:- [Conf]
  10. Christian Haubelt, Jürgen Teich, Rainer Feldmann, Burkhard Monien
    SAT-Based Techniques in System Synthesis. [Citation Graph (0, 0)][DBLP]
    DATE, 2003, pp:11168-11169 [Conf]
  11. Rainer Feldmann, Peter Mysliwietz, Burkhard Monien
    Distributed Game Tree Search on a Massively Parallel System. [Citation Graph (0, 0)][DBLP]
    Data Structures and Efficient Algorithms, 1992, pp:270-288 [Conf]
  12. Alois Knoll, Christian Altenschmidt, Joachim Biskup, Hans-Martin Blüthgen, Ingo Glöckner, Sven Hartrumpf, Hermann Helbig, Christiane Henning, Reinhard Lüling, Burkhard Monien, Thomas Noll, Norbert Sensen
    An Integrated Approach to Semantic Evaluation and Content-Based Retrieval of Multimedia Documents. [Citation Graph (0, 0)][DBLP]
    ECDL, 1998, pp:409-428 [Conf]
  13. Ralf Diekmann, Andreas Frommer, Burkhard Monien
    Nearest Neighbor Load Balancing on Graphs. [Citation Graph (0, 0)][DBLP]
    ESA, 1998, pp:429-440 [Conf]
  14. Robert Elsässer, Burkhard Monien, Stefan Schamberger
    Load Balancing of Indivisible Unit Size Tokens in Dynamic and Heterogeneous Networks. [Citation Graph (0, 0)][DBLP]
    ESA, 2004, pp:640-651 [Conf]
  15. Thomas Decker, Burkhard Monien, Robert Preis
    Towards Optimal Load Balancing Topologies. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2000, pp:277-287 [Conf]
  16. Robert Elsässer, Andreas Frommer, Burkhard Monien, Robert Preis
    Optimal and Alternating-Direction Load Balancing Schemes. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 1999, pp:280-290 [Conf]
  17. Burkhard Monien
    On the LBA Problem. [Citation Graph (0, 0)][DBLP]
    FCT, 1981, pp:265-280 [Conf]
  18. Burkhard Monien
    The complexity of embedding graphs into binary trees. [Citation Graph (0, 0)][DBLP]
    FCT, 1985, pp:300-309 [Conf]
  19. Rainer Feldmann, Christian Haubelt, Burkhard Monien, Jürgen Teich
    Fault Tolerances Analysis of Distributed Reconfigurable Systems Using SAT-Based Techniques. [Citation Graph (0, 0)][DBLP]
    FPL, 2003, pp:478-487 [Conf]
  20. Burkhard Monien, Friedhelm Ramme, Helmut Salmen
    A Parallel Simulated Annealing Algorithm for Generating 3D Layouts of Undirected Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1995, pp:396-408 [Conf]
  21. Ralf Diekmann, Reinhard Lüling, Burkhard Monien, Carsten Spraner
    A parallel local-search algorithm for the k-partitioning problem. [Citation Graph (0, 0)][DBLP]
    HICSS (2), 1995, pp:41-50 [Conf]
  22. Rainer Feldmann, Martin Gairing, Thomas Lücking, Burkhard Monien, Manuel Rode
    Nashification and the Coordination Ratio for a Selfish Routing Game. [Citation Graph (0, 0)][DBLP]
    ICALP, 2003, pp:514-526 [Conf]
  23. Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode
    Nash Equilibria in Discrete Routing Games with Convex Latency Functions. [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:645-657 [Conf]
  24. Martin Gairing, Thomas Lücking, Burkhard Monien, Karsten Tiemann
    Nash Equilibria, the Price of Anarchy and the Fully Mixed Nash Equilibrium Conjecture. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:51-65 [Conf]
  25. Martin Gairing, Burkhard Monien, Karsten Tiemann
    Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functions. [Citation Graph (0, 0)][DBLP]
    ICALP (1), 2006, pp:501-512 [Conf]
  26. Martin Gairing, Burkhard Monien, Andreas Woclaw
    A Faster Combinatorial Approximation Algorithm for Scheduling Unrelated Parallel Machines. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:828-839 [Conf]
  27. Burkhard Monien
    Relationship between Pushdown Automata and Tape-Bounded Turing Machines. [Citation Graph (0, 0)][DBLP]
    ICALP, 1972, pp:575-583 [Conf]
  28. Burkhard Monien
    Characterizations of Time-Bounded Computations by Limited Primitive Recursion. [Citation Graph (0, 0)][DBLP]
    ICALP, 1974, pp:280-293 [Conf]
  29. Burkhard Monien
    About the Derivation Languages of Grammars and Machines. [Citation Graph (0, 0)][DBLP]
    ICALP, 1977, pp:337-351 [Conf]
  30. Burkhard Monien, Ivan Hal Sudborough
    On Eliminating Nondeterminism From Turing Machines Which Use Less Than Logarithmic Worktape Space. [Citation Graph (0, 0)][DBLP]
    ICALP, 1979, pp:431-445 [Conf]
  31. Burkhard Monien, Ivan Hal Sudborough
    Min Cut is NP-Complete for Edge Weigthed Trees. [Citation Graph (0, 0)][DBLP]
    ICALP, 1986, pp:265-274 [Conf]
  32. Ewald Speckenmeyer, Burkhard Monien, Oliver Vornberger
    Superlinear Speedup for Parallel Backtracking. [Citation Graph (0, 0)][DBLP]
    ICS, 1987, pp:985-993 [Conf]
  33. Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Paul G. Spirakis
    Extreme Nash Equilibria. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2003, pp:1-20 [Conf]
  34. Robert Elsässer, Burkhard Monien, Günter Rote, Stefan Schamberger
    Toward Optimal Diffusion Matrices. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2002, pp:- [Conf]
  35. Reinhard Lüling, Burkhard Monien
    Load Balancing for Distributed Branch and Bound Algorithms. [Citation Graph (0, 0)][DBLP]
    IPPS, 1992, pp:543-548 [Conf]
  36. Stefan Tschöke, Reinhard Lüling, Burkhard Monien
    Solving the traveling salesman problem with a distributed branch-and-bound algorithm on a 1024 processor network. [Citation Graph (0, 0)][DBLP]
    IPPS, 1995, pp:182-189 [Conf]
  37. Cheng-Zhong Xu, Burkhard Monien, Reinhard Lüling, Francis C. M. Lau
    An analytical comparison of nearest neighbor algorithms for load balancing in parallel computers. [Citation Graph (0, 0)][DBLP]
    IPPS, 1995, pp:472-479 [Conf]
  38. Henning Meyerhenke, Burkhard Monien, Stefan Schamberger
    Accelerating shape optimizing load balancing for parallel FEM simulations by algebraic multigrid. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2006, pp:- [Conf]
  39. Burkhard Monien, Jürgen Schulze
    Parallel Sparse Cholesky Factorization. [Citation Graph (0, 0)][DBLP]
    IRREGULAR, 1997, pp:255-272 [Conf]
  40. Ralf Diekmann, Derk Meyer, Burkhard Monien
    Parallel Decomposition of Unstructured FEM-Meshes. [Citation Graph (0, 0)][DBLP]
    IRREGULAR, 1995, pp:199-215 [Conf]
  41. Robert Elsässer, Burkhard Monien, Stefan Schamberger
    Load Balancing in Dynamic Networks. [Citation Graph (0, 0)][DBLP]
    ISPAN, 2004, pp:193-200 [Conf]
  42. Ronald V. Book, Matthias Jantzen, Burkhard Monien, Colm Ó'Dúnlaing, Celia Wrathall
    On the Complexity of Word Problems in Certain Thue Systems (Preliminary Report). [Citation Graph (0, 0)][DBLP]
    MFCS, 1981, pp:216-223 [Conf]
  43. Rainer Feldmann, Martin Gairing, Thomas Lücking, Burkhard Monien, Manuel Rode
    Selfish Routing in Non-cooperative Networks: A Survey. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:21-45 [Conf]
  44. Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien
    The Price of Anarchy for Polynomial Social Cost. [Citation Graph (0, 0)][DBLP]
    MFCS, 2004, pp:574-585 [Conf]
  45. Juraj Hromkovic, Claus-Dieter Jeschke, Burkhard Monien
    Optimal Algorithms for Dissemination of Information in Some Interconnection Networks (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    MFCS, 1990, pp:337-346 [Conf]
  46. Juraj Hromkovic, Burkhard Monien
    The Bisection Problem for Graphs of Degree 4 (Configuring Transputer Systems). [Citation Graph (0, 0)][DBLP]
    MFCS, 1991, pp:211-220 [Conf]
  47. Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode, Paul G. Spirakis, Imrich Vrto
    Which Is the Worst-Case Nash Equilibrium? [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:551-561 [Conf]
  48. Thomas Lücking, Burkhard Monien, Manuel Rode
    On the Problem of Scheduling Flows on Distributed Networks. [Citation Graph (0, 0)][DBLP]
    MFCS, 2002, pp:495-505 [Conf]
  49. Burkhard Monien
    On a Subclass of Pseudopolynomial Problems. [Citation Graph (0, 0)][DBLP]
    MFCS, 1980, pp:414-425 [Conf]
  50. Burkhard Monien, Ralf Diekmann, Reinhard Lüling
    Communication Throughput of Interconnection Networks. [Citation Graph (0, 0)][DBLP]
    MFCS, 1994, pp:72-86 [Conf]
  51. Burkhard Monien, Robert Preis
    Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs. [Citation Graph (0, 0)][DBLP]
    MFCS, 2001, pp:524-536 [Conf]
  52. Burkhard Monien, Ivan Hal Sudborough
    Time and Space Bounded Complexity Classes and Bandwidth Constrained Problems (A Survey). [Citation Graph (0, 0)][DBLP]
    MFCS, 1981, pp:78-93 [Conf]
  53. Burkhard Monien, Ivan Hal Sudborough
    Comparing Interconnection Networks. [Citation Graph (0, 0)][DBLP]
    MFCS, 1988, pp:138-153 [Conf]
  54. Burkhard Monien, Reinhard Lüling, Falk Langhammer
    A Realizable Efficient Parallel Architecture. [Citation Graph (0, 0)][DBLP]
    Heinz Nixdorf Symposium, 1992, pp:93-109 [Conf]
  55. Burkhard Monien, Oliver Vornberger
    Parallel Processing of Combinatorial Search. [Citation Graph (0, 0)][DBLP]
    Parallel Algorithms and Architectures, 1987, pp:60-69 [Conf]
  56. Rainer Feldmann, Juraj Hromkovic, S. Madhavapeddy, Burkhard Monien, Peter Mysliwietz
    Optimal Algorithms for Disemination of Information in Generalized Communication Modes. [Citation Graph (0, 0)][DBLP]
    PARLE, 1992, pp:115-130 [Conf]
  57. Burkhard Monien, Ralf Diekmann
    A Local Graph Partitioning Heuristic Meeting Bisection Bounds. [Citation Graph (0, 0)][DBLP]
    PPSC, 1997, pp:- [Conf]
  58. Burkhard Monien, Stefan Schamberger
    Graph Partitioning with the Party Library: Helpful-Sets in Practice. [Citation Graph (0, 0)][DBLP]
    SBAC-PAD, 2004, pp:198-205 [Conf]
  59. Reinhard Lüling, Burkhard Monien, Alexander Reinefeld, Stefan Tschöke
    Mapping tree-structured combinatorial optimization problems onto parallel computers. [Citation Graph (0, 0)][DBLP]
    Solving Combinatorial Optimization Problems in Parallel, 1996, pp:115-144 [Conf]
  60. Burkhard Monien
    Selfish Routing in Networks. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 2006, pp:61-62 [Conf]
  61. Robert Elsässer, Burkhard Monien
    Load balancing of unit size tokens and expansion properties of graphs. [Citation Graph (0, 0)][DBLP]
    SPAA, 2003, pp:266-273 [Conf]
  62. Robert Elsässer, Thomas Lücking, Burkhard Monien
    New spectral bounds on k-partitioning of graphs. [Citation Graph (0, 0)][DBLP]
    SPAA, 2001, pp:255-262 [Conf]
  63. Robert Elsässer, Burkhard Monien, Robert Preis
    Diffusive load balancing schemes on heterogeneous networks. [Citation Graph (0, 0)][DBLP]
    SPAA, 2000, pp:30-38 [Conf]
  64. Shimon Even, Burkhard Monien
    On the Number of Rounds Necessary to Disseminate Information. [Citation Graph (0, 0)][DBLP]
    SPAA, 1989, pp:318-327 [Conf]
  65. Rainer Feldmann, Peter Mysliwietz, Burkhard Monien
    Studying Overheads in Massively Parallel MIN/MAX-Tree Evaluation. [Citation Graph (0, 0)][DBLP]
    SPAA, 1994, pp:94-103 [Conf]
  66. Martin Gairing, Burkhard Monien, Karsten Tiemann
    Selfish routing with incomplete information. [Citation Graph (0, 0)][DBLP]
    SPAA, 2005, pp:203-212 [Conf]
  67. Reinhard Lüling, Burkhard Monien
    A Dynamic Distributed Load Balancing Algorithm with Provable Good Performance. [Citation Graph (0, 0)][DBLP]
    SPAA, 1993, pp:164-172 [Conf]
  68. Burkhard Monien
    Simulating Binary Trees on X-Trees (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SPAA, 1991, pp:147-158 [Conf]
  69. Ralf Rehrmann, Burkhard Monien, Reinhard Lüling, Ralf Diekmann
    On the Communication Throughput of Buffered Multistage Interconnection Networks. [Citation Graph (0, 0)][DBLP]
    SPAA, 1996, pp:152-161 [Conf]
  70. Ralf Klasing, Reinhard Lüling, Burkhard Monien
    Compressing cube-connected cycles and butterfly networks. [Citation Graph (0, 0)][DBLP]
    SPDP, 1990, pp:858-865 [Conf]
  71. James Haralambides, Fillia Makedon, Burkhard Monien
    Approximation algorithms for the bandwidth minimization problem for caterpillar graphs. [Citation Graph (0, 0)][DBLP]
    SPDP, 1990, pp:301-307 [Conf]
  72. Sebastian Aland, Dominic Dumrauf, Martin Gairing, Burkhard Monien, Florian Schoppmann
    Exact Price of Anarchy for Polynomial Congestion Games. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:218-229 [Conf]
  73. Michal Chytil, Burkhard Monien
    Caterpillars and Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    STACS, 1990, pp:70-81 [Conf]
  74. Robert Elsässer, Rastislav Kralovic, Burkhard Monien
    Scalable Sparse Topologies with Small Spectrum. [Citation Graph (0, 0)][DBLP]
    STACS, 2001, pp:218-229 [Conf]
  75. Rainer Feldmann, Burkhard Monien, Peter Mysliwietz, Stefan Tschöke
    A Better Upper Bound on the Bisection Width of de Bruijn Networks (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:511-522 [Conf]
  76. Ralf Klasing, Burkhard Monien, Regine Peine, Elena Stöhr
    Broadcasting in Butterfly and DeBruijn Networks. [Citation Graph (0, 0)][DBLP]
    STACS, 1992, pp:351-362 [Conf]
  77. Joseph Y.-T. Leung, Burkhard Monien
    On the Complexity of Deadlock Recovery. [Citation Graph (0, 0)][DBLP]
    STACS, 1985, pp:208-218 [Conf]
  78. Ulf Lorenz, Burkhard Monien
    The Secret of Selective Game Tree Search, When Using Random-Error Evaluations. [Citation Graph (0, 0)][DBLP]
    STACS, 2002, pp:203-214 [Conf]
  79. Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode
    A New Model for Selfish Routing. [Citation Graph (0, 0)][DBLP]
    STACS, 2004, pp:547-558 [Conf]
  80. Burkhard Monien, Rainer Feldmann, Ralf Klasing, Reinhard Lüling
    Parallel Architectures: Design and Efficient Use. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:247-269 [Conf]
  81. Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien
    Computing Nash equilibria for scheduling on restricted parallel links. [Citation Graph (0, 0)][DBLP]
    STOC, 2004, pp:613-622 [Conf]
  82. Burkhard Monien, Ivan Hal Sudborough
    Bandwidth Constrained NP-Complete Problems [Citation Graph (0, 0)][DBLP]
    STOC, 1981, pp:207-217 [Conf]
  83. Burkhard Monien, Reinhard Lüling
    Mapping und Lastverteilung in parallelen Systemen. [Citation Graph (0, 0)][DBLP]
    Transputer-Anwender-Treffen, 1992, pp:1-10 [Conf]
  84. Ralf Diekmann, Reinhard Lüling, Burkhard Monien, Jens Simon
    Implementierung von Simulated Annealing auf Transputer-Systemen. [Citation Graph (0, 0)][DBLP]
    Transputer-Anwender-Treffen, 1991, pp:361-368 [Conf]
  85. Burkhard Monien
    The LBA-problem and the transormability of the class epsilon2. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1977, pp:339-350 [Conf]
  86. Thomas Decker, Thomas Lücking, Burkhard Monien
    A 5/4-Approximation Algorithm for Scheduling Identical Malleable Tasks. [Citation Graph (0, 0)][DBLP]
    WAOA, 2003, pp:95-108 [Conf]
  87. Berthold Kröger, Reinhard Lüling, Burkhard Monien, Oliver Vornberger
    An Improved Algorithm to Detect Communication Deadlocks in Distributed Systems. [Citation Graph (0, 0)][DBLP]
    WDAG, 1990, pp:90-101 [Conf]
  88. Reinhard Lüling, Burkhard Monien
    Two Strategies for Solving the Vertex Cover Problem on a Transputer Network. [Citation Graph (0, 0)][DBLP]
    WDAG, 1989, pp:160-170 [Conf]
  89. Burkhard Monien, Andreas Woclaw
    Scheduling Unrelated Parallel Machines Computational Results. [Citation Graph (0, 0)][DBLP]
    WEA, 2006, pp:195-206 [Conf]
  90. Sergei L. Bezrukov, Robert Elsässer, Burkhard Monien, Robert Preis, Jean-Pierre Tillich
    New Spectral Lower Bounds on the Bisection Width of Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2000, pp:23-34 [Conf]
  91. Ralf Heckmann, Ralf Klasing, Burkhard Monien, Walter Unger
    Optimal Embedding of Complete Binary Trees into Lines and Grids. [Citation Graph (0, 0)][DBLP]
    WG, 1991, pp:25-35 [Conf]
  92. Knuth Menzel, Burkhard Monien
    WEighted Parallel Triangulation of Simple Polygons. [Citation Graph (0, 0)][DBLP]
    WG, 1989, pp:302-315 [Conf]
  93. Burkhard Monien
    Bounding the Bandwidth of NP-Complete Problems. [Citation Graph (0, 0)][DBLP]
    WG, 1980, pp:279-292 [Conf]
  94. Manfred Wiegers, Burkhard Monien
    Bandwidth and Profile Minimization. [Citation Graph (0, 0)][DBLP]
    WG, 1988, pp:378-393 [Conf]
  95. Vladimir Mazalov, Burkhard Monien, Florian Schoppmann, Karsten Tiemann
    Wardrop Equilibria and Price of Stability for Bottleneck Games with Splittable Traffic. [Citation Graph (0, 0)][DBLP]
    WINE, 2006, pp:331-342 [Conf]
  96. Robert Elsässer, Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien
    A Simple Graph-Theoretic Model for Selfish Restricted Scheduling. [Citation Graph (0, 0)][DBLP]
    WINE, 2005, pp:195-209 [Conf]
  97. Burkhard Monien
    Transformational Methods and their Application to Complexity Problems. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1976, v:6, n:, pp:95-108 [Journal]
  98. Burkhard Monien
    The LBA-Problem and the Deterministic Tape Complexity of Two-Way One-Counter Languages over a One-Letter Alphabet [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1977, v:8, n:, pp:371-382 [Journal]
  99. Burkhard Monien
    Corrigenda: Transformational Methods and Their Application to Complexity Problems [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1977, v:8, n:, pp:383-384 [Journal]
  100. Burkhard Monien, Ewald Speckenmeyer
    Ramsey Numbers and an Approximation Algorithm for the Vertex Cover Problem. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1985, v:22, n:1, pp:115-123 [Journal]
  101. Juraj Hromkovic, Claus-Dieter Jeschke, Burkhard Monien
    Optimal Algorithms for Dissemination of Information in Some Interconnection Networks. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1993, v:10, n:1, pp:24-40 [Journal]
  102. Ralf Diekmann, Derk Meyer, Burkhard Monien
    Parallel Decomposition of Unstructured FEM-Meshes. [Citation Graph (0, 0)][DBLP]
    Concurrency - Practice and Experience, 1998, v:10, n:1, pp:53-72 [Journal]
  103. Sergei L. Bezrukov, Burkhard Monien, Walter Unger, Gerd Wechsung
    Embedding ladders and caterpillars into the hypercube. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:83, n:1-3, pp:21-29 [Journal]
  104. Rainer Feldmann, Juraj Hromkovic, S. Madhavapeddy, Burkhard Monien, Peter Mysliwietz
    Optimal algorithms for dissemination of information in generalized communication modes. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:53, n:1-3, pp:55-78 [Journal]
  105. Ralf Klasing, Burkhard Monien, Regine Peine, Elena Stöhr
    Broadcasting in Butterfly and deBruijn Networks. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:53, n:1-3, pp:183-197 [Journal]
  106. Rainer Feldmann, Martin Gairing, Thomas Lücking, Burkhard Monien, Manuel Rode
    Selfish Routing in Non-Cooperative Networks: A Survey. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2003, v:81, n:, pp:137-164 [Journal]
  107. Burkhard Monien
    Beschreibung von Zeitkomplexitätsklassen bei Turingmaschinen durch andere Automatenmodelle. [Citation Graph (0, 0)][DBLP]
    Elektronische Informationsverarbeitung und Kybernetik, 1974, v:10, n:1, pp:37-51 [Journal]
  108. Burkhard Monien, Ralf Diekmann, Reinhard Lüling
    The Construction of Large Scale Reconfigurable Parallel Computing Systems (The Architecture of the SC320). [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1997, v:8, n:3, pp:347-361 [Journal]
  109. Burkhard Monien
    Deterministic Two-Way One-Head Pushdown Automata are Very Powerful. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1984, v:18, n:5, pp:239-242 [Journal]
  110. Burkhard Monien
    Two-Way Multihead Automata Over a One-Letter Alphabet. [Citation Graph (0, 0)][DBLP]
    ITA, 1980, v:14, n:1, pp:67-82 [Journal]
  111. Burkhard Monien, Robert Preis
    Upper bounds on the bisection width of 3- and 4-regular graphs. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2006, v:4, n:3, pp:475-498 [Journal]
  112. Ralf Heckmann, Ralf Klasing, Burkhard Monien, Walter Unger
    Optimal Embedding of Complete Binary Trees into Lines and Grids. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1998, v:49, n:1, pp:40-56 [Journal]
  113. Abderezak Touzene, Khaled Day, Burkhard Monien
    Edge-disjoint spanning trees for the generalized butterfly networks and their applications. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2005, v:65, n:11, pp:1384-1396 [Journal]
  114. Burkhard Monien, Guang Gao, Horst Simon, Paul G. Spirakis, Per Stenström
    Introduction. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2006, v:66, n:5, pp:615-616 [Journal]
  115. Robert Elsässer, Thomas Lücking, Burkhard Monien
    On Spectral Bounds for the k-Partitioning of Graphs. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2003, v:36, n:5, pp:461-478 [Journal]
  116. Robert Elsässer, Burkhard Monien, Robert Preis
    Diffusion Schemes for Load Balancing on Heterogeneous Networks. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2002, v:35, n:3, pp:305-320 [Journal]
  117. James Haralambides, Fillia Makedon, Burkhard Monien
    Bandwidth Minimization: An Approximation Algorithm for Caterpillars. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1991, v:24, n:3, pp:169-177 [Journal]
  118. Burkhard Monien
    Relationships between Pushdown Automata with Counters and Complexity Classes. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1975, v:9, n:3, pp:248-264 [Journal]
  119. Ralf Klasing, Reinhard Lüling, Burkhard Monien
    Compressing cube-connected cycles and butterfly networks. [Citation Graph (0, 0)][DBLP]
    Networks, 1998, v:32, n:1, pp:47-65 [Journal]
  120. Matthias Brune, Jörn Gehring, Axel Keller, Burkhard Monien, Friedhelm Ramme, Alexander Reinefeld
    Specifying Resources and Services in Metacomputing Environments. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 1998, v:24, n:12-13, pp:1751-1776 [Journal]
  121. Ralf Diekmann, Andreas Frommer, Burkhard Monien
    Efficient schemes for nearest neighbor load balancing. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 1999, v:25, n:7, pp:789-812 [Journal]
  122. Burkhard Monien, Robert Preis, Ralf Diekmann
    Quality matching and local improvement for multilevel graph-partitioning. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 2000, v:26, n:12, pp:1609-1634 [Journal]
  123. Robert Elsässer, Burkhard Monien, Robert Preis, Andreas Frommer
    Optimal Diffusion Schemes And Load Balancing On Product Graphs. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 2004, v:14, n:1, pp:61-73 [Journal]
  124. Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien
    The Price of Anarchy for Restricted Parallel Links. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 2006, v:16, n:1, pp:117-132 [Journal]
  125. Burkhard Monien, Imrich Vrto
    Improved bounds on cutwidths of shuffle-exchange and de Bruijn graphs. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 2004, v:14, n:3-4, pp:361-366 [Journal]
  126. Sergei L. Bezrukov, Robert Elsässer, Burkhard Monien, Robert Preis, Jean-Pierre Tillich
    New spectral lower bounds on the bisection width of graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:320, n:2-3, pp:155-174 [Journal]
  127. Michal Chytil, Maxime Crochemore, Burkhard Monien, Wojciech Rytter
    On the Parallel Recognition of Unambiguous Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:81, n:2, pp:311-316 [Journal]
  128. Thomas Decker, Thomas Lücking, Burkhard Monien
    A 5/4-approximation algorithm for scheduling identical malleable tasks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:361, n:2-3, pp:226-240 [Journal]
  129. Robert Elsässer, Rastislav Kralovic, Burkhard Monien
    Sparse topologies with small spectrum size. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:307, n:3, pp:549-565 [Journal]
  130. Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Paul G. Spirakis
    Structure and complexity of extreme Nash equilibria. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:343, n:1-2, pp:133-157 [Journal]
  131. Juraj Hromkovic, Claus-Dieter Jeschke, Burkhard Monien
    Note on Optimal Gossiping in Some Weak-Connected Graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:127, n:2, pp:395-402 [Journal]
  132. Ulf Lorenz, Burkhard Monien
    Error analysis in minimax trees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:303, n:3, pp:485-498 [Journal]
  133. Burkhard Monien
    A Recursive and a Grammatical Characterization of the Exponential-Time Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1976, v:3, n:1, pp:61-74 [Journal]
  134. Burkhard Monien, Wojciech Rytter, Helmut Schäpers
    Corrigendum: Fast Recognition of Deterministic CFL's with a Smaller Number of Processors. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:123, n:2, pp:427-428 [Journal]
  135. Burkhard Monien, Ivan Hal Sudborough
    On Eliminating Nondeterminism from Turing Machines which Use less than Logarithm Worktape Space. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:21, n:, pp:237-253 [Journal]
  136. Burkhard Monien, Ivan Hal Sudborough
    Bandwidth Constrained NP-Complete Problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:41, n:, pp:141-167 [Journal]
  137. Burkhard Monien, Ivan Hal Sudborough
    Min Cut is NP-Complete for Edge Weighted Treees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1988, v:58, n:, pp:209-229 [Journal]
  138. Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien
    The price of anarchy for polynomial social cost. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:369, n:1-3, pp:116-135 [Journal]
  139. Yvonne Bleischwitz, Burkhard Monien, Florian Schoppmann, Karsten Tiemann
    The Power of Two Prices: Beyond Cross-Monotonicity. [Citation Graph (0, 0)][DBLP]
    MFCS, 2007, pp:657-668 [Conf]
  140. Marios Mavronicolas, Igal Milchtaich, Burkhard Monien, Karsten Tiemann
    Congestion Games with Player-Specific Constants. [Citation Graph (0, 0)][DBLP]
    MFCS, 2007, pp:633-644 [Conf]
  141. Burkhard Monien, Karsten Tiemann
    Routing and Scheduling with Incomplete Information. [Citation Graph (0, 0)][DBLP]
    DISC, 2007, pp:1-2 [Conf]
  142. Martin Gairing, Burkhard Monien, Andreas Woclaw
    A faster combinatorial approximation algorithm for scheduling unrelated parallel machines. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:380, n:1-2, pp:87-99 [Journal]

  143. On the Power of Nodes of Degree Four in the Local Max-Cut Problem. [Citation Graph (, )][DBLP]


  144. From State-of-the-Art Static Fleet Assignment to Flexible Stochastic Planning of the Future. [Citation Graph (, )][DBLP]


  145. How Many Attackers Can Selfish Defenders Catch? [Citation Graph (, )][DBLP]


  146. MultiProcessor Scheduling is PLS-Complete. [Citation Graph (, )][DBLP]


  147. Local Search: Simple, Successful, But Sometimes Sluggish. [Citation Graph (, )][DBLP]


  148. A new diffusion-based multilevel algorithm for computing graph partitions of very high quality. [Citation Graph (, )][DBLP]


  149. Voronoi Games on Cycle Graphs. [Citation Graph (, )][DBLP]


  150. Load balancing in large networks: a comparative study. [Citation Graph (, )][DBLP]


  151. On the Road to -Completeness: 8 Agents in a Singleton Congestion Game. [Citation Graph (, )][DBLP]


  152. To Be or Not to Be (Served). [Citation Graph (, )][DBLP]


  153. Weighted Boolean Formula Games. [Citation Graph (, )][DBLP]


  154. Nash Equilibria for Voronoi Games on Transitive Graphs. [Citation Graph (, )][DBLP]


  155. The complexity of determining a shortest cycle of even length. [Citation Graph (, )][DBLP]


  156. Nearest-neighbor algorithms for load-balancing in parallel computers. [Citation Graph (, )][DBLP]


  157. How Many Attackers Can Selfish Defenders Catch? [Citation Graph (, )][DBLP]


Search in 0.010secs, Finished in 0.019secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002