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

• Distribution-sensitive construction of minimum-redundancy prefix codes
  Ahmed Belal, Amr Elmasry
  Lecture Notes in Computer Science 3884, 2006, pp. 92-103
• Equivalence of F-algebras and cubic forms
  Manindra Agrawal, Nitin Saxena
  Lecture Notes in Computer Science 3884, 2006, pp. 115-126
• Complete codes in a sofic shift
  Marie-Pierre Béal, Dominique Perrin
  Lecture Notes in Computer Science 3884, 2006, pp. 127-136
• Quantum algorithms for matching and network flows
  Andris Ambainis, Robert S̑palek
  Lecture Notes in Computer Science 3884, 2006, pp. 172-183
• Estimating entropy and entropy norm on data streams
  Amit Chakrabarti, Khanh Do Ba, S. Muthukrishnan
  Lecture Notes in Computer Science 3884, 2006, pp. 196-205
• Exact price of anarchy for polynomial congestion games
  Sebastian Aland, Dominic Dumrauf, Martin Gairing, Burkhard Monien, Florian Schoppmann
  Lecture Notes in Computer Science 3884, 2006, pp. 218-229
• Oblivious symmetric alternation
  Venkatesan T. Chakaravarthy, Sambuddha Roy
  Lecture Notes in Computer Science 3884, 2006, pp. 230-241
• Grid vertex-unfolding orthogonal polyhedra
  Mirela Damian, Robin Y. Flatland, Joseph O'Rourke
  Lecture Notes in Computer Science 3884, 2006, pp. 264-276
• Invariants of automatic presentations and semi-synchronous transductions
  Vince Bárány
  Lecture Notes in Computer Science 3884, 2006, pp. 289-300
• Markov decision processes with multiple objectives
  Krishnendu Chatterjee, Rupak Majumdar, Thomas A. Henzinger
  Lecture Notes in Computer Science 3884, 2006, pp. 325-336
• Convergence and approximation in potential games
  George Christodoulou, Vahab S. Mirrokni, Anastasios Sidiropoulos
  Lecture Notes in Computer Science 3884, 2006, pp. 349-360
• Fast FPT-algorithms for cleaning grids
  Josep Díaz, Dimitrios M. Thilikos
  Lecture Notes in Computer Science 3884, 2006, pp. 361-371
• On hypergraph and graph isomorphism with bounded color classes
  Vikraman Arvind, Johannes Köbler
  Lecture Notes in Computer Science 3884, 2006, pp. 384-395
• Regularity problems for visibly pushdown languages
  Vince Bárány, Christof Löding, Olivier Serre
  Lecture Notes in Computer Science 3884, 2006, pp. 420-431
• Sparse selfreducible sets and polynomial size circuit lower bounds
  Harry Buhrman, Leen Torenvliet, Falk Unger
  Lecture Notes in Computer Science 3884, 2006, pp. 455-468
• Generalized modal satisfiability
  Michael Bauland, Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor
  Lecture Notes in Computer Science 3884, 2006, pp. 500-511
• Strategy improvement and randomized subexponential algorithms for stochastic parity games
  Krishnendu Chatterjee, Thomas A. Henzinger
  Lecture Notes in Computer Science 3884, 2006, pp. 512-523
• DAG-width and parity games
  Dietmar Berwanger, Anuj Dawar, Paul Hunter, Stephan Kreutzer
  Lecture Notes in Computer Science 3884, 2006, pp. 524-536
• Convergence of autonomous mobile robots with inaccurate sensors and movements
  Reuven Cohen, David Peleg
  Lecture Notes in Computer Science 3884, 2006, pp. 549-560
• Generating randomized roundings with cardinality constraints and derandomizations
  Benjamin Doerr
  Lecture Notes in Computer Science 3884, 2006, pp. 571-583
• Optimal node routing
  Yossi Azar, Yoel Chaiutin
  Lecture Notes in Computer Science 3884, 2006, pp. 596-607
• Energy-efficient algorithms for flow time minimization
  Susanne Albers, Hiroshi Fujiwara
  Lecture Notes in Computer Science 3884, 2006, pp. 621-633
• Datalog and constraint satisfaction with infinite templates
  Manuel Bodirsky, Víctor Dalmau
  Lecture Notes in Computer Science 3884, 2006, pp. 646-659
• On bent and highly nonlinear balanced/resilient functions and their algebraic immunities
  Claude Carlet
  Lecture Notes in Computer Science 3857, 2006, pp. 1-28
• A general framework for applying FGLM techniques to linear codes
  M. Borges-Quintana, M.A. Borges-Trenard, E. Martínez-Moro
  Lecture Notes in Computer Science 3857, 2006, pp. 76-86