default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation and Computation, Volume 239
Volume 239, December 2014
- Adrian-Horia Dediu
, Carlos Martín-Vide, Bianca Truthe:
6th International Conference on Language and Automata Theory and Applications (LATA 2012). 1-2 - Vikraman Arvind, Yadu Vasudev:
Isomorphism testing of Boolean functions computable by constant-depth circuits. 3-12 - Martin Beaudry, Danny Dubé, Maxime Dubé, Mario Latendresse, Pascal Tesson:
Conservative groupoids recognize only regular languages. 13-28 - Beate Bollig, Tobias Pröger:
On efficient implicit OBDD-based algorithms for maximal matchings. 29-43 - Julien Cervelle:
Covering space in the Weyl and Besicovitch topologies. 44-54 - Gabriel Ciobanu, G. Michele Pinna:
Catalytic and communicating Petri nets are Turing complete. 55-70 - Viliam Geffert, Bruno Guillon, Giovanni Pighizzini:
Two-way automata making choices only at the endmarkers. 71-86 - Daniel Reidenbach, Markus L. Schmid:
Patterns with bounded treewidth. 87-99
- Roberto Di Cosmo, Jacopo Mauro, Stefano Zacchiroli, Gianluigi Zavattaro:
Aeolus: A component model for the cloud. 100-121 - Tomoyuki Yamakami:
One-way reversible and quantum finite automata with advice. 122-148 - Jin-Yi Cai, Zhiguo Fu:
A collapse theorem for holographic algorithms with matchgates on domain size at most 4. 149-169 - Martin Biely:
On the impact of link faults on Byzantine agreement. 170-181 - Myrto Arapinis, Marie Duflot:
Bounding messages for free in security protocols - extension to various security properties. 182-215 - Juha Honkala:
A Kraft-McMillan inequality for free semigroups of upper-triangular matrices. 216-221 - Szilárd Zsolt Fazekas, Florin Manea, Robert Mercas, Kayoko Shikishima-Tsuji:
The pseudopalindromic completion of regular languages. 222-236 - Juha Kontinen, Antti Kuusisto, Peter Lohmann, Jonni Virtema:
Complexity of two-variable dependence logic and IF-logic. 237-253 - Jorge A. Pérez, Luís Caires, Frank Pfenning, Bernardo Toninho:
Linear logical relations and observational equivalences for session-based concurrency. 254-302 - Laura Bozzelli, Hans van Ditmarsch, Tim French, James Hales, Sophie Pinchinat:
Refinement modal logic. 303-339 - Sylvain Salvati, Igor Walukiewicz:
Krivine machines and higher-order schemes. 340-355 - Kyle Brogle, Sharon Goldberg, Leonid Reyzin:
Sequential aggregate signatures with lazy verification from trapdoor permutations. 356-376
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 2025-11-06 00:11 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:
