Fakultät für Informatik - Technische Universität München Lehrstuhl für Effiziente Algorithmen

Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen	Hilfe

Suche: Series=LNCS AND YEAR=2006

• On the complexity of 2D discrete fixed point problem
  Xi Chen, Xiaotie Deng
  Lecture Notes in Computer Science 4051, 2006, pp. 489-500
• The game world is flat: The complexity of Nash equilibria in succinct games
  Constantinos Daskalakis, Alex Fabrikant, Christos H. Papadimitriou
  Lecture Notes in Computer Science 4051, 2006, pp. 513-524
• Network games with atomic players
  Roberto Cominetti, José R. Correa, Nicolás E. Stier-Moses
  Lecture Notes in Computer Science 4051, 2006, pp. 525-536
• Finite-state dimension and real arithmetic
  David Doty, Jack H. Lutz, Satyadev Nandakumar
  Lecture Notes in Computer Science 4051, 2006, pp. 537-547
• Exact algorithms for exact satisfiability and number of perfect matchings
  Andreas Björklund, Thore Husfeldt
  Lecture Notes in Computer Science 4051, 2006, pp. 548-559
• Computing equilibrium prices in exchange economies with tax distortions
  Bruno Codenotti, Luis Rademacher, Kasturi Varadarajan
  Lecture Notes in Computer Science 4051, 2006, pp. 584-595
• New constructions of mechanisms with verification
  Vincenzo Auletta, Roberto De Prisco, Paolo Penna, Giuseppe Persiano, Carmine Ventre
  Lecture Notes in Computer Science 4051, 2006, pp. 596-607
• New algorithms for regular expression matching
  Philip Bille
  Lecture Notes in Computer Science 4051, 2006, pp. 643-654
• Fixed parameter tractability of binary near-perfect phylogenetic tree reconstruction
  Guy E. Blelloch, Kedar Dhamdhere, Eran Halperin, R. Ravi, Russell Schwartz, Srinath Sridhar
  Lecture Notes in Computer Science 4051, 2006, pp. 667-678
• Length-bounded cuts and flows
  Georg Baier, Thomas Erlebach, Alexander Hall, Ekkehard Köhler, Heiko Schilling, Martin Skutella
  Lecture Notes in Computer Science 4051, 2006, pp. 679-690
• An adaptive spectral heuristic for partitioning random graphs
  Amin Coja-Oghlan
  Lecture Notes in Computer Science 4051, 2006, pp. 691-702
• Some results on matchgates and holographic algorithms
  Jin-Yi Cai, Vinay Choudhary
  Lecture Notes in Computer Science 4051, 2006, pp. 703-714
• Invariant based programming
  Ralph-Johan Back
  Lecture Notes in Computer Science 4024, 2006, pp. 1-18
• On the integration of UML and Petri nets in software development
  Javier Campos, José Merseguer
  Lecture Notes in Computer Science 4024, 2006, pp. 19-36
• Compensation in workflow nets
  Baver Acu, Wolfgang Reisig
  Lecture Notes in Computer Science 4024, 2006, pp. 65-83
• The synthesis problem of netcharts
  Nicolas Baudru, Rémi Morin
  Lecture Notes in Computer Science 4024, 2006, pp. 84-104
• Non-sequential behaviour of dynamic nets
  Roberto Bruni, Hernán Melgratti
  Lecture Notes in Computer Science 4024, 2006, pp. 105-124
• Complete finite prefixes of symbolic unfoldings of safe time Petri nets
  Thomas Chatain, Claude Jard
  Lecture Notes in Computer Science 4024, 2006, pp. 125-145
• Can I execute my scenario in your net? VipTool tells you!
  Robin Bergenthum, Jörg Desel, Gabriel Juhás, Robert Lorenz
  Lecture Notes in Computer Science 4024, 2006, pp. 381-390
• EXHOST-PIPE: PIPE extended for two classes of monitoring Petri nets
  Olivier Bonnet-Torrés, Patrice Domenech, Charles Lesire, Catherine Tessier
  Lecture Notes in Computer Science 4024, 2006, pp. 391-400
• Asynchronous pattern matching
  Amihood Amir
  Lecture Notes in Computer Science 4009, 2006, pp. 1-10
• Adaptive searching in succinctly encoded binary relations and tree-structured documents
  Jérémy Barbay, Alexander Golynski, J. Ian Munro, S. Srinivasa Rao
  Lecture Notes in Computer Science 4009, 2006, pp. 24-35
• A linear size index for approximate pattern matching
  Ho-Leung Chan, Tak-Wah Lam, Wing-Kin Sung, Siu-Lung Tam, Swee-Seong Wong
  Lecture Notes in Computer Science 4009, 2006, pp. 49-59
• New bounds for motif finding in strong instances
  Bron̑a Brejová, Daniel G. Brown, Ian M. Harrower, Tomás̑ Vinaȓ
  Lecture Notes in Computer Science 4009, 2006, pp. 94-105
• Fingerprint clustering with bounded number of missing values
  Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Giancarlo Mauri
  Lecture Notes in Computer Science 4009, 2006, pp. 106-116