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
[2]
Hilfe
Suche: Author="H{\'a}jek, Petr"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The GUHA method and its meaning for data mining
Petr Hájek
,
Martin Holen̑a
,
Jan Rauch
Journal of Computer and System Sciences
76
(1), 2010, pp. 34-48
Scheduling parallel communication: The
h
-relation problem
Micah Adler
,
John W. Byers
,
Richard M. Karp
Lecture Notes in Computer Science
969
, 1995, pp. 1-20
Deterministic parsing for augmented context-free grammars
Luca Breveglieri
,
Alessandra Cherubini
,
Stefano Crespi Reghizzi
Lecture Notes in Computer Science
969
, 1995, pp. 326-336
Computational complexity of simultaneous elementary matching problems
Miki Hermann
,
Phokion G. Kolaitis
Lecture Notes in Computer Science
969
, 1995, pp. 359-370
Modular constructions of distributing automata
Sébastian Huguet
,
Antoine Petit
Lecture Notes in Computer Science
969
, 1995, pp. 467-478
Strong lower bounds on the approximability of some NPO PB-complete maximization problems
Viggo Kann
Lecture Notes in Computer Science
969
, 1995, pp. 227-236
The firing squad synchronization problem on Cayley graphs
Zsuzsanna Róka
Lecture Notes in Computer Science
969
, 1995, pp. 402-411
Making dynamic logic first-order
Petr Hájek
Lecture Notes in Computer Science
118
, 1981, pp. 287-295
Arithmetical hierarchy and complexity of computation
Petr Hájek
Theoretical Computer Science
8
(2), 1979, pp. 227-237
On logics of discovery
Petr Hájek
Lecture Notes in Computer Science
32
, 1975, pp. 30-45
Some logical problems of automated research
Petr Hájek
Proceedings of the 2nd Symposium and Summer School on Mathematical Foundations of Computer Science, MFCS'1973 (Strbské Pleso, High Tatras, Czechoslovakia, September 3-8, 1973)
, 1973, pp. 85-93