Coverart for item
The Resource Automata, languages, and programming : 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part II, Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, Elias Koutsoupias (eds.)

Automata, languages, and programming : 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part II, Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, Elias Koutsoupias (eds.)

Label
Automata, languages, and programming : 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part II
Title
Automata, languages, and programming
Title remainder
41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings
Title number
Part II
Statement of responsibility
Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, Elias Koutsoupias (eds.)
Title variation
ICALP 2014
Creator
Contributor
Editor
Provider
Subject
Genre
Language
eng
Summary
This two-volume set of LNCS 8572 and LNCS 8573 constitutes the refereed proceedings of the 41st International Colloquium on Automata, Languages and Programming, ICALP 2014, held in Copenhagen, Denmark, in July 2014. The total of 136 revised full papers presented together with 4 invited talks were carefully reviewed and selected from 484 submissions. The papers are organized in three tracks focussing on Algorithms, Complexity, and Games, Logic, Semantics, Automata, and Theory of Programming, Foundations of Networked Computation
Member of
Cataloging source
GW5XE
Image bit depth
0
LC call number
QA76.7
Literary form
non fiction
http://bibfra.me/vocab/lite/meetingDate
2014
http://bibfra.me/vocab/lite/meetingName
International Colloquium on Automata, Languages, and Programming
Nature of contents
dictionaries
http://library.link/vocab/relatedWorkOrContributorName
  • SpringerLink
  • Esparza, Javier
Series statement
Lecture Notes in Computer Science,
Series volume
8573
http://library.link/vocab/subjectName
  • Computer Science
  • Algorithm Analysis and Problem Complexity
  • Computation by Abstract Devices
  • Computer Communication Networks
  • Information Systems Applications (incl. Internet)
  • Programming languages (Electronic computers)
  • Computer programming
  • Machine theory
  • Computer programming
  • Machine theory
  • Programming languages (Electronic computers)
Label
Automata, languages, and programming : 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part II, Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, Elias Koutsoupias (eds.)
Instantiates
Publication
Note
  • International conference proceedings
  • Includes author index
Antecedent source
mixed
Carrier category
online resource
Carrier category code
cr
Carrier MARC source
rdacarrier
Color
not applicable
Content category
text
Content type code
txt
Content type MARC source
rdacontent
Contents
Track B: Logic, Semantics, Automata, and Theory of Programming -- Symmetric Groups and Quotient Complexity of Boolean Operations -- Handling Infinitely Branching WSTS -- Transducers with Origin Information -- Weak MSO+U with Path Quantifiers over Infinite Trees -- On the Decidability of MSO+U on Infinite Trees -- A Coalgebraic Foundation for Coinductive Union Types -- Turing Degrees of Limit Sets of Cellular Automata -- On the Complexity of Temporal-Logic Path Checking -- Parameterised Linearisability -- Games with a Weak Adversary -- The Complexity of Ergodic Mean-payoff Games -- Toward a Structure Theory of Regular Infinitary Trace Languages -- Unary Pushdown Automata and Straight-Line Programs -- Robustness against Power is PSpace-complete -- A Nivat Theorem for Weighted Timed Automata and Weighted Relative Distance Logic -- Computability in Anonymous Networks: Revocable vs. Irrecovable Outputs -- Coalgebraic Weak Bisimulation from Recursive Equations over Monads -- Piecewise Boolean Algebras and Their Domains -- Between Linearizability and Quiescent Consistency: Quantitative Quiescent Consistency -- Bisimulation Equivalence of First-Order Grammars -- Context Unification is in PSPACE -- Monodic Fragments of Probabilistic First-Order Logic -- Stability and Complexity of Minimising Probabilistic Automata -- Kleene Algebra with Equations -- All–Instances Termination of Chase is Undecidable -- Non-uniform Polytime Computation in the Infinitary Affine Lambda-Calculus -- On the Positivity Problem for Simple Linear Recurrence Sequences -- Ultimate Positivity is Decidable for Simple Linear Recurrence Sequences -- Going Higher in the First-Order Quantifier Alternation Hierarchy on Words -- Hardness Results for Intersection Non-Emptiness -- Branching Bisimilarity Checking for PRS -- Track C: Foundations of Networked Computing Labeling Schemes for Bounded Degree Graphs -- Bounded-Angle Spanning Tree: Modeling Networks with Angular Constraints -- Distributed Computing on Core-Periphery Networks: Axiom-Based Design 399 -- Fault-Tolerant Rendezvous in Networks -- Data Delivery by Energy-Constrained Mobile Agents on a Line -- The Power of Two Choices in Distributed Voting -- Jamming-Resistant Learning in Wireless Networks -- Facility Location in Evolving Metrics -- Solving the ANTS Problem with Asynchronous Finite State Machines -- Near-Optimal Distributed Approximation of Minimum-Weight Connected Dominating Set -- Randomized Rumor Spreading in Dynamic Graphs -- Online Independent Set Beyond the Worst-Case: Secretaries, Prophets, and Periods -- Optimal Competitiveness for Symmetric Rectilinear Steiner Arborescence and Related Problems -- Orienting Fully Dynamic Graphs with Worst-Case Time Bounds -- Does Adding More Agents Make a Difference? A Case Study of Cover Time for the Rotor-Router -- The Melbourne Shuffle: Improving Oblivious Storage in the Cloud -- Sending Secrets Swiftly: Approximation Algorithms for Generalized Multicast Problems -- Bypassing Erdos’ Girth Conjecture: Hybrid Stretch and Sourcewise Spanners
Dimensions
unknown
Extent
1 online resource (xxx, 624 pages)
File format
multiple file formats
Form of item
  • online
  • electronic
Isbn
9783662439517
Level of compression
uncompressed
Media category
computer
Media MARC source
rdamedia
Media type code
c
Other control number
10.1007/978-3-662-43951-7
Other physical details
illustrations.
Quality assurance targets
absent
Reformatting quality
access
Specific material designation
remote
System control number
  • (OCoLC)881682993
  • (OCoLC)ocn881682993
Label
Automata, languages, and programming : 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part II, Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, Elias Koutsoupias (eds.)
Publication
Note
  • International conference proceedings
  • Includes author index
Antecedent source
mixed
Carrier category
online resource
Carrier category code
cr
Carrier MARC source
rdacarrier
Color
not applicable
Content category
text
Content type code
txt
Content type MARC source
rdacontent
Contents
Track B: Logic, Semantics, Automata, and Theory of Programming -- Symmetric Groups and Quotient Complexity of Boolean Operations -- Handling Infinitely Branching WSTS -- Transducers with Origin Information -- Weak MSO+U with Path Quantifiers over Infinite Trees -- On the Decidability of MSO+U on Infinite Trees -- A Coalgebraic Foundation for Coinductive Union Types -- Turing Degrees of Limit Sets of Cellular Automata -- On the Complexity of Temporal-Logic Path Checking -- Parameterised Linearisability -- Games with a Weak Adversary -- The Complexity of Ergodic Mean-payoff Games -- Toward a Structure Theory of Regular Infinitary Trace Languages -- Unary Pushdown Automata and Straight-Line Programs -- Robustness against Power is PSpace-complete -- A Nivat Theorem for Weighted Timed Automata and Weighted Relative Distance Logic -- Computability in Anonymous Networks: Revocable vs. Irrecovable Outputs -- Coalgebraic Weak Bisimulation from Recursive Equations over Monads -- Piecewise Boolean Algebras and Their Domains -- Between Linearizability and Quiescent Consistency: Quantitative Quiescent Consistency -- Bisimulation Equivalence of First-Order Grammars -- Context Unification is in PSPACE -- Monodic Fragments of Probabilistic First-Order Logic -- Stability and Complexity of Minimising Probabilistic Automata -- Kleene Algebra with Equations -- All–Instances Termination of Chase is Undecidable -- Non-uniform Polytime Computation in the Infinitary Affine Lambda-Calculus -- On the Positivity Problem for Simple Linear Recurrence Sequences -- Ultimate Positivity is Decidable for Simple Linear Recurrence Sequences -- Going Higher in the First-Order Quantifier Alternation Hierarchy on Words -- Hardness Results for Intersection Non-Emptiness -- Branching Bisimilarity Checking for PRS -- Track C: Foundations of Networked Computing Labeling Schemes for Bounded Degree Graphs -- Bounded-Angle Spanning Tree: Modeling Networks with Angular Constraints -- Distributed Computing on Core-Periphery Networks: Axiom-Based Design 399 -- Fault-Tolerant Rendezvous in Networks -- Data Delivery by Energy-Constrained Mobile Agents on a Line -- The Power of Two Choices in Distributed Voting -- Jamming-Resistant Learning in Wireless Networks -- Facility Location in Evolving Metrics -- Solving the ANTS Problem with Asynchronous Finite State Machines -- Near-Optimal Distributed Approximation of Minimum-Weight Connected Dominating Set -- Randomized Rumor Spreading in Dynamic Graphs -- Online Independent Set Beyond the Worst-Case: Secretaries, Prophets, and Periods -- Optimal Competitiveness for Symmetric Rectilinear Steiner Arborescence and Related Problems -- Orienting Fully Dynamic Graphs with Worst-Case Time Bounds -- Does Adding More Agents Make a Difference? A Case Study of Cover Time for the Rotor-Router -- The Melbourne Shuffle: Improving Oblivious Storage in the Cloud -- Sending Secrets Swiftly: Approximation Algorithms for Generalized Multicast Problems -- Bypassing Erdos’ Girth Conjecture: Hybrid Stretch and Sourcewise Spanners
Dimensions
unknown
Extent
1 online resource (xxx, 624 pages)
File format
multiple file formats
Form of item
  • online
  • electronic
Isbn
9783662439517
Level of compression
uncompressed
Media category
computer
Media MARC source
rdamedia
Media type code
c
Other control number
10.1007/978-3-662-43951-7
Other physical details
illustrations.
Quality assurance targets
absent
Reformatting quality
access
Specific material designation
remote
System control number
  • (OCoLC)881682993
  • (OCoLC)ocn881682993

Library Locations

  • African Studies LibraryBorrow it
    771 Commonwealth Avenue, 6th Floor, Boston, MA, 02215, US
    42.350723 -71.108227
  • Alumni Medical LibraryBorrow it
    72 East Concord Street, Boston, MA, 02118, US
    42.336388 -71.072393
  • Astronomy LibraryBorrow it
    725 Commonwealth Avenue, 6th Floor, Boston, MA, 02445, US
    42.350259 -71.105717
  • Fineman and Pappas Law LibrariesBorrow it
    765 Commonwealth Avenue, Boston, MA, 02215, US
    42.350979 -71.107023
  • Frederick S. Pardee Management LibraryBorrow it
    595 Commonwealth Avenue, Boston, MA, 02215, US
    42.349626 -71.099547
  • Howard Gotlieb Archival Research CenterBorrow it
    771 Commonwealth Avenue, 5th Floor, Boston, MA, 02215, US
    42.350723 -71.108227
  • Mugar Memorial LibraryBorrow it
    771 Commonwealth Avenue, Boston, MA, 02215, US
    42.350723 -71.108227
  • Music LibraryBorrow it
    771 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US
    42.350723 -71.108227
  • Pikering Educational Resources LibraryBorrow it
    2 Silber Way, Boston, MA, 02215, US
    42.349804 -71.101425
  • School of Theology LibraryBorrow it
    745 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US
    42.350494 -71.107235
  • Science & Engineering LibraryBorrow it
    38 Cummington Mall, Boston, MA, 02215, US
    42.348472 -71.102257
  • Stone Science LibraryBorrow it
    675 Commonwealth Avenue, Boston, MA, 02445, US
    42.350103 -71.103784
Processing Feedback ...