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=2010

• Choosing, agreeing, and eliminating in communication complexity
  Amos Beimel, Sebastian Ben Daniel, Eyal Kushilevitz, Enav Weinreb
  Lecture Notes in Computer Science 6198, 2010, pp. 451-462
• Weak completeness notions for exponential time
  Klaus Ambos-Spies, Timur Bakibayev
  Lecture Notes in Computer Science 6198, 2010, pp. 503-514
• Efficient evaluation of nondeterministic automata using factorization forests
  Mikoƚaj Bojańczyk, Paweƚ Parys
  Lecture Notes in Computer Science 6198, 2010, pp. 515-526
• Improved constructions for non-adaptive threshold group testing
  Mahdi Cheraghchi
  Lecture Notes in Computer Science 6198, 2010, pp. 552-564
• Covering and packing in linear space
  Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
  Lecture Notes in Computer Science 6198, 2010, pp. 727-737
• Putting the Hodge and Tate conjectures to the test
  Henri Darmon
  Lecture Notes in Computer Science 6197, 2010, pp. 1-1
• Explicit Coleman integration for hyperelliptic curves
  Jennifer S. Balakrishnan, Robert W. Bradshaw, Kiran S. Kedlaya
  Lecture Notes in Computer Science 6197, 2010, pp. 16-31
• Smallest reduction matrix of binary quadratic forms: And cryptographic applications
  Aurore Bernard, Nicolas Gama
  Lecture Notes in Computer Science 6197, 2010, pp. 32-49
• Practical improvements to class group and regulator computation of real quadratic fields
  Jean-François Biasse, Michael J., Jr. Jacobson
  Lecture Notes in Computer Science 6197, 2010, pp. 50-65
• On the use of the negation map in the Pollard rho method
  Joppe W. Bos, Thorsten Kleinjung, Arjen K. Lenstra
  Lecture Notes in Computer Science 6197, 2010, pp. 66-82
• An O(M(n)\log n) algorithm for the Jacobi symbol
  Richard P. Brent, Paul Zimmermann
  Lecture Notes in Computer Science 6197, 2010, pp. 83-95
• New families of ECM curves for Cunningham numbers
  Éric Brier, Christophe Clavier
  Lecture Notes in Computer Science 6197, 2010, pp. 96-109
• Visualizing elements of Sha[3] in genus 2 Jacobians
  Nils Bruin, Sander R. Dahmen
  Lecture Notes in Computer Science 6197, 2010, pp. 110-125
• Understanding and inductive inference
  Manuel Blum
  Lecture Notes in Computer Science 6196, 2010, pp. 1-1
• Boxicity and poset dimension
  Abhijin Adiga, Diptendu Bhowmick, L. Sunil Chandran
  Lecture Notes in Computer Science 6196, 2010, pp. 3-12
• Approximate weighted farthest neighbors and minimum dilation stars
  John Augustine, David Eppstein, Kevin A. Wortman
  Lecture Notes in Computer Science 6196, 2010, pp. 90-99
• Triangle-free 2-matchings revisited
  Maxim Babenko, Alexey Gusakov, Ilya Razenshteyn
  Lecture Notes in Computer Science 6196, 2010, pp. 120-129
• Computing graph spanners in small memory: Fault-tolerance and streaming
  Giorgio Ausiello, Paolo G. Franciosa, Giuseppe F. Italiano, Andrea Ribichini
  Lecture Notes in Computer Science 6196, 2010, pp. 160-172
• Factorization of Cartesian products of hypergraphs
  Alain Bretto, Yannick Silvestre
  Lecture Notes in Computer Science 6196, 2010, pp. 173-181
• Minimum-segment convex drawings of 3-connected cubic plane graphs
  Sudip Biswas, Debajyoti Mondal, Rahnuma Islam Nishat, Md. Saidur Rahman
  Lecture Notes in Computer Science 6196, 2010, pp. 182-191
• On three parameters of invisibility graphs
  Josef Cibulka, Jan Kync̑l, Viola Mészáros, Rudolf Stolaȓ, Pavel Valtr
  Lecture Notes in Computer Science 6196, 2010, pp. 192-198
• Exact and approximation algorithms for geometric and capacitated set cover problems
  Piotr Berman, Marek Karpinski, Andrzej Lingas
  Lecture Notes in Computer Science 6196, 2010, pp. 226-234
• Effect of corner information in simultaneous placement of k rectangles and tableaux
  Shinya Anzai, Jinhee Chun, Ryosei Kasai, Matias Korman, Takeshi Tokuyama
  Lecture Notes in Computer Science 6196, 2010, pp. 235-243
• Tile-packing tomography is \mathbb{NP}-hard
  Marek Chrobak, Christoph Dürr, Flavio Guíñez, Antoni Lozano, Nguyen Kim Thang
  Lecture Notes in Computer Science 6196, 2010, pp. 254-263
• Tracking a generator by persistence
  Oleksiy Busaryev, Tamal K. Dey, Yusu Wang
  Lecture Notes in Computer Science 6196, 2010, pp. 278-287