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

• Approximate sorting of data streams with limited storage
  Farzad Farnoud (Hassanzadeh), Eitan Yaakobi, Jehoshua Bruck
  Lecture Notes in Computer Science 8591, 2014, pp. 465-476
• Classifying the clique-width of H-free bipartite graphs
  Konrad Kazimierz Dabrowski, Daniël Paulusma
  Lecture Notes in Computer Science 8591, 2014, pp. 489-500
• On the performance of mildly greedy players in cut games
  Vittorio Bilò, Mauro Paladini
  Lecture Notes in Computer Science 8591, 2014, pp. 513-524
• Statistical properties of short RSA distribution and their cryptographic applications
  Pierre-Alain Fouque, Jean-Christophe Zapalowicz
  Lecture Notes in Computer Science 8591, 2014, pp. 525-536
• On linear congestion games with altruistic social context
  Vittorio Bilò
  Lecture Notes in Computer Science 8591, 2014, pp. 547-558
• Scheduling over scenarios on two machines
  Esteban Feuerstein, Alberto Marchetti-Spaccamela, Frans Schalekamp, René Sitters, Suzanne van der Ster, Leen Stougie, Anke van Zuyelen
  Lecture Notes in Computer Science 8591, 2014, pp. 559-571
• The complexity of bounded register and skew arithmetic computation
  Vikraman Arvind, S. Raja
  Lecture Notes in Computer Science 8591, 2014, pp. 572-583
• Minimizing average flow-time under knapsack constraint
  Suman Kalyan Bera, Syamantak Das, Amit Kumar
  Lecture Notes in Computer Science 8591, 2014, pp. 584-595
• Explaining snapshots of network diffusions: Structural and hardness results
  Georgios Askalidis, Randall A. Berry, Vijay G. Subramanian
  Lecture Notes in Computer Science 8591, 2014, pp. 616-625
• Pioneers of influence propagation in social networks
  Kumar Gaurav, Bartƚomiej Bƚaszczyszyn, Paul Holger Keeler
  Lecture Notes in Computer Science 8591, 2014, pp. 626-636
• Partner matching applications of social networks
  Chunyu Ai, Wei Zhong, Mingyuan Yan, Feng Gu
  Lecture Notes in Computer Science 8591, 2014, pp. 647-656
• Symmetric groups and quotient complexity of Boolean operations
  Jason Bell, Janusz Brzozowski, Nelma Moreira, Rogério Reis
  Lecture Notes in Computer Science 8573, 2014, pp. 1-12
• Handling infinitely branching WSTS
  Michael Blondin, Alain Finkel, Pierre McKenzie
  Lecture Notes in Computer Science 8573, 2014, pp. 13-25
• Transducers with origin information
  Mikoƚaj Bojańczyk
  Lecture Notes in Computer Science 8573, 2014, pp. 26-37
• Weak MSO+U with path quantifiers over infinite trees
  Mikoƚaj Bojańczyk
  Lecture Notes in Computer Science 8573, 2014, pp. 38-49
• On the decidability of MSO+U on infinite trees
  Mikoƚaj Bojańczyk, Tomasz Gogacz, Henryk Michalewski, Michaƚ Skrzypczak
  Lecture Notes in Computer Science 8573, 2014, pp. 50-61
• A coalgebraic foundation for coinductive union types
  Marcello Bonsangue, Jurriaan Rot, Davide Ancona, Frank de Boer, Jan Rutten
  Lecture Notes in Computer Science 8573, 2014, pp. 62-73
• Turing degrees of limit sets of cellular automata
  Alex Borello, Julien Cervelle, Pascal Vanier
  Lecture Notes in Computer Science 8573, 2014, pp. 74-85
• On the complexity of temporal-logic path checking
  Daniel Bundala, Joël Ouaknine
  Lecture Notes in Computer Science 8573, 2014, pp. 86-97
• Parameterised linearisability
  Andrea Cerone, Alexey Gotsman, Hongseok Yang
  Lecture Notes in Computer Science 8573, 2014, pp. 98-109
• Games with a weak adversary
  Krishnendu Chatterjee, Laurent Doyen
  Lecture Notes in Computer Science 8573, 2014, pp. 110-121
• The complexity of ergodic mean-payoff games
  Krishnendu Chatterjee, Rasmus Ibsen-Jensen
  Lecture Notes in Computer Science 8573, 2014, pp. 122-133
• Toward a structure theory of regular infinitary trace languages
  Namit Chaturvedi
  Lecture Notes in Computer Science 8573, 2014, pp. 134-145
• Unary pushdown automata and straight-line programs
  Dmitry Chistikov, Rupak Majumdar
  Lecture Notes in Computer Science 8573, 2014, pp. 146-157
• Robustness against power is PSpace-complete
  Egor Derevenetc, Roland Meyer
  Lecture Notes in Computer Science 8573, 2014, pp. 158-170