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=2006
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Fast LLL-type lattice reduction
Claus Peter Schnorr
Information and Computation
204
(1), 2006, pp. 1-25
Building small equality graphs for deciding equality logic with uninterpreted functions
Yoav Rodeh
,
Ofer Strichman
Information and Computation
204
(1), 2006, pp. 26-59
Pure bigraphs: Structure and dynamics
Robin Milner
Information and Computation
204
(1), 2006, pp. 60-122
Learning languages from positive data and a finite number of queries
Sanjay Jain
,
Efim Kinber
Information and Computation
204
(1), 2006, pp. 123-175
Learning expressions and programs over monoids
Ricard Gavaldà
,
Pascal Tesson
,
Denis Thérien
Information and Computation
204
(2), 2006, pp. 177-209
Implicit complexity over an arbitrary structure: Quantifier alternations
Olivier Bournez
,
Felipe Cucker
,
Paulin Jacobé de Naurois
,
Jean-Yves Marion
Information and Computation
204
(2), 2006, pp. 210-230
True-concurrency probabilistic models: Branching cells and distributed probabilities for event structures
Samy Abbes
,
Albert Benveniste
Information and Computation
204
(2), 2006, pp. 231-274
A simpler and faster 1.5-approximation algorithm for sorting by transpositions
Tzvika Hartman
,
Ron Shamir
Information and Computation
204
(2), 2006, pp. 275-290
Lower and upper bounds on obtaining history independence
Niv Buchbinder
,
Erez Petrank
Information and Computation
204
(2), 2006, pp. 291-337
A stable programming language
Luca Paolini
Information and Computation
204
(3), 2006, pp. 339-375
Incompleteness of states w.r.t. traces in model checking
Roberto Giacobazzi
,
Francesco Ranzato
Information and Computation
204
(3), 2006, pp. 376-407
On model-checking timed automata with stopwatch observers
Thomas Brihaye
,
Veronique Bruyère
,
Jean-François Raskin
Information and Computation
204
(3), 2006, pp. 408-433
Recursive coalgebras from comonads
Venanzio Capretta
,
Tarmo Uustalu
,
Varmo Vene
Information and Computation
204
(4), 2006, pp. 437-468
A modular approach to defining and characterising notions of simulation
Corina Cîrstea
Information and Computation
204
(4), 2006, pp. 469-502
Bisimulation and cocongruence for probabilistic systems
Vincent Danos
,
Josée Desharnais
,
François Laviolette
,
Prakash Panangaden
Information and Computation
204
(4), 2006, pp. 503-523
Comparing operational models of name-passing process calculi
Marcelo Fiore
,
Sam Staton
Information and Computation
204
(4), 2006, pp. 524-560
Distributive laws for the coinductive solution of recursive equations
Bart Jacobs
Information and Computation
204
(4), 2006, pp. 561-587
Coalgebraic semantics for timed processes
Marco Kick
,
John Power
,
Alex Simpson
Information and Computation
204
(4), 2006, pp. 588-609
Final coalgebras for functors on measurable spaces
Lawrence S. Moss
,
Ignacio D. Viglizzo
Information and Computation
204
(4), 2006, pp. 610-636
Automata and fixed point logic: A coalgebraic perspective
Yde Venema
Information and Computation
204
(4), 2006, pp. 637-678
Weighted path queries on semistructured databases
Sergio Flesca
,
Filippo Furfaro
,
Sergio Greco
Information and Computation
204
(5), 2006, pp. 679-696
Broadcast in the rendezvous model
Philippe Duchon
,
Nicolas Hanusse
,
Nasser Saheb
,
Akka Zemmari
Information and Computation
204
(5), 2006, pp. 697-712
Quantitative analysis of probabilistic lossy channel systems
Alexander Rabinovich
Information and Computation
204
(5), 2006, pp. 713-740
Aperiodic propagation criteria for Boolean functions
Lars Eirik Danielsen
,
T. Aaron Gulliver
,
Matthew G. Parker
Information and Computation
204
(5), 2006, pp. 741-770
Weakly complete axiomatization of exogenous quantum propositional logic
P. Mateus
,
A. Sernadas
Information and Computation
204
(5), 2006, pp. 771-794
Seiten 1
2
3
>