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 Volume=4596

• Ushering in a new era of algorithm design
  Bernard Chazelle
  Lecture Notes in Computer Science 4596, 2007, pp. 1-1
• A ``proof-reading'' of some issues in cryptography
  Ivan Damgård
  Lecture Notes in Computer Science 4596, 2007, pp. 2-11
• Credentials-based authorization: Evaluation and implementation
  Fred B. Schneider
  Lecture Notes in Computer Science 4596, 2007, pp. 12-14
• Subexponential parameterized algorithms
  Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos
  Lecture Notes in Computer Science 4596, 2007, pp. 15-27
• Competitive algorithms for due date scheduling
  Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs
  Lecture Notes in Computer Science 4596, 2007, pp. 28-39
• Mechanism design for fractional scheduling on unrelated machines
  George Christodoulou, Elias Koutsoupias, Annamária Kovács
  Lecture Notes in Computer Science 4596, 2007, pp. 40-52
• Estimating sum by weighted sampling
  Rajeev Motwani, Rina Panigrahy, Ying Xu
  Lecture Notes in Computer Science 4596, 2007, pp. 53-64
• Sampling methods for shortest vectors, closest vectors and successive minima
  Johannes Blömer, Stefanie Naewe
  Lecture Notes in Computer Science 4596, 2007, pp. 65-77
• Low distortion spanners
  Seth Pettie
  Lecture Notes in Computer Science 4596, 2007, pp. 78-89
• Minimum weight 2-edge-connected spanning subgraphs in planar graphs
  André Berger, Michelangelo Grigni
  Lecture Notes in Computer Science 4596, 2007, pp. 90-101
• Labeling schemes for vertex connectivity
  Amos Korman
  Lecture Notes in Computer Science 4596, 2007, pp. 102-109
• Unbounded-error one-way classical and quantum communication complexity
  Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita
  Lecture Notes in Computer Science 4596, 2007, pp. 110-121
• A lower bound on entanglement-assisted quantum communication complexity
  Ashley Montanaro, Andreas Winter
  Lecture Notes in Computer Science 4596, 2007, pp. 122-133
• Separating deterministic from nondeterministic NOF multiparty communication complexity
  Paul Beame, Matei David, Toniann Pitassi, Philipp Woelfel
  Lecture Notes in Computer Science 4596, 2007, pp. 134-145
• An optimal decomposition algorithm for tree edit distance
  Erik D. Demaine, Shay Mozes, Benjamin Rossman, Oren Weimann
  Lecture Notes in Computer Science 4596, 2007, pp. 146-157
• On commutativity based edge lean search
  Dragan Bos̑nac̑ki, Edith Elkind, Blaise Genest, Doron Peled
  Lecture Notes in Computer Science 4596, 2007, pp. 158-170
• Commitment under uncertainty: Two-stage stochastic matching problems
  Irit Katriel, Claire Kenyon-Mathieu, Eli Upfal
  Lecture Notes in Computer Science 4596, 2007, pp. 171-182
• On the complexity of hard-core set constructions
  Chi-Jen Lu, Shi-Chun Tsai, Hsin-Lung Wu
  Lecture Notes in Computer Science 4596, 2007, pp. 183-194
• Approximation by DNF: Examples and counterexamples
  Ryan O'Donnell, Karl Wimmer
  Lecture Notes in Computer Science 4596, 2007, pp. 195-206
• Exotic quantifiers, complexity classes, and complete problems
  Peter Bürgisser, Felipe Cucker
  Lecture Notes in Computer Science 4596, 2007, pp. 207-218
• Online conflict-free colorings for hypergraphs
  Amotz Bar-Noy, Panagiotis Cheilaris, Svetlana Olonetsky, Shakhar Smorodinsky
  Lecture Notes in Computer Science 4596, 2007, pp. 219-230
• Distributed computing with advice: Information sensitivity of graph coloring
  Pierre Fraigniaud, Cyril Gavoille, David Ilcinkas, Andrzej Pelc
  Lecture Notes in Computer Science 4596, 2007, pp. 231-242
• Private multiparty sampling and approximation of vector combinations
  Yuval Ishai, Tal Malkin, Martin J. Strauss, Rebecca N. Wright
  Lecture Notes in Computer Science 4596, 2007, pp. 243-254
• Constant-round private database queries
  Nenad Dedic, Payman Mohassel
  Lecture Notes in Computer Science 4596, 2007, pp. 255-266
• Universal algebra and hardness results for constraint satisfaction problems
  Benoît Larose, Pascal Tesson
  Lecture Notes in Computer Science 4596, 2007, pp. 267-278