Coverart for item
The Resource Automata, languages, and programming : 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part II, Artur Czumaj...[et al.] (eds.), (electronic book)

Automata, languages, and programming : 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part II, Artur Czumaj...[et al.] (eds.), (electronic book)

Label
Automata, languages, and programming : 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part II
Title
Automata, languages, and programming
Title remainder
39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings
Title number
Part II
Statement of responsibility
Artur Czumaj...[et al.] (eds.)
Title variation
ICALP 2012
Creator
Contributor
Subject
Genre
Language
eng
Member of
Cataloging source
GW5XE
Dewey number
005.1/3
Index
index present
LC call number
QA76.7
LC item number
.I58 2012
Literary form
non fiction
http://bibfra.me/vocab/lite/meetingDate
2012
http://bibfra.me/vocab/lite/meetingName
International Colloquium on Automata, Languages, and Programming
Nature of contents
  • dictionaries
  • bibliography
http://library.link/vocab/relatedWorkOrContributorName
Czumaj, Artur
Series statement
  • Lecture notes in computer science,
  • Advanced research in computing and software science
  • LNCS sublibrary. SL 1, Theoretical computer science and general issues
Series volume
7392
http://library.link/vocab/subjectName
  • Programming languages (Electronic computers)
  • Computer programming
Label
Automata, languages, and programming : 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part II, Artur Czumaj...[et al.] (eds.), (electronic book)
Instantiates
Publication
Note
International conference proceedings
Antecedent source
unknown
Bibliography note
Includes bibliographical references and index
Color
multicolored
Contents
  • 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
  • On Multiple Keyword Sponsored Search Auctions with Budgets
  • 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
  • Riccardo Colini-Baldeschi, Monika Henzinger, Stefano Leonardi and Martin Starnberger
  • 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
  • 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
  • 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
  • Minimizing Expected Termination Time in One-Counter Markov Decision Processes
  • 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
  • Tomáš Brázdil, Antonín Kučera, Petr Novotný and Dominik Wojtczak
  • Coalgebraic Predicate Logic
  • Tadeusz Litak, Dirk Pattinson, Katsuhiko Sano and Lutz Schröder
  • 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
  • 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
  • Algorithmic Games for Full Ground References
  • 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
  • Andrzej S. Murawski and Nikos Tzevelekos
  • 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
  • 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
  • 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
  • Deterministic Network Exploration by Anonymous Silent Agents with Local Traffic Reports
  • 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
  • Yoann Dieudonné and Andrzej Pelc
  • David Peleg, Liam Roditty and Elad Tal
  • 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
Control code
SPR797967277
Dimensions
unknown
Extent
1 online resource.
File format
unknown
Form of item
online
Isbn
9783642315855
Isbn Type
(electronic bk.)
Level of compression
unknown
Quality assurance targets
not applicable
Reformatting quality
unknown
Reproduction note
Electronic resource.
Sound
unknown sound
Specific material designation
remote
Label
Automata, languages, and programming : 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part II, Artur Czumaj...[et al.] (eds.), (electronic book)
Publication
Note
International conference proceedings
Antecedent source
unknown
Bibliography note
Includes bibliographical references and index
Color
multicolored
Contents
  • 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
  • On Multiple Keyword Sponsored Search Auctions with Budgets
  • 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
  • Riccardo Colini-Baldeschi, Monika Henzinger, Stefano Leonardi and Martin Starnberger
  • 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
  • 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
  • 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
  • Minimizing Expected Termination Time in One-Counter Markov Decision Processes
  • 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
  • Tomáš Brázdil, Antonín Kučera, Petr Novotný and Dominik Wojtczak
  • Coalgebraic Predicate Logic
  • Tadeusz Litak, Dirk Pattinson, Katsuhiko Sano and Lutz Schröder
  • 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
  • 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
  • Algorithmic Games for Full Ground References
  • 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
  • Andrzej S. Murawski and Nikos Tzevelekos
  • 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
  • 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
  • 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
  • Deterministic Network Exploration by Anonymous Silent Agents with Local Traffic Reports
  • 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
  • Yoann Dieudonné and Andrzej Pelc
  • David Peleg, Liam Roditty and Elad Tal
  • 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
Control code
SPR797967277
Dimensions
unknown
Extent
1 online resource.
File format
unknown
Form of item
online
Isbn
9783642315855
Isbn Type
(electronic bk.)
Level of compression
unknown
Quality assurance targets
not applicable
Reformatting quality
unknown
Reproduction note
Electronic resource.
Sound
unknown sound
Specific material designation
remote

Library Locations

Processing Feedback ...