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
[1]
Hilfe
Suche: Author="Jarominek, Stefan"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A simple randomized parallel algorithm for maximal
f
-matchings
Oscar Garrido
,
Stefan Jarominek
,
Andrzej Lingas
,
Wojciech Rytter
Information Processing Letters
57
(2), 1996, pp. 83-87
A simple randomized parallel algorithm for maximal
f
-matchings
Oscar Garrido
,
Stefan Jarominek
,
Andrzej Lingas
,
Wojciech Rytter
Technical Report (LU-CS-TR:95-147), 1995
Efficient constructions of test sets for regular and context-free languages
Juhani Karhumäki
,
Wojciech Rytter
,
Stefan Jarominek
Theoretical Computer Science
116
(2), 1993, pp. 305-316
Speeding up two string-matching algorithms
Maxime Crochemore
,
Thierry Lecroq
,
Artur Czumaj
,
Leszek Gasieniec
,
Stefan Jarominek
,
Wojciech Plandowski
,
Wojciech Rytter
Lecture Notes in Computer Science
577
, 1992, pp. 589-600
A simple randomized parallel algorithm fo maximal
f
-matchings
Oscar Garrido
,
Stefan Jarominek
,
Andrzej Lingas
,
Wojciech Rytter
Lecture Notes in Computer Science
583
, 1992, pp. 165-176
Efficient constructions of test sets for regular and context-free languages
Juhani Karhumäki
,
Wojciech Rytter
,
Stefan Jarominek
Lecture Notes in Computer Science
520
, 1991, pp. 249-258