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="Jaromczyk, Jerzy W."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Constructions of asymptotically shortest
k
-radius sequences
Jerzy W. Jaromczyk
,
Zbigniew Lonc
,
Mirosƚaw Truszczyński
Journal of Combinatorial Theory Series A
119
(3), 2012, pp. 731-746
Sequences of radius
k
: How to fetch many huge objects into small memory for pairwise computations
Jerzy W. Jaromczyk
,
Zbigniew Lonc
Lecture Notes in Computer Science
3341
, 2004, pp. 594-605
A theory of even functionals and their algorithmic applications
Jerzy W. Jaromczyk
,
Grzegorz Świa̧tek
Theoretical Computer Science
154
(1), 1996, pp. 41-56
The two-line center problem from a polar view: A new algorithm and data structure
Jerzy W. Jaromczyk
,
Miroslaw Kowaluk
Lecture Notes in Computer Science
955
, 1995, pp. 13-25
A theory of even functionals and their algorithmic applications
Jerzy W. Jaromczyk
,
Grzegorz Świa̧tek
Lecture Notes in Computer Science
700
, 1993, pp. 126-136
Constructing the relative neighborhood graph in 3-dimensional Euclidean space
Jerzy W. Jaromczyk
,
Mirosƚaw Kowaluk
Discrete Applied Mathematics
31
, 1991, pp. 181-191
A role of lower semicontinuous functions in the combinatorial complexity of geometric problems
Jerzy W. Jaromczyk
,
Grzegorz Świa̧tek
Journal of Complexity
7
, 1991, pp. 174-183
A note on lower bounds for the maximum area and maximum perimeter
k
-gon problems
Robert L. (Scot) Drysdale III
,
Jerzy W. Jaromczyk
Information Processing Letters
32
, 1989, pp. 301-303
Lower bounds for polygon simplicity testing and other problems
Jerzy W. Jaromczyk
Lecture Notes in Computer Science
176
, 1984, pp. 339-347
An extension of Rabin's complete proof concept
Jerzy W. Jaromczyk
Lecture Notes in Computer Science
118
, 1981, pp. 321-326