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: Booktitle=Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, STACS'2015 (Garching, Germany, March 4-7, 2015)

• Overcoming intractability in unsupervised learning
  Sanjeev Arora
  Leibniz International Proceedings in Informatics (LIPIcs) 30, 2015, pp. 1-1
• The complexity of constraint satisfaction problems
  Manuel Bodirsky
  Leibniz International Proceedings in Informatics (LIPIcs) 30, 2015, pp. 2-9
• Parallel algorithms reconsidered
  Peter Sanders
  Leibniz International Proceedings in Informatics (LIPIcs) 30, 2015, pp. 10-18
• Computational social choice
  Felix Brandt
  Leibniz International Proceedings in Informatics (LIPIcs) 30, 2015, pp. 19-19
• Algorithmic game theory
  Paul W. Goldberg
  Leibniz International Proceedings in Informatics (LIPIcs) 30, 2015, pp. 20-20
• The minimum oracle circuit size problem
  Eric Allender, Dhiraj Holden, Valentine Kabanets
  Leibniz International Proceedings in Informatics (LIPIcs) 30, 2015, pp. 21-33
• Graph searching games and width measures for directed graphs
  Saeed Akhoondian Amiri, Łukasz Kaiser, Stephan Kreutzer, Roman Rabinovich, Sebastian Siebertz
  Leibniz International Proceedings in Informatics (LIPIcs) 30, 2015, pp. 34-47
• Subset sum in the absence of concentration
  Per Austrin, Petteri Kaski, Mikko Koivisto, Jesper Nederlof
  Leibniz International Proceedings in Informatics (LIPIcs) 30, 2015, pp. 48-61
• On sharing, memoization, and polynomial time
  Martin Avanzini, Ugo Dal Lago
  Leibniz International Proceedings in Informatics (LIPIcs) 30, 2015, pp. 62-75
• Proof complexity of resolution-based QBF calculi
  Olaf Beyersdorff, Leroy Chew, Mikolás̑ Janota
  Leibniz International Proceedings in Informatics (LIPIcs) 30, 2015, pp. 76-89
• Welfare maximization with friends-of-friends network externalities
  Sayan Bhattacharya, Wolfgang Dvoȓák, Monika Henzinger, Martin Starnberger
  Leibniz International Proceedings in Informatics (LIPIcs) 30, 2015, pp. 90-102
• Markov decision processes and stochastic games with total effective payoff
  Endre Boros, Khaled Elbassioni, Vladimir Gurvich, Kazuhisa Makino
  Leibniz International Proceedings in Informatics (LIPIcs) 30, 2015, pp. 103-115
• Advice complexity for a class of online problems
  Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Jesper W. Mikkelsen
  Leibniz International Proceedings in Informatics (LIPIcs) 30, 2015, pp. 116-129
• Las Vegas computability and algorithmic randomness
  Vasco Brattka, Guido Gherardi, Rupert Hölzl
  Leibniz International Proceedings in Informatics (LIPIcs) 30, 2015, pp. 130-142
• Understanding model counting for \beta-acyclic CNF-formulas
  Johann Brault-Baron, Florent Capelli, Stefan Mengel
  Leibniz International Proceedings in Informatics (LIPIcs) 30, 2015, pp. 143-156
• Parameterized complexity dichotomy for Steiner multicut
  Karl Bringmann, Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen
  Leibniz International Proceedings in Informatics (LIPIcs) 30, 2015, pp. 157-170
• Solving totally unimodular LPs with the shadow vertex algorithm
  Tobias Brunsch, Anna Großwendt, Heiko Röglin
  Leibniz International Proceedings in Informatics (LIPIcs) 30, 2015, pp. 171-183
• Improved local search for geometric hitting set
  Norbert Bus, Shashwat Garg, Nabil H. Mustafa, Saurabh Ray
  Leibniz International Proceedings in Informatics (LIPIcs) 30, 2015, pp. 184-196
• Arc diagrams, flip distances, and Hamiltonian triangulations
  Jean Cardinal, Michael Hoffmann, Vincent Kusters, Csaba D. Tóth, Manuel Wettstein
  Leibniz International Proceedings in Informatics (LIPIcs) 30, 2015, pp. 197-210
• Tractable probabilistic \mu-calculus that expresses probabilistic temporal logics
  Pablo Castro, Cecilia Kilmurray, Nir Piterman
  Leibniz International Proceedings in Informatics (LIPIcs) 30, 2015, pp. 211-223
• Tribes is hard in the message passing model
  Arkadev Chattopadhyay, Sagnik Mukhopadhyay
  Leibniz International Proceedings in Informatics (LIPIcs) 30, 2015, pp. 224-237
• Network design problems with bounded distances via shallow-light Steiner trees
  Markus Chimani, Joachim Spoerhase
  Leibniz International Proceedings in Informatics (LIPIcs) 30, 2015, pp. 238-248
• Combinatorial expressions and lower bounds
  Thomas Colcombet, Amaldev Manuel
  Leibniz International Proceedings in Informatics (LIPIcs) 30, 2015, pp. 249-261
• Construction of \mu-limit sets of two-dimensional cellular automata
  Martin Delacourt, Benjamin Hellouin de Ménibus
  Leibniz International Proceedings in Informatics (LIPIcs) 30, 2015, pp. 262-274
• Derandomized graph product results using the low degree long code
  Irit Dinur, Prahladh Harsha, Srikanth Srinivasan, Girish Varma
  Leibniz International Proceedings in Informatics (LIPIcs) 30, 2015, pp. 275-287