default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation and Computation, Volume 261
Volume 261, Part 1, August 2018
- Marco Gaboardi
, Ulrich Schöpp:
Special issue - Developments in implicit computational complexity, 2014 and 2015. 1-2 - Martin Avanzini, Ugo Dal Lago:
On sharing, memoization, and polynomial time. 3-22 - Matthieu Perrinel:
Paths-based criteria and application to linear logic subsystems characterizing polynomial time. 23-54 - Patrick Baillot, Erika De Benedetti, Simona Ronchi Della Rocca:
Characterizing polynomial and exponential complexity classes in elementary lambda-calculus. 55-77 - Emmanuel Hainry, Romain Péchoux:
A type-based complexity analysis of Object Oriented programs. 78-115 - Georg Moser, Michael Schaper:
From Jinja bytecode to term rewriting: A complexity reflecting transformation. 116-143 - Dominic A. Orchard:
Complexity bounds for container functors and comonads. 144-158
Volume 261, Part 2, August 2018
- Magnús M. Halldórsson, Naoki Kobayashi, Bettina Speckmann:
Special issue for the 42nd International Colloquium on Automata, Languages and Programming, ICALP 2015, Kyoto, Japan. 159 - Balagopal Komarath, Jayalal Sarma, K. S. Sunil:
Comparator Circuits over Finite Bounded Posets. 160-174 - Oded Goldreich, Tom Gur, Ron D. Rothblum:
Proofs of proximity for context-free languages and read-once branching programs. 175-201 - Brett Hemenway, Mary Wootters:
Linear-time list recovery of high-rate expander codes. 202-218 - Sayan Bhattacharya, Monika Henzinger, Giuseppe F. Italiano:
Dynamic algorithms via the primal-dual method. 219-239 - Huacheng Yu:
An improved combinatorial algorithm for Boolean matrix multiplication. 240-247 - Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis:
2-vertex connectivity in directed graphs. 248-264 - Radu Curticapean:
Block interpolation: A framework for tight exponential-time counting complexity. 265-280 - Hamidreza Jahanjou, Eric Miles, Emanuele Viola:
Local reduction. 281-295 - James Aisenberg, Maria Luisa Bonet, Sam Buss, Adrian Craciun, Gabriel Istrate:
Short proofs of the Kneser-Lovász coloring principle. 296-310 - Emmanuel Filiot, Sebastian Maneth, Pierre-Alain Reynier, Jean-Marc Talbot:
Decision problems of tree transducers with origin. 311-335 - Sam Staton, Sander Uijlen:
Effect algebras, presheaves, non-locality and contextuality. 336-354 - Kousha Etessami, Alistair Stewart, Mihalis Yannakakis:
Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes. 355-382 - Ahmed Bouajjani, Michael Emmi, Constantin Enea, Jad Hamza:
On reducing linearizability to state reachability. 383-400 - Matthijs Vákár, Radha Jagadeesan, Samson Abramsky:
Game semantics for dependent types. 401-431 - Yiannis Giannakopoulos, Elias Koutsoupias:
Selling two goods optimally. 432-445 - Dimitris Achlioptas, Paris Siminelakis:
Symmetric graph properties have independent edges. 446-463 - Varsha Dani, Thomas P. Hayes, Mahnush Movahedi, Jared Saia, Maxwell Young:
Interactive communication with unknown noise rate. 464-486
Volume 261, Part 3, August 2018
- Julian Gutierrez, Michael J. Wooldridge:
Preface to the SR-2015 special issue. 487 - Egor Ianovski, Luke Ong:
Simulating cardinal preferences in Boolean games: A proof technique. 488-518 - Johan van Benthem:
Computation as social agency: What, how and who. 519-535 - Nicolas Basset, Marta Z. Kwiatkowska, Clemens Wiltsche:
Compositional strategy synthesis for stochastic games with multiple objectives. 536-587 - Petr Cermák, Alessio Lomuscio, Fabio Mogavero, Aniello Murano:
Practical verification of multi-agent systems against Slk specifications. 588-614
Volume 261, Part 4, August 2018
- Alessio R. Lomuscio, Moshe Y. Vardi:
4th International Workshop on Strategic Reasoning (SR 2016). 615 - Rajeev Alur, Salar Moarref, Ufuk Topcu:
Compositional and symbolic synthesis of reactive controllers for multi-agent systems. 616-633 - Benjamin Aminof, Vadim Malvone, Aniello Murano, Sasha Rubin:
Graded modalities in Strategy Logic. 634-649 - Julian Gutierrez, Giuseppe Perelli, Michael J. Wooldridge:
Imperfect information in Reactive Modules games. 650-675 - Stéphane Le Roux, Arno Pauly:
Extending finite-memory determinacy to multi-player games. 676-694
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 2026-02-09 22:13 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:
