Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Inf.~Comput. AND Volume=239
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Isomorphism testing of Boolean functions computable by constant-depth circuits
V. Arvind
,
Yadu Vasudev
Information and Computation
239
, 2014, pp. 3-12
Conservative groupoids recognize only regular languages
Martin Beaudry
,
Danny Dubé
,
Maxime Dubé
,
Mario Latendresse
,
Pascal Tesson
Information and Computation
239
, 2014, pp. 13-28
On efficient implicit OBDD-based algorithms for maximal matchings
Beate Bollig
,
Tobias Pröger
Information and Computation
239
, 2014, pp. 29-43
Covering space in the Weyl and Besicovitch topologies
Julien Cervelle
Information and Computation
239
, 2014, pp. 44-54
Catalytic and communicating Petri nets are Turing complete
Gabriel Ciobanu
,
G. Michele Pinna
Information and Computation
239
, 2014, pp. 55-70
Two-way automata making choices only at the endmarkers
Viliam Geffert
,
Bruno Guillon
,
Giovanni Pighizzini
Information and Computation
239
, 2014, pp. 71-86
Patterns with bounded treewidth
Daniel Reidenbach
,
Markus L. Schmid
Information and Computation
239
, 2014, pp. 87-99
Aeolus: A component model for the cloud
Roberto Di Cosmo
,
Jacopo Mauro
,
Stefano Zacchiroli
,
Gianluigi Zavattaro
Information and Computation
239
, 2014, pp. 100-121
One-way reversible and quantum finite automata with advice
Tomoyuki Yamakami
Information and Computation
239
, 2014, pp. 122-148
A collapse theorem for holographic algorithms with matchgates on domain size at most 4
Jin-Yi Cai
,
Zhiguo Fu
Information and Computation
239
, 2014, pp. 149-169
On the impact of link faults on Byzantine agreement
Martin Biely
Information and Computation
239
, 2014, pp. 170-181
Bounding messages for free in security protocols - Extension to various security properties
Myrto Arapinis
,
Marie Duflot
Information and Computation
239
, 2014, pp. 182-215
A Kraft-McMillan inequality for free semigroups of upper-triangular matrices
Juha Honkala
Information and Computation
239
, 2014, pp. 216-221
The pseudopalindromic completion of regular languages
Szilárd Zsolt Fazekas
,
Florin Manea
,
Robert Mercaş
,
Kayoko Shikishima-Tsuji
Information and Computation
239
, 2014, pp. 222-236
Complexity of two-variable dependence logic and IF-logic
Juha Kontinen
,
Antti Kuusisto
,
Peter Lohmann
,
Jonni Virtema
Information and Computation
239
, 2014, pp. 237-253
Linear logical relations and observational equivalences for session-based concurrency
Jorge A. Pérez
,
Luís Caires
,
Frank Pfenning
,
Bernardo Toninho
Information and Computation
239
, 2014, pp. 254-302
Refinement modal logic
Laura Bozzelli
,
Hans van Ditmarsch
,
Tim French
,
James Hales
,
Sophie Pinchinat
Information and Computation
239
, 2014, pp. 303-339
Krivine machines and higher-order schemes
Sylvain Salvati
,
Igor Walukiewicz
Information and Computation
239
, 2014, pp. 340-355
Sequential aggregate signatures with lazy verification from trapdoor permutations
Kyle Brogle
,
Sharon Goldberg
,
Leonid Reyzin
Information and Computation
239
, 2014, pp. 356-376