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 [1]	Hilfe

Suche: Series=LNCS AND YEAR=2011

• Horoball hulls and extents in positive definite space
  P. Thomas Fletcher, John Moeller, Jeff M. Phillips, Suresh Venkatasubramanian
  Lecture Notes in Computer Science 6844, 2011, pp. 386-398
• Enumerating minimal subset feedback vertex sets
  Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Charis Papadopoulos, Yngve Villanger
  Lecture Notes in Computer Science 6844, 2011, pp. 399-410
• Upper bounds for maximally greedy binary search trees
  Kyle Fox
  Lecture Notes in Computer Science 6844, 2011, pp. 411-422
• On the matter of dynamic optimality in an extended model for tree access operations
  Michael L. Fredman
  Lecture Notes in Computer Science 6844, 2011, pp. 423-437
• FlipCut supertrees: Towards matrix representation accuracy in polynomial time
  Malte Brinkmeyer, Thasso Griebel, Sebastian Böcker
  Lecture Notes in Computer Science 6842, 2011, pp. 37-48
• Spin systems on graphs with complex edge functions and specified degree regularities
  Jin-Yi Cai, Michael Kowalczyk
  Lecture Notes in Computer Science 6842, 2011, pp. 146-157
• Proper n-cell polycubes in n-3 dimensions
  Andrei Asinowski, Gill Barequet, Ronnie Barequet, Günter Rote
  Lecture Notes in Computer Science 6842, 2011, pp. 180-191
• Largest area convex hull of axis-aligned squares based on imprecise data
  Ovidiu Daescu, Wenqi Ju, Jun Luo, Binhai Zhu
  Lecture Notes in Computer Science 6842, 2011, pp. 192-203
• Optimal strategies for the one-round discrete Voronoi game on a line
  Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das
  Lecture Notes in Computer Science 6842, 2011, pp. 213-224
• Computing the girth of a planar graph in linear time
  Hsien-Chih Chang, Hsueh-I Lu
  Lecture Notes in Computer Science 6842, 2011, pp. 225-236
• (1+\epsilon)-competitive algorithm for online OVSF code assignment with resource augmentation
  Yuichi Asahiro, Kenta Kanmera, Eiji Miyano
  Lecture Notes in Computer Science 6842, 2011, pp. 259-270
• Scheduling jobs on heterogeneous platforms
  Marin Bougeret, Pierre Francois Dutot, Klaus Jansen, Christina Robenek, Denis Trystram
  Lecture Notes in Computer Science 6842, 2011, pp. 271-283
• Approximately uniform online checkpointing
  Lauri Ahlroth, Olli Pottonen, André Schumacher
  Lecture Notes in Computer Science 6842, 2011, pp. 297-306
• A generic approach to decomposition algorithms, with an application to digraph decomposition
  Binh-Minh Bui-Xuan, Pinar Heggernes, Daniel Meister, Andrzej Proskurowski
  Lecture Notes in Computer Science 6842, 2011, pp. 331-342
• Matching and P_2-packing: Weighted versions
  Qilong Feng, Jianxin Wang, Jianer Chen
  Lecture Notes in Computer Science 6842, 2011, pp. 343-353
• Canonizing hypergraphs under Abelian group action
  V. Arvind, Johannes Köbler
  Lecture Notes in Computer Science 6842, 2011, pp. 444-455
• On the right-seed array of a string
  Michalis Christou, Maxime Crochemore, Ondrej Guth, Costas S. Iliopoulos, Solon P. Pissis
  Lecture Notes in Computer Science 6842, 2011, pp. 492-502
• Summing symbols in mutual recurrences
  Berkeley R. Churchill, Edmund A. Lamagna
  Lecture Notes in Computer Science 6842, 2011, pp. 531-542
• Combinatorial group testing for corruption localizing hashing
  Annalisa De Bonis, Giovanni Di Crescenzo
  Lecture Notes in Computer Science 6842, 2011, pp. 579-591
• Task ordering and memory management problem for degree of parallelism estimation
  Sergiu Carpov, Jacques Carlier, Dritan Nace, Renaud Sirdey
  Lecture Notes in Computer Science 6842, 2011, pp. 592-603
• Computing majority with triple queries
  Gianluca De Marco, Evangelos Kranakis, Gábor Wiener
  Lecture Notes in Computer Science 6842, 2011, pp. 604-615
• Oblivious transfer and n-variate linear function evaluation
  Yeow Meng Chee, Huaxiong Wang, Liang Feng Zhang
  Lecture Notes in Computer Science 6842, 2011, pp. 627-637
• Nondeterministic streaming string transducers
  Rajeev Alur, Jyotirmoy V. Deshmukh
  Lecture Notes in Computer Science 6756, 2011, pp. 1-20
• On the relation between differential privacy and quantitative information flow
  Mário S. Alvim, Miguel E. Andrés, Konstantinos Chatzikokolakis, Catuscia Palamidessi
  Lecture Notes in Computer Science 6756, 2011, pp. 60-76
• Rice's theorem for \mu-limit sets of cellular automata
  Martin Delacourt
  Lecture Notes in Computer Science 6756, 2011, pp. 89-100