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 YEAR=2012
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Multiset rewriting for the verification of depth-bounded processes with name binding
Fernando Rosa-Velardo
,
María Martos-Salgado
Information and Computation
215
, 2012, pp. 68-87
Continuous time temporal logic with counting
Yoram Hirshfeld
,
Alexander Rabinovich
Information and Computation
214
, 2012, pp. 1-9
Static slicing of explicitly synchronized languages
Michael Leuschel
,
Marisa Llorens
,
Javier Oliver
,
Josep Silva
,
Salvador Tamarit
Information and Computation
214
, 2012, pp. 10-46
No double discount: Condition-based simultaneity yields limited gain
Yoram Moses
,
Michel Raynal
Information and Computation
214
, 2012, pp. 47-58
Divide and congruence: From decomposition of modal formulas to preservation of branching and
\eta
-bisimilarity
Wan Fokkink
,
Rob van Glabbeek
,
Paulien de Wind
Information and Computation
214
, 2012, pp. 59-85
Featherweight Jigsaw - Replacing inheritance by composition in Java-like languages
Giovanni Lagorio
,
Marco Servetto
,
Elena Zucca
Information and Computation
214
, 2012, pp. 86-111
Mismatch sampling
Raphaël Clifford
,
Klim Efremenko
,
Benny Porat
,
Ely Porat
,
Amir Rothschild
Information and Computation
214
, 2012, pp. 112-118
An approach to innocent strategies as graphs
Pierre-Louis Curien
,
Claudia Faggian
Information and Computation
214
, 2012, pp. 119-155
A compact representation of nondeterministic (suffix) automata for the bit-parallel approach
Domenico Cantone
,
Simone Faro
,
Emanuele Giaquinta
Information and Computation
213
, 2012, pp. 3-12
Bidirectional search in a string with wavelet trees and bidirectional matching statistics
Thomas Schnattinger
,
Enno Ohlebusch
,
Simon Gog
Information and Computation
213
, 2012, pp. 13-22
Mod/Resc Parsimony Inference: Theory and application
Igor Nor
,
Danny Hermelin
,
Sylvain Charlat
,
Jan Engelstadter
,
Max Reuter
,
Olivier Duron
,
Marie-France Sagot
Information and Computation
213
, 2012, pp. 23-32
Phylogeny- and parsimony-based haplotype inference with constraints
Michael Elberfeld
,
Till Tantau
Information and Computation
213
, 2012, pp. 33-47
Approximate all-pairs suffix/prefix overlaps
Niko Välimäki
,
Susana Ladra
,
Veli Mäkinen
Information and Computation
213
, 2012, pp. 49-58
Optimizing restriction site placement for synthetic genomes
Pablo Montes
,
Heraldo Memelli
,
Charles B. Ward
,
Joondong Kim
,
Joseph S.B. Mitchell
,
Steven Skiena
Information and Computation
213
, 2012, pp. 59-69
On the expressive power of univariate equations over sets of natural numbers
Alexander Okhotin
,
Panos Rondogiannis
Information and Computation
212
, 2012, pp. 1-14
Unambiguous finite automata over a unary alphabet
Alexander Okhotin
Information and Computation
212
, 2012, pp. 15-36
The price of anarchy on uniformly related machines revisited
Leah Epstein
,
Rob van Stee
Information and Computation
212
, 2012, pp. 37-54
A classification of 20-trinucleotide circular codes
Christian J. Michel
,
Giuseppe Pirillo
,
Mario A. Pirillo
Information and Computation
212
, 2012, pp. 55-63
An algebra of behavioural types
António Ravara
,
Pedro Resende
,
Vasco T. Vasconcelos
Information and Computation
212
, 2012, pp. 64-91
Deciding safety properties in infinite-state pi-calculus via behavioural types
Lucia Acciai
,
Michele Boreale
Information and Computation
212
, 2012, pp. 92-117
Corrigendum to ``Curry-Howard for incomplete first-order logic derivations using one-and-a-half level terms''
Murdoch J. Gabbay
,
Dominic P. Mulligan
Information and Computation
212
, 2012, pp. 119-119
Regular languages with variables on graphs
Simone Santini
Information and Computation
211
, 2012, pp. 1-28
The complexity of stochastic Müller games
Krishnendu Chatterjee
Information and Computation
211
, 2012, pp. 29-48
Control-flow analysis of function calls and returns by abstract interpretation
Jan Midtgaard
,
Thomas P. Jensen
Information and Computation
211
, 2012, pp. 49-76
A coalgebraic perspective on linear weighted automata
Filippo Bonchi
,
Marcello Bonsangue
,
Michele Boreale
,
Jan Rutten
,
Alexandra Silva
Information and Computation
211
, 2012, pp. 77-105
Seiten
<
1
2
3
>