Abstract is missing.
- On Multiple Keyword Sponsored Search Auctions with BudgetsRiccardo Colini-Baldeschi, Monika Henzinger, Stefano Leonardi, Martin Starnberger. 1-12 [doi]
- A Theory Independent Curry-De Bruijn-Howard CorrespondenceGilles Dowek. 13-15 [doi]
- Standing on the Shoulders of a Giant - One Persons Experience of Turings Impact (Summary of the Alan M. Turing Lecture)David Harel. 16-22 [doi]
- Session Types and Distributed ComputingKohei Honda. 23 [doi]
- Algorithms, Graph Theory, and the Solution of Laplacian Linear EquationsDaniel A. Spielman. 24-26 [doi]
- Randomized Mechanisms for Multi-unit Auctions - (Extended Abstract)Berthold Vöcking. 27-29 [doi]
- Algebraic Synchronization Trees and ProcessesLuca Aceto, Arnaud Carayol, Zoltán Ésik, Anna Ingólfsdóttir. 30-41 [doi]
- Streaming Tree TransducersRajeev Alur, Loris D'Antoni. 42-53 [doi]
- Causal Graph DynamicsPablo Arrighi, Gilles Dowek. 54-66 [doi]
- Degree Lower Bounds of Tower-Type for Approximating Formulas with Parity QuantifiersAlbert Atserias, Anuj Dawar. 67-78 [doi]
- Monadic Datalog ContainmentMichael Benedikt, Pierre Bourhis, Pierre Senellart. 79-91 [doi]
- A Machine-Independent Characterization of Timed LanguagesMikolaj Bojanczyk, Slawomir Lasota. 92-103 [doi]
- Regular Languages of Infinite Trees That Are Boolean Combinations of Open SetsMikolaj Bojanczyk, Thomas Place. 104-115 [doi]
- Toward Model Theory with Data ValuesMikolaj Bojanczyk, Thomas Place. 116-127 [doi]
- Robust Reachability in Timed Automata: A Game-Based ApproachPatricia Bouyer, Nicolas Markey, Ocan Sankur. 128-140 [doi]
- Minimizing Expected Termination Time in One-Counter Markov Decision ProcessesTomás Brázdil, Antonín Kucera, Petr Novotný, Dominik Wojtczak. 141-152 [doi]
- Prefix Rewriting for Nested-Words and Collapsible Pushdown AutomataChristopher H. Broadbent. 153-164 [doi]
- A Saturation Method for Collapsible Pushdown SystemsChristopher H. Broadbent, Arnaud Carayol, Matthew Hague, Olivier Serre. 165-176 [doi]
- Regular Languages Are Church-Rosser CongruentialVolker Diekert, Manfred Kufleitner, Klaus Reinhardt, Tobias Walter. 177-188 [doi]
- Time and Parallelizability Results for Parity Games with Bounded TreewidthJohn Fearnley, Sven Schewe. 189-200 [doi]
- Nominal Completion for Rewrite Systems with BindersMaribel Fernández, Albert Rubio. 201-213 [doi]
- Discrete Generalised Polynomial Functors - (Extended Abstract)Marcelo P. Fiore. 214-226 [doi]
- Computing Game Metrics on Markov Decision ProcessesHongfei Fu. 227-238 [doi]
- Deciding First Order Properties of MatroidsTomás Gavenciak, Daniel Král, Sang-il Oum. 239-250 [doi]
- Pebble Games with Algebraic RulesAnuj Dawar, Bjarki Holm. 251-262 [doi]
- Exponential Lower Bounds and Separation for Query RewritingStanislav Kikot, Roman Kontchakov, Vladimir V. Podolskii, Michael Zakharyaschev. 263-274 [doi]
- Lattices of Logical Fragments over Words - (Extended Abstract)Manfred Kufleitner, Alexander Lauser. 275-286 [doi]
- On the Expressive Power of Cost Logics over Infinite WordsDenis Kuperberg, Michael Vanden Boom. 287-298 [doi]
- Coalgebraic Predicate LogicTadeusz Litak, Dirk Pattinson, Katsuhiko Sano, Lutz Schröder. 299-311 [doi]
- Algorithmic Games for Full Ground ReferencesAndrzej S. Murawski, Nikos Tzevelekos. 312-324 [doi]
- Two-Level Game Semantics, Intersection Types, and Recursion SchemesC.-H. Luke Ong, Takeshi Tsukada. 325-336 [doi]
- An Automata-Theoretic Model of Idealized Algol - (Extended Abstract)Uday S. Reddy, Brian P. Dunphy. 337-350 [doi]
- Towards a Unified Theory of Operational and Axiomatic SemanticsGrigore Rosu, Andrei Stefanescu. 351-363 [doi]
- Loader and Urzyczyn Are Logically RelatedSylvain Salvati, Giulio Manzonetto, Mai Gehrke, Henk Barendregt. 364-376 [doi]
- Languages of Profinite Words and the Limitedness ProblemSzymon Torunczyk. 377-389 [doi]
- The Complexity of Mean-Payoff Automaton ExpressionYaron Velner. 390-402 [doi]
- On the Locality of Some NP-Complete ProblemsLeonid Barenboim. 403-415 [doi]
- Growing Half-Balls: Minimizing Storage and Communication Costs in CDNsReuven Bar-Yehuda, Erez Kantor, Shay Kutten, Dror Rawitz. 416-427 [doi]
- Super-Fast Distributed Algorithms for Metric Facility LocationAndrew Berns, James Hegeman, Sriram V. Pemmaraju. 428-439 [doi]
- Preventing Unraveling in Social Networks: The Anchored k-Core ProblemKshipra Bhawalkar, Jon M. Kleinberg, Kevin Lewi, Tim Roughgarden, Aneesh Sharma. 440-451 [doi]
- Edge Fault Tolerance on Sparse NetworksNishanth Chandran, Juan A. Garay, Rafail Ostrovsky. 452-463 [doi]
- Incentive Ratios of Fisher MarketsNing Chen, Xiaotie Deng, Hongyang Zhang, Jie Zhang. 464-475 [doi]
- Computational Complexity of Traffic Hijacking under BGP and S-BGPMarco Chiesa, Giuseppe Di Battista, Thomas Erlebach, Maurizio Patrignani. 476-487 [doi]
- Efficiency-Revenue Trade-Offs in AuctionsIlias Diakonikolas, Christos H. Papadimitriou, George Pierrakos, Yaron Singer. 488-499 [doi]
- Deterministic Network Exploration by Anonymous Silent Agents with Local Traffic ReportsYoann Dieudonné, Andrzej Pelc. 500-512 [doi]
- A QPTAS for [InlineEquation not available: see fulltext.]-Envy-Free Profit-Maximizing Pricing on Line GraphsKhaled M. Elbassioni. 513-524 [doi]
- Minimizing Rosenthal Potential in Multicast GamesFedor V. Fomin, Petr A. Golovach, Jesper Nederlof, Michal Pilipczuk. 525-536 [doi]
- Multiparty Proximity Testing with Dishonest Majority from Equality TestingRan Gelles, Rafail Ostrovsky, Kina Winoto. 537-548 [doi]
- Anonymous Card Shuffling and Its Applications to Parallel MixnetsMichael T. Goodrich, Michael Mitzenmacher. 549-560 [doi]
- Byzantine Agreement with a Rational AdversaryAdam Groce, Jonathan Katz, Aishwarya Thiruvengadam, Vassilis Zikas. 561-572 [doi]
- Random Hyperbolic Graphs: Degree Sequence and Clustering - (Extended Abstract)Luca Gugelmann, Konstantinos Panagiotou, Ueli Peter. 573-585 [doi]
- Topology-Aware VM Migration in Bandwidth Oversubscribed Datacenter NetworksNavendu Jain, Ishai Menache, Joseph Naor, F. Bruce Shepherd. 586-597 [doi]
- Counting Arbitrary Subgraphs in Data StreamsDaniel M. Kane, Kurt Mehlhorn, Thomas Sauerwald, He Sun 0001. 598-609 [doi]
- k-Chordal Graphs: From Cops and Robber to Compact Routing via TreewidthAdrian Kosowski, Bi Li 0004, Nicolas Nisse, Karol Suchan. 610-622 [doi]
- Contention Issues in Congestion GamesElias Koutsoupias, Katia Papakonstantinopoulou. 623-635 [doi]
- Online Mechanism Design (Randomized Rounding on the Fly)Piotr Krysta, Berthold Vöcking. 636-647 [doi]
- Online Packing with Gradually Improving Capacity Estimations and Applications to Network Lifetime MaximizationMarcel Ochel, Klaus Radke, Berthold Vöcking. 648-659 [doi]
- Distributed Algorithms for Network Diameter and GirthDavid Peleg, Liam Roditty, Elad Tal. 660-672 [doi]