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 Volume=7392

• Exponential lower bounds and separation for query rewriting
  Stanislav Kikot, Roman Kontchakov, Vladimir Podolskii, Michael Zakharyaschev
  Lecture Notes in Computer Science 7392, 2012, pp. 263-274
• Lattices of logical fragments over words
  Manfred Kufleitner, Alexander Lauser
  Lecture Notes in Computer Science 7392, 2012, pp. 275-286
• On the expressive power of cost logics over infinite words
  Denis Kuperberg, Michael Vanden Boom
  Lecture Notes in Computer Science 7392, 2012, pp. 287-298
• Coalgebraic predicate logic
  Tadeusz Litak, Dirk Pattinson, Katsuhiko Sano, Lutz Schröder
  Lecture Notes in Computer Science 7392, 2012, pp. 299-311
• Algorithmic games for full ground references
  Andrzej S. Murawski, Nikos Tzevelekos
  Lecture Notes in Computer Science 7392, 2012, pp. 312-324
• Two-level game semantics, intersection types, and recursion schemes
  C.-H. Luke Ong, Takeshi Tsukada
  Lecture Notes in Computer Science 7392, 2012, pp. 325-336
• An automata-theoretic model of idealized Algol
  Uday S. Reddy, Brian P. Dunphy
  Lecture Notes in Computer Science 7392, 2012, pp. 337-350
• Towards a unified theory of operational and axiomatic semantics
  Grigore Roşu, Andrei Ştefȃnescu
  Lecture Notes in Computer Science 7392, 2012, pp. 351-363
• Loader and Urzyczyn are logically related
  Sylvain Salvati, Giulio Manzonetto, Mai Gehrke, Henk Barendregt
  Lecture Notes in Computer Science 7392, 2012, pp. 364-376
• Languages of profinite words and the limitedness problem
  Szymon Toruńczyk
  Lecture Notes in Computer Science 7392, 2012, pp. 377-389
• The complexity of mean-payoff automaton expression
  Yaron Velner
  Lecture Notes in Computer Science 7392, 2012, pp. 390-402
• On the locality of some NP-complete problems
  Leonid Barenboim
  Lecture Notes in Computer Science 7392, 2012, pp. 403-415
• Growing half-balls: Minimizing storage and communication costs in CDNs
  Reuven Bar-Yehuda, Erez Kantor, Shay Kutten, Dror Rawitz
  Lecture Notes in Computer Science 7392, 2012, pp. 416-427
• Super-fast distributed algorithms for metric facility location
  Andrew Berns, James Hegeman, Sriram V. Pemmaraju
  Lecture Notes in Computer Science 7392, 2012, pp. 428-439
• Preventing unraveling in social networks: The anchored k-core problem
  Kshipra Bhawalkar, Jon Kleinberg, Kevin Lewi, Tim Roughgarden, Aneesh Sharma
  Lecture Notes in Computer Science 7392, 2012, pp. 440-451
• Edge fault tolerance on sparse networks
  Nishanth Chandran, Juan Garay, Rafail Ostrovsky
  Lecture Notes in Computer Science 7392, 2012, pp. 452-463
• Incentive ratios of Fisher markets
  Ning Chen, Xiaotie Deng, Hongyang Zhang, Jie Zhang
  Lecture Notes in Computer Science 7392, 2012, pp. 464-475
• Computational complexity of traffic hijacking under BGP and S-BGP
  Marco Chiesa, Giuseppe Di Battista, Thomas Erlebach, Maurizio Patrignani
  Lecture Notes in Computer Science 7392, 2012, pp. 476-487
• Efficiency-revenue trade-offs in auctions
  Ilias Diakonikolas, Christos Papadimitriou, George Pierrakos, Yaron Singer
  Lecture Notes in Computer Science 7392, 2012, pp. 488-499
• Deterministic network exploration by anonymous silent agents with local traffic reports
  Yoann Dieudonné, Andrzej Pelc
  Lecture Notes in Computer Science 7392, 2012, pp. 500-512
• A QPTAS for \epsilon-envy-free profit-maximizing pricing on line graphs
  Khaled Elbassioni
  Lecture Notes in Computer Science 7392, 2012, pp. 513-524
• Minimizing rosenthal potential in multicast games
  Fedor V. Fomin, Petr Golovach, Jesper Nederlof, Michaƚ Pilipczuk
  Lecture Notes in Computer Science 7392, 2012, pp. 525-536
• Multiparty proximity testing with dishonest majority from equality testing
  Ran Gelles, Rafail Ostrovsky, Kina Winoto
  Lecture Notes in Computer Science 7392, 2012, pp. 537-548
• Anonymous card shuffling and its applications to parallel mixnets
  Michael T. Goodrich, Michael Mitzenmacher
  Lecture Notes in Computer Science 7392, 2012, pp. 549-560
• Byzantine agreement with a rational adversary
  Adam Groce, Jonathan Katz, Aishwarya Thiruvengadam, Vassilis Zikas
  Lecture Notes in Computer Science 7392, 2012, pp. 561-572