BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Austria
1 × Germany
1 × Italy
1 × Portugal
2 × Finland
2 × France
2 × The Netherlands
2 × USA
Collaborated with:
M.Gairing I.H.Sudborough ∅ T.Lücking K.Tiemann M.Mavronicolas R.Feldmann M.Rode D.Dumrauf T.Tscheuschner A.Woclaw C.Haubelt J.Teich A.Knoll C.Altenschmidt J.Biskup H.Blüthgen I.Glöckner S.Hartrumpf H.Helbig C.Henning R.Lüling T.Noll N.Sensen
Talks about:
machin (4) nash (4) equilibria (3) rout (3) game (3) parallel (2) function (2) schedul (2) complet (2) latenc (2)

Person: Burkhard Monien

DBLP DBLP: Monien:Burkhard

Facilitated 2 volumes:

ICALP 1996Ed
ICALP 1991Ed

Contributed to:

ICALP (1) 20102010
ICALP (1) 20062006
ICALP 20052005
ICALP 20042004
STOC 20042004
DATE 20032003
ICALP 20032003
ECDL 19981998
ICALP 19861986
STOC 19811981
ICALP 19791979
ICALP 19771977
ICALP 19741974
ICALP 19721972

Wrote 15 papers:

ICALP-v1-2010-MonienDT
Local Search: Simple, Successful, But Sometimes Sluggish (BM, DD, TT), pp. 1–17.
ICALP-v1-2006-GairingMT #game studies #latency #linear
Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functions (MG, BM, KT), pp. 501–512.
ICALP-2005-GairingLMT #equilibrium #nash
Nash Equilibria, the Price of Anarchy and the Fully Mixed Nash Equilibrium Conjecture (MG, TL, BM, KT), pp. 51–65.
ICALP-2005-GairingMW #algorithm #approximate #combinator #parallel #performance #scheduling
A Faster Combinatorial Approximation Algorithm for Scheduling Unrelated Parallel Machines (MG, BM, AW), pp. 828–839.
ICALP-2004-GairingLMMR #game studies #latency #nash
Nash Equilibria in Discrete Routing Games with Convex Latency Functions (MG, TL, MM, BM, MR), pp. 645–657.
STOC-2004-GairingLMM #nash #parallel #scheduling #strict
Computing Nash equilibria for scheduling on restricted parallel links (MG, TL, MM, BM), pp. 613–622.
DATE-2003-HaubeltTFM #satisfiability #synthesis
SAT-Based Techniques in System Synthesis (CH, JT, RF, BM), pp. 11168–11169.
ICALP-2003-FeldmannGLMR #coordination #game studies
Nashification and the Coordination Ratio for a Selfish Routing Game (RF, MG, TL, BM, MR), pp. 514–526.
ECDL-1998-KnollABBGHHHLMNS #approach #documentation #evaluation #multi #retrieval #semantics
An Integrated Approach to Semantic Evaluation and Content-Based Retrieval of Multimedia Documents (AK, CA, JB, HMB, IG, SH, HH, CH, RL, BM, TN, NS), pp. 409–428.
ICALP-1986-MonienS
Min Cut is NP-Complete for Edge Weighted Trees (BM, IHS), pp. 265–274.
STOC-1981-MonienS #problem
Bandwidth Constrained NP-Complete Problems (BM, IHS), pp. 207–217.
ICALP-1979-MonienS #nondeterminism #on the #turing machine
On Eliminating Nondeterminism From Turing Machines Which Use Less Than Logarithmic Worktape Space (BM, IHS), pp. 431–445.
ICALP-1977-Monien
About the Derivation Languages of Grammars and Machines (BM), pp. 337–351.
ICALP-1974-Monien #bound #recursion
Characterizations of Time-Bounded Computations by Limited Primitive Recursion (BM), pp. 280–293.
ICALP-1972-Monien #automaton #bound #turing machine
Relationship between Pushdown Automata and Tape-Bounded Turing Machines (BM), pp. 575–583.
Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.