default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID40th ICALP 2013: Riga, Latvia - Part I
- Fedor V. Fomin, Rusins Freivalds, Marta Z. Kwiatkowska, David Peleg:
Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part II. Lecture Notes in Computer Science 7966, Springer 2013, ISBN 978-3-642-39211-5
EATCS Lecture
- Jon M. Kleinberg:
Algorithms, Networks, and Social Phenomena. 1-3
Invited Talks
- Susanne Albers:
Recent Advances for a Classical Scheduling Problem. 4-14 - Shaull Almagor
, Udi Boker, Orna Kupferman:
Formalizing and Reasoning about Quality. 15-27 - Dániel Marx:
The Square Root Phenomenon in Planar Graphs. 28 - Paul G. Spirakis, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos:
A Guided Tour in Random Intersection Graphs. 29-35 - Peter Widmayer:
To Be Uncertain Is Uncomfortable, But to Be Certain Is Ridiculous. 36
Track B - Logic, Semantics, Automata and Theory of Programming
- Rajeev Alur, Mukund Raghothaman:
Decision Problems for Additive Regular Functions. 37-48 - Gilles Barthe, Federico Olmedo:
Beyond Differential Privacy: Composition Theorems and Relational Logic for f-divergences between Probabilistic Programs. 49-60 - Nicolas Basset:
A Maximal Entropy Stochastic Process for a Timed Automaton, . 61-73 - Saguy Benaim, Michael Benedikt, Witold Charatonik, Emanuel Kieronski, Rastislav Lenhardt, Filip Mazowiecki, James Worrell:
Complexity of Two-Variable Logic on Finite Trees. 74-88 - Udi Boker, Denis Kuperberg, Orna Kupferman, Michal Skrzypczak:
Nondeterminism in the Presence of a Diverse or Unknown Future. 89-100 - Facundo Carreiro, Daniel Gorín, Lutz Schröder:
Coalgebraic Announcement Logics. 101-112 - Emilie Charlier, Teturo Kamae, Svetlana Puzynina, Luca Q. Zamboni:
Self-shuffling Words. 113-124 - Hubie Chen, Dániel Marx:
Block-Sorted Quantified Conjunctive Queries. 125-136 - Rémy Chrétien, Véronique Cortier, Stéphanie Delaune:
From Security Protocols to Pushdown Automata. 137-149 - Wojciech Czerwinski, Wim Martens, Tomás Masopust:
Efficient Separability of Regular Languages by Subsequences and Suffixes. 150-161 - Stéphane Demri, Amit Kumar Dhar, Arnaud Sangnier:
On the Complexity of Verifying Regular Properties on Flat Counter Systems, . 162-173 - Pierre-Malo Deniélou, Nobuko Yoshida:
Multiparty Compatibility in Communicating Automata: Characterisation and Synthesis of Global Session Types. 174-186 - Roberto Di Cosmo, Jacopo Mauro, Stefano Zacchiroli, Gianluigi Zavattaro:
Component Reconfiguration in the Presence of Conflicts. 187-198 - Kousha Etessami, Alistair Stewart, Mihalis Yannakakis:
Stochastic Context-Free Grammars, Regular Languages, and Newton's Method. 199-211 - John Fearnley, Marcin Jurdzinski:
Reachability in Two-Clock Timed Automata Is PSPACE-Complete. 212-223 - Oliver Friedmann, Felix Klaedtke, Martin Lange:
Ramsey Goes Visibly Pushdown. 224-237 - Yuxi Fu:
Checking Equality and Regularity for Normed BPA with Silent Moves. 238-249 - Robert Ganian, Petr Hlinený, Daniel Král', Jan Obdrzálek, Jarett Schwartz, Jakub Teska:
FO Model Checking of Interval Graphs. 250-262 - Marcus Gelderie:
Strategy Composition in Compositional Games. 263-274 - Blaise Genest, Hugo Gimbert, Anca Muscholl, Igor Walukiewicz:
Asynchronous Games over Tree Architectures. 275-286 - Georg Gottlob, Andreas Pieris, Lidia Tendera:
Querying the Guarded Fragment with Transitivity. 287-298 - Hyeonseung Im, Keiko Nakata, Sungwoo Park:
Contractive Signatures with Recursive Types, Type Parameters, and Abstract Types. 299-311 - David Janin:
Algebras, Automata and Logic for Languages of Labeled Birooted Trees. 312-323 - Artur Jez:
One-Variable Word Equations in Linear Time. 324-335 - Gregory M. Kobele, Sylvain Salvati:
The IO and OI Hierarchies Revisited. 336-348 - Daniel Leivant, Jean-Yves Marion:
Evolving Graph-Structures and Their Implicit Computational Complexity. 349-360 - Markus Lohrey, Benjamin Steinberg, Georg Zetzsche:
Rational Subsets and Submonoids of Wreath Products. 361-372 - Luca Padovani:
Fair Subtyping for Open Session Types. 373-384 - Tomas Petricek, Dominic A. Orchard, Alan Mycroft:
Coeffects: Unified Static Analysis of Context-Dependence. 385-397 - Colin Stirling:
Proof Systems for Retracts in Simply Typed Lambda Calculus. 398-409 - Kevin Woods:
Presburger Arithmetic, Rational Generating Functions, and Quasi-Polynomials. 410-421 - James Worrell:
Revisiting the Equivalence Problem for Finite Multitape Automata. 422-433 - Georg Zetzsche:
Silent Transitions in Automata with Storage. 434-445
Track C - Foundations of Networked Computation
- Susanne Albers, Achim Passen:
New Online Algorithms for Story Scheduling in Web Advertising. 446-458 - Yoram Bachrach, Ely Porat:
Sketching for Big Data Recommender Systems Using Fast Pseudo-random Fingerprints. 459-471 - Luca Becchetti, Vincenzo Bonifaci, Michael Dirnberger, Andreas Karrenbauer, Kurt Mehlhorn:
Physarum Can Compute Shortest Paths: Convergence Proofs and Complexity Bounds. 472-483 - L. Elisa Celis, Dimitrios C. Gklezakos, Anna R. Karlin:
On Revenue Maximization for Agents with Costly Information Acquisition - Extended Abstract. 484-495 - George Christodoulou, Martin Gairing:
Price of Stability in Polynomial Congestion Games. 496-507 - Jurek Czyzowicz, Evangelos Kranakis, Eduardo Pacheco:
Localization for a System of Colliding Robots. 508-519 - Dariusz Dereniowski, Yann Disser, Adrian Kosowski, Dominik Pajak, Przemyslaw Uznanski:
Fast Collaborative Graph Exploration. 520-532 - Yoann Dieudonné, Andrzej Pelc:
Deterministic Polynomial Approach in the Plane. 533-544 - Sebastian Faust, Carmit Hazay, Daniele Venturi:
Outsourced Pattern Matching. 545-556 - Emanuele G. Fusco, Andrzej Pelc, Rossella Petreschi:
Learning a Ring Cheaply and Fast. 557-568 - Nick Gravin, Pinyan Lu:
Competitive Auctions for Markets with Positive Externalities. 569-580 - David G. Harris, Ehab Morsy, Gopal Pandurangan, Peter Robinson, Aravind Srinivasan:
Efficient Computation of Balanced Structures. 581-593 - Sepp Hartung, André Nichterlein, Rolf Niedermeier, Ondrej Suchý:
A Refined Complexity Analysis of Degree Anonymization in Graphs. 594-606 - Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
Sublinear-Time Maintenance of Breadth-First Spanning Tree in Partially Dynamic Networks. 607-619 - Martin Hoefer, Lisa Wagner:
Locally Stable Marriage with Strict Preferences. 620-631 - Tomasz Jurdzinski, Dariusz R. Kowalski, Grzegorz Stachowiak:
Distributed Deterministic Broadcasting in Wireless Networks of Weak Devices. 632-644 - Helger Lipmaa, Tomas Toft:
Secure Equality and Greater-Than Tests with Sublinear Online Complexity. 645-656 - George B. Mertzios, Othon Michail, Ioannis Chatzigiannakis, Paul G. Spirakis:
Temporal Network Optimization Subject to Connectivity Constraints. 657-668 - George B. Mertzios, Paul G. Spirakis:
Strong Bounds for Evolution in Networks. 669-680 - Seth Pettie, Hsin-Hao Su:
Fast Distributed Coloring Algorithms for Triangle-Free Graphs. 681-693
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-05 21:08 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
