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: Author="Rolim, Jos{\'e} D.P."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Reasoning about idealized Algol
Dan R. Ghica
,
Guy McCusker
Lecture Notes in Computer Science
1853
, 2000, pp. 103-115
Rule-based and visual model evolution using GenGEd
J. Padberg
,
C. Ermel
,
R. Bardohl
Proceedings in Informatics
8
, 2000, pp. 467-475
On deciding if deterministic Rabin language is in Büchi class
Tomasz Fryderyk Urbański
Lecture Notes in Computer Science
1853
, 2000, pp. 663-674
Weak random sources, hitting sets, and BPP simulations
Alexander E. Andreev
,
Andrea E.F. Clementi
,
José D.P. Rolim
,
Luca Trevisan
SIAM Journal on Computing
28
(6), 1999, pp. 2103-2116
Towards efficient constructions of hitting sets that derandomize BPP
Alexander E. Andreev
,
Andrea E.F. Clementi
,
José D.P. Rolim
Technical Report (TR96-029), 1996
Constructing the highest degree subgraph for dense graphs is in
{\cal{NCAS}}
Alexander E. Andreev
,
Andrea E.F. Clementi
,
José D.P. Rolim
Theoretical Computer Science
161
(1-2), 1996, pp. 307-314
Optimal lower bounds on the multiparty communication complexity
Pavol Dúris̑
,
José D.P. Rolim
Lecture Notes in Computer Science
900
, 1995, pp. 350-360
A note on the density of oracle decreasing time-space complexity
Pavol Dúris̑
,
José D.P. Rolim
Theoretical Computer Science
132
(1-2), 1994, pp. 435-444
On the density and core of the complexity classes
José D.P. Rolim
Lecture Notes in Computer Science
583
, 1992, pp. 448-459
A note on the best-case complexity
José D.P. Rolim
,
Sheila A. Greibach
Information Processing Letters
30
, 1989, pp. 133-138
On the polynomial IO-complexity
José D.P. Rolim
Information Processing Letters
33
, 1989/90, pp. 199-204