| 2003 |
|---|
| 11 | EE | Iwan M. Duursma,
Bjorn Poonen,
Michael Zieve:
Everywhere Ramified Towers of Global Function Fields.
International Conference on Finite Fields and Applications 2003: 148-153 |
| 2002 |
|---|
| 10 | EE | Bjorn Poonen:
Using Elliptic Curves of Rank One towards the Undecidability of Hilbert's Tenth Problem over Rings of Algebraic Integers.
ANTS 2002: 33-41 |
| 1998 |
|---|
| 9 | EE | Edward G. Coffman Jr.,
Leopold Flatto,
Predrag R. Jelenkovic,
Bjorn Poonen:
Packing Random Intervals On-Line.
Algorithmica 22(4): 448-476 (1998) |
| 8 | EE | Bjorn Poonen,
Michael Rubinstein:
The Number of Intersection Points Made by the Diagonals of a Regular Polygon.
SIAM J. Discrete Math. 11(1): 135-156 (1998) |
| 1997 |
|---|
| 7 | | A. Robert Calderbank,
Wen-Ching W. Li,
Bjorn Poonen:
A 2-adic approach to the analysis of cyclic codes.
IEEE Transactions on Information Theory 43(3): 977-986 (1997) |
| 1996 |
|---|
| 6 | | Bjorn Poonen:
Computational Aspects of Curves of Genus at Least 2.
ANTS 1996: 283-306 |
| 5 | | A. Robert Calderbank,
Gary McGuire,
Bjorn Poonen,
Michael Rubinstein:
On a conjecture of Helleseth regarding pairs of binary m-sequences.
IEEE Transactions on Information Theory 42(3): 988-990 (1996) |
| 1994 |
|---|
| 4 | | Edward G. Coffman Jr.,
Leopold Flatto,
Bjorn Poonen,
Paul E. Wright:
The Processor Minimization Problem with Independent Waiting-Time Constraints.
Theor. Comput. Sci. 125(1): 3-16 (1994) |
| 1993 |
|---|
| 3 | | Bjorn Poonen:
The Worst Case in Shellsort and Related Algorithms.
J. Algorithms 15(1): 101-124 (1993) |
| 1992 |
|---|
| 2 | | C. Greg Plaxton,
Bjorn Poonen,
Torsten Suel:
Improved Lower Bounds for Shellsort
FOCS 1992: 226-235 |
| 1 | | Bjorn Poonen:
Union-Closed Families.
J. Comb. Theory, Ser. A 59(2): 253-268 (1992) |
