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=233
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Online selection of intervals and
t
-intervals
Unnar Th. Bachmann
,
Magnús M. Halldórsson
,
Hadas Shachnai
Information and Computation
233
, 2013, pp. 1-11
Computing with infinitely many processes
Michael Merritt
,
Gadi Taubenfeld
Information and Computation
233
, 2013, pp. 12-31
Optimal bit complexity randomised distributed MIS and maximal matching algorithms for anonymous rings
A. Fontaine
,
Y. Métivier
,
J.M. Robson
,
A. Zemmari
Information and Computation
233
, 2013, pp. 32-40
Universal computably enumerable sets and initial segment prefix-free complexity
George Barmpalias
Information and Computation
233
, 2013, pp. 41-59
Beyond bidimensionality: Parameterized subexponential algorithms on directed graphs
Frederic Dorn
,
Fedor V. Fomin
,
Daniel Lokshtanov
,
Venkatesh Raman
,
Saket Saurabh
Information and Computation
233
, 2013, pp. 60-70