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="Poonen, Bjorn"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Using elliptic curves of rank one towards the undecidability of Hilbert's Tenth Problem over rings of algebraic integers
Bjorn Poonen
Lecture Notes in Computer Science
2369
, 2002, pp. 33-42
The number of intersection points made by the diagonals of a regular polygon
Bjorn Poonen
,
Michael Rubinstein
SIAM Journal on Discrete Mathematics
11
(1), 1998, pp. 135-156
Computational aspects of curves of genus at least 2
Bjorn Poonen
Lecture Notes in Computer Science
1122
, 1996, pp. 283-306
The processor minimization problem with independent waiting-time constraints
E.G., Jr. Coffman
,
Leopold Flatto
,
Bjorn Poonen
,
Paul E. Wright
Theoretical Computer Science
125
(1), 1994, pp. 3-16
The worst case in Shellsort and related algorithms
Bjorn Poonen
Journal of Algorithms
15
(1), 1993, pp. 101-124
Improved lower bounds for Shellsort
C. Greg Plaxton
,
Bjorn Poonen
,
Torsten Suel
Proceedings of the 33rd Annual IEEE Symposium on Foundations of Computer Science, FOCS'92 (Pittsburgh, PA, October 24-27, 1992)
, 1992, pp. 226-235
Union-closed families
Bjorn Poonen
Journal of Combinatorial Theory Series A
59
(2), 1992, pp. 253-268