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

Suche: Series=LNCS AND YEAR=2002

• Solving the string statistics problem in time O(n \log n)
  Gerth Stlting Brodal, Rune B. Lyngs, Anna Östlin, Christian N.S. Pedersen
  Lecture Notes in Computer Science 2380, 2002, pp. 728-739
• A PTAS for distinguishing (sub)string selection
  Xiaotie Deng, Guojun Li, Zimao Li, Bin Ma, Lusheng Wang
  Lecture Notes in Computer Science 2380, 2002, pp. 740-751
• Navigating with a browser
  Michaƚ Bielecki, Jan Hidders, Jan Paredaens, Jerzy Tyszkiewicz, Jan Van den Bussche
  Lecture Notes in Computer Science 2380, 2002, pp. 764-775
• Call control in rings
  Udo Adamy, Christoph Ambuehl, R. Sai Anand, Thomas Erlebach
  Lecture Notes in Computer Science 2380, 2002, pp. 788-799
• Preemptive scheduling in overloaded systems
  Marek Chrobak, Leah Epstein, John Noga, Jiȓí Sgall, Rob van Stee, Tomás Tichý, Nodari Vakhania
  Lecture Notes in Computer Science 2380, 2002, pp. 800-811
• Two-way alternating automata and finite models
  Mikoƚaj Bojanćzyk
  Lecture Notes in Computer Science 2380, 2002, pp. 833-844
• Approximating Huffman codes in parallel
  Piotr Berman, Marek Karpinski, Yakov Nekrich
  Lecture Notes in Computer Science 2380, 2002, pp. 845-855
• Antirandomizing the wrong game
  Benjamin Doerr
  Lecture Notes in Computer Science 2380, 2002, pp. 876-887
• Fast universalization of investment strategies with provably good relative returns
  Karhan Akcoglu, Petros Drineas, Ming-Yang Kao
  Lecture Notes in Computer Science 2380, 2002, pp. 888-900
• Randomized pursuit-evasion in graphs
  Micah Adler, Harald Räcke, Naveen Sivadasan Christian Sohler, Berthold Vöcking
  Lecture Notes in Computer Science 2380, 2002, pp. 901-912
• Complete and tractable local linear time temporal logics over traces
  Bharat Adsul, Milind Sohoni
  Lecture Notes in Computer Science 2380, 2002, pp. 926-937
• Random numbers and an incomplete immune recursive set
  Vasco Brattka
  Lecture Notes in Computer Science 2380, 2002, pp. 950-961
• Polynomial-time approximation schemes for the Euclidean survivable network design problem
  Artur Czumaj, Andrzej Lingas, Hairong Zhao
  Lecture Notes in Computer Science 2380, 2002, pp. 973-984
• Finding a path of superlogarithmic length
  Andreas Björklund, Thore Husfeldt
  Lecture Notes in Computer Science 2380, 2002, pp. 985-992
• Wagner's theorem on realizers
  Nicolas Bonichon, Bertrand Le Saëc, Mohamed Mosbah
  Lecture Notes in Computer Science 2380, 2002, pp. 1043-1053
• Efficient text mining with optimized pattern discovery
  Hiroki Arimura
  Lecture Notes in Computer Science 2373, 2002, pp. 17-19
• The problem of context sensitive string matching
  Venkatesan T. Chakaravarthy, Rajasekar Krishnamurthy
  Lecture Notes in Computer Science 2373, 2002, pp. 64-75
• Towards optimally solving the LONGEST COMMON SUBSEQUENCE problem for sequences with nested arc annotations in linear time
  Jochen Alber, Jens Gramm, Jiong Guo, Rolf Niedermeier
  Lecture Notes in Computer Science 2373, 2002, pp. 99-114
• On the complexity of deriving position specific score matrices from examples
  Tatsuya Akutsu, Hideo Bannai, Satoru Miyano, Sascha Ott
  Lecture Notes in Computer Science 2373, 2002, pp. 168-177
• Three heuristics for \delta-matching: \delta-BM algorithms
  Maxime Crochemore, Costas S. Iliopoulos, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter
  Lecture Notes in Computer Science 2373, 2002, pp. 178-189
• A better method for length distribution modeling in HMMs and its application to gene finding
  Broña Brejová, Tomás̑ Vinar
  Lecture Notes in Computer Science 2373, 2002, pp. 190-202
• One-gapped q-gram filters for Levenshtein distance
  Stefan Burkhardt, Juha Kärkkäinen
  Lecture Notes in Computer Science 2373, 2002, pp. 225-234
• Gauss composition and generalizations
  Manjul Bhargava
  Lecture Notes in Computer Science 2369, 2002, pp. 1-8
• Elliptic curves - The crossroads of theory and computation
  John Coates
  Lecture Notes in Computer Science 2369, 2002, pp. 9-19
• On arithmetically equivalent number fields of small degree
  Wieb Bosma, Bart de Smit
  Lecture Notes in Computer Science 2369, 2002, pp. 67-79