| Description |
1 online resource |
| Series |
Lecture notes in computer science, 0302-9743 ; 7392 |
|
Advanced research in computing and software science |
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
|
Lecture notes in computer science ; 7392.
|
|
Lecture notes in computer science. Advanced research in computing and software science.
|
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues.
|
| Contents |
On Multiple Keyword Sponsored Search Auctions with Budgets / Riccardo Colini-Baldeschi, Monika Henzinger, Stefano Leonardi and Martin Starnberger -- A Theory Independent Curry-De Bruijn-Howard Correspondence / Gilles Dowek -- Standing on the Shoulders of a Giant: One Persons Experience of Turings Impact (Summary of the Alan M. Turing Lecture) / David Harel -- Session Types and Distributed Computing / Kohei Honda -- Algorithms, Graph Theory, and the Solution of Laplacian Linear Equations / Daniel A. Spielman -- Randomized Mechanisms for Multi-unit Auctions (Extended Abstract) / Berthold Vöcking -- Algebraic Synchronization Trees and Processes / Luca Aceto, Arnaud Carayol, Zoltán Ésik and Anna Ingólfsdóttir -- Streaming Tree Transducers / Rajeev Alur and Loris D'Antoni -- Causal Graph Dynamics / Pablo Arrighi and Gilles Dowek -- Degree Lower Bounds of Tower-Type for Approximating Formulas with Parity Quantifiers / Albert Atserias and Anuj Dawar -- Monadic Datalog Containment / Michael Benedikt, Pierre Bourhis and Pierre Senellart -- A Machine-Independent Characterization of Timed Languages / Mikołaj Bojańczyk and Sławomir Lasota -- Regular Languages of Infinite Trees That Are Boolean Combinations of Open Sets / Mikołaj Bojańczyk and Thomas Place -- Toward Model Theory with Data Values / Mikołaj Bojańczyk and Thomas Place -- Robust Reachability in Timed Automata: A Game-Based Approach / Patricia Bouyer, Nicolas Markey and Ocan Sankur |
|
Minimizing Expected Termination Time in One-Counter Markov Decision Processes / Tomáš Brázdil, Antonín Kučera, Petr Novotný and Dominik Wojtczak -- Prefix Rewriting for Nested-Words and Collapsible Pushdown Automata / Christopher Broadbent -- A Saturation Method for Collapsible Pushdown Systems / Chris Broadbent, Arnaud Carayol, Matthew Hague and Olivier Serre -- Regular Languages Are Church-Rosser Congruential / Volker Diekert, Manfred Kufleitner, Klaus Reinhardt and Tobias Walter -- Time and Parallelizability Results for Parity Games with Bounded Treewidth / John Fearnley and Sven Schewe -- Nominal Completion for Rewrite Systems with Binders / Maribel Fernández and Albert Rubio -- Discrete Generalised Polynomial Functors (Extended Abstract) / Marcelo Fiore -- Computing Game Metrics on Markov Decision Processes / Hongfei Fu -- Deciding First Order Properties of Matroids / Tomáš Gavenčiak, Daniel Král and Sang-il Oum -- Pebble Games with Algebraic Rules / Anuj Dawar and Bjarki Holm -- Exponential Lower Bounds and Separation for Query Rewriting / Stanislav Kikot, Roman Kontchakov, Vladimir Podolskii and Michael Zakharyaschev -- Lattices of Logical Fragments over Words (Extended Abstract) / Manfred Kufleitner and Alexander Lauser -- On the Expressive Power of Cost Logics over Infinite Words / Denis Kuperberg and Michael Vanden Boom -- Coalgebraic Predicate Logic / Tadeusz Litak, Dirk Pattinson, Katsuhiko Sano and Lutz Schröder |
|
Algorithmic Games for Full Ground References / Andrzej S. Murawski and Nikos Tzevelekos -- Two-Level Game Semantics, Intersection Types, and Recursion Schemes / C.-H. Luke Ong and Takeshi Tsukada -- An Automata-Theoretic Model of Idealized Algol (Extended Abstract) / Uday S. Reddy and Brian P. Dunphy -- Towards a Unified Theory of Operational and Axiomatic Semantics / Grigore Roşu and Andrei Ştefănescu -- Loader and Urzyczyn Are Logically Related / Sylvain Salvati, Giulio Manzonetto, Mai Gehrke and Henk Barendregt -- Languages of Profinite Words and the Limitedness Problem / Szymon Toruńczyk -- The Complexity of Mean-Payoff Automaton Expression / Yaron Velner -- On the Locality of Some NP-Complete Problems / Leonid Barenboim -- Growing Half-Balls: Minimizing Storage and Communication Costs in CDNs / Reuven Bar-Yehuda, Erez Kantor, Shay Kutten and Dror Rawitz -- Super-Fast Distributed Algorithms for Metric Facility Location / Andrew Berns, James Hegeman and Sriram V. Pemmaraju -- Preventing Unraveling in Social Networks: The Anchored k-Core Problem / Kshipra Bhawalkar, Jon Kleinberg, Kevin Lewi, Tim Roughgarden and Aneesh Sharma -- Edge Fault Tolerance on Sparse Networks / Nishanth Chandran, Juan Garay and Rafail Ostrovsky -- Incentive Ratios of Fisher Markets / Ning Chen, Xiaotie Deng, Hongyang Zhang and Jie Zhang -- Computational Complexity of Traffic Hijacking under BGP and S-BGP / Marco Chiesa, Giuseppe Di Battista, Thomas Erlebach and Maurizio Patrignani -- Efficiency-Revenue Trade-Offs in Auctions / Ilias Diakonikolas, Christos Papadimitriou, George Pierrakos and Yaron Singer |
|
Deterministic Network Exploration by Anonymous Silent Agents with Local Traffic Reports / Yoann Dieudonné and Andrzej Pelc -- A QPTAS for -Envy-Free Profit-Maximizing Pricing on Line Graphs / Khaled Elbassioni -- Minimizing Rosenthal Potential in Multicast Games / Fedor V. Fomin, Petr Golovach, Jesper Nederlof and Michał Pilipczuk -- Multiparty Proximity Testing with Dishonest Majority from Equality Testing / Ran Gelles, Rafail Ostrovsky and Kina Winoto -- Anonymous Card Shuffling and Its Applications to Parallel Mixnets / Michael T. Goodrich and Michael Mitzenmacher -- Byzantine Agreement with a Rational Adversary / Adam Groce, Jonathan Katz, Aishwarya Thiruvengadam and Vassilis Zikas -- Random Hyperbolic Graphs: Degree Sequence and Clustering (Extended Abstract) / Luca Gugelmann, Konstantinos Panagiotou and Ueli Peter -- Topology-Aware VM Migration in Bandwidth Oversubscribed Datacenter Networks / Navendu Jain, Ishai Menache, Joseph (Seffi) Naor and F. Bruce Shepherd -- Counting Arbitrary Subgraphs in Data Streams / Daniel M. Kane, Kurt Mehlhorn, Thomas Sauerwald and He Sun -- k-Chordal Graphs: From Cops and Robber to Compact Routing via Treewidth / Adrian Kosowski, Bi Li, Nicolas Nisse and Karol Suchan -- Contention Issues in Congestion Games / Elias Koutsoupias and Katia Papakonstantinopoulou -- Online Mechanism Design (Randomized Rounding on the Fly) / Piotr Krysta and Berthold Vöcking -- Online Packing with Gradually Improving Capacity Estimations and Applications to Network Lifetime Maximization / Marcel Ochel, Klaus Radke and Berthold Vöcking -- Distributed Algorithms for Network Diameter and Girth / David Peleg, Liam Roditty and Elad Tal |
| Summary |
This two-volume set of LNCS 7391 and LNCS 7392 constitutes the refereed proceedings of the 39th International Colloquium on Automata, Languages and Programming, ICALP 2012, held in Warwick, UK, in July 2012. The total of 123 revised full papers presented in this volume were carefully reviewed and selected from 432 submissions. They are organized in three tracks focussing on algorithms, complexity and games; logic, semantics, automata and theory of programming; and foundations of networked computation |
| Analysis |
Computer science |
|
Computer Communication Networks |
|
Computer software |
|
Computational complexity |
|
Information storage and retrieval systems |
|
Algorithm Analysis and Problem Complexity |
|
Computation by Abstract Devices |
|
Information Storage and Retrieval |
|
Information Systems Applications (incl. Internet) |
|
Discrete Mathematics in Computer Science |
| Bibliography |
Includes bibliographical references and index |
| Notes |
English |
| Subject |
Programming languages (Electronic computers) -- Congresses
|
|
Computer programming -- Congresses
|
|
Informatique.
|
|
Computer programming
|
|
Programming languages (Electronic computers)
|
| Genre/Form |
Conference papers and proceedings
|
|
Software.
|
| Form |
Electronic book
|
| Author |
Czumaj, Artur
|
| ISBN |
9783642315855 |
|
3642315852 |
|
3642315844 |
|
9783642315848 |
|
9783642315862 |
|
3642315860 |
|
