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