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: Booktitle=Proceedings of the 32nd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2012 (Hyderabad, India, December 15-17, 2012)

• Learning mixtures of distributions over large discrete domains
  Yuval Rabani
  Leibniz International Proceedings in Informatics (LIPIcs) 18, 2012, pp. 1-3
• Imperative programming in sets with atoms
  Mikolaj Bojanczyk, Szymon Torunczyk
  Leibniz International Proceedings in Informatics (LIPIcs) 18, 2012, pp. 4-15
• Algorithmic improvements of the Lovász local lemma via cluster expansion
  Dimitris Achlioptas, Themis Gouleakis
  Leibniz International Proceedings in Informatics (LIPIcs) 18, 2012, pp. 16-23
• Test generation using symbolic execution
  Patrice Godefroid
  Leibniz International Proceedings in Informatics (LIPIcs) 18, 2012, pp. 24-33
• Automated reasoning and natural proofs for programs manipulating data structures
  Madhusudan Parthasarathy
  Leibniz International Proceedings in Informatics (LIPIcs) 18, 2012, pp. 34-35
• Certifying polynomials for \mbox{AC}^0(parity) circuits, with applications
  Swastik Kopparty, Srikanth Srinivasan
  Leibniz International Proceedings in Informatics (LIPIcs) 18, 2012, pp. 36-47
• Randomly-oriented k-d trees adapt to intrinsic dimension
  Santosh S. Vempala
  Leibniz International Proceedings in Informatics (LIPIcs) 18, 2012, pp. 48-57
• Lower bounds for the average and smoothed number of Pareto optima
  Navin Goyal, Luis Rademacher
  Leibniz International Proceedings in Informatics (LIPIcs) 18, 2012, pp. 58-69
• Exponential space improvement for minwise based algorithms
  Guy Feigenblat, Ely Porat, Ariel Shiftan
  Leibniz International Proceedings in Informatics (LIPIcs) 18, 2012, pp. 70-85
• An effective characterization of the alternation hierarchy in two-variable logic
  Andreas Krebs, Howard Straubing
  Leibniz International Proceedings in Informatics (LIPIcs) 18, 2012, pp. 86-98
• Decidable classes of documents for XPath
  Vince Bárány, Mikolaj Bojanczyk, Diego Figueira, Pawel Parys
  Leibniz International Proceedings in Informatics (LIPIcs) 18, 2012, pp. 99-111
• Faster deciding MSO properties of trees of fixed height, and some consequences
  Jakub Gajarsky, Petr Hlineny
  Leibniz International Proceedings in Informatics (LIPIcs) 18, 2012, pp. 112-123
• Cost-parity and cost-Streett games
  Nathanael Fijalkow, Martin Zimmermann
  Leibniz International Proceedings in Informatics (LIPIcs) 18, 2012, pp. 124-135
• Super-fast 3-ruling sets
  Kishore Kothapalli, Sriram Pemmaraju
  Leibniz International Proceedings in Informatics (LIPIcs) 18, 2012, pp. 136-147
• New bounds on the classical and quantum communication complexity of some graph properties
  Gábor Ivanyos, Hartmut Klauck, Troy Lee, Miklos Santha, Ronald de Wolf
  Leibniz International Proceedings in Informatics (LIPIcs) 18, 2012, pp. 148-159
• On bisimilarity of higher-order pushdown automata: Undecidability at order two
  Christopher Broadbent, Stefan Göller
  Leibniz International Proceedings in Informatics (LIPIcs) 18, 2012, pp. 160-172
• Scope-bounded multistack pushdown systems: Fixed-point, sequentialization, and tree-width
  Salvatore La Torre, Gennaro Parlato
  Leibniz International Proceedings in Informatics (LIPIcs) 18, 2012, pp. 173-184
• Scheduling with setup costs and monotone penalties
  Rohit Khandekar, Kirsten Hildrum, Deepak Rajan, Joel Wolf
  Leibniz International Proceedings in Informatics (LIPIcs) 18, 2012, pp. 185-198
• Scheduling resources for executing a partial set of jobs
  Venkatesan T. Chakaravarthy, Arindam Pal, Sambuddha Roy, Yogish Sabharwal
  Leibniz International Proceedings in Informatics (LIPIcs) 18, 2012, pp. 199-210
• Visibly rational expressions
  Laura Bozzelli, César Sánchez
  Leibniz International Proceedings in Informatics (LIPIcs) 18, 2012, pp. 211-223
• Safety verification of communicating one-counter machines
  Alexander Heußner, Tristan Le Gall, Grégoire Sutre
  Leibniz International Proceedings in Informatics (LIPIcs) 18, 2012, pp. 224-235
• Density functions subject to a co-matroid constraint
  Venkatesan T. Chakaravarthy, Natwar Modani, Sivaramakrishnan R. Natarajan, Sambuddha Roy, Yogish Sabharwal
  Leibniz International Proceedings in Informatics (LIPIcs) 18, 2012, pp. 236-248
• Efficient on-line algorithm for maintaining k-cover of sparse bit-strings
  Amit Kumar, Preeti R. Panda, Smruti Sarangi
  Leibniz International Proceedings in Informatics (LIPIcs) 18, 2012, pp. 249-256
• Maintaining approximate maximum weighted matching in fully dynamic graphs
  Abhash Anand, Surender Baswana, Manoj Gupta, Sandeep Sen
  Leibniz International Proceedings in Informatics (LIPIcs) 18, 2012, pp. 257-266
• Approximation algorithms for the unsplittable flow problem on paths and trees
  Khaled Elbassioni, Naveen Garg, Divya Gupta, Amit Kumar, Vishal Narula, Arindam Pal
  Leibniz International Proceedings in Informatics (LIPIcs) 18, 2012, pp. 267-275