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="Sorenson, Jonathan"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Approximately counting semismooth integers
Eric Bach
,
Jonathan P. Sorenson
Proceedings of the 38th International Symposium on Symbolic and Algebraic Computation, ISSAC'2013 (Boston, Massachusetts, USA, June 26-29, 2013)
, 2013, pp. 23-30
Theory and implementation of online multiselection algorithms
Jérémy Barbay
,
Ankur Gupta
,
Seungbum Jo
,
Satti Srinivasa Rao
,
Jonathan Sorenson
Lecture Notes in Computer Science
8125
, 2013, pp. 109-120
A randomized sublinear time parallel GCD algorithm for the EREW PRAM
Jonathan P. Sorenson
Information Processing Letters
110
(5), 2010, pp. 198-201
Sieving for pseudosquares and pseudocubes in parallel using doubly-focused enumeration and wheel datastructures
Jonathan P. Sorenson
Lecture Notes in Computer Science
6197
, 2010, pp. 331-339
Fast bounds on the distribution of smooth numbers
Scott T. Parsell
,
Jonathan P. Sorenson
Lecture Notes in Computer Science
4076
, 2006, pp. 168-181
The pseudosquares prime sieve
Jonathan P. Sorenson
Lecture Notes in Computer Science
4076
, 2006, pp. 193-207
A fast algorithm for approximately counting smooth numbers
Jonathan P. Sorenson
Lecture Notes in Computer Science
1838
, 2000, pp. 539-549
Efficient algorithms for computing the Jacobi symbol
Shawna Meyer Eikenberry
,
Jonathan P. Sorenson
Journal Symbolic Computation
26
(4), 1998, pp. 509-523
Trading time for space in prime number sieves
Jonathan P. Sorenson
Lecture Notes in Computer Science
1423
, 1998, pp. 179-195
A space-efficient fast prime number sieve
Brian Dunten
,
Julie Jones
,
Jonathan Sorenson
Information Processing Letters
59
(2), 1996, pp. 79-84
Efficient algorithms for computing the Jacobi symbol
Shawna M. Meyer
,
Jonathan P. Sorenson
Lecture Notes in Computer Science
1122
, 1996, pp. 225-239
Counting the integers factorable via cyclotomic methods
Carl Pomerance
,
Jonathan Sorenson
Journal of Algorithms
19
(2), 1995, pp. 250-265
An analysis of Lehmer's Eudclidean GCD algorithm
Jonathan Sorenson
Proceedings of the 1995 International Symposium on Symbolic and Algebraic Computation, ISSAC'95 (Montreal, Canada, July 10-12, 1995)
, 1995, pp. 254-258
Analysis of a left-shift binary GCD algorithm
Jeffrey Shallit
,
Jonathan Sorenson
Journal Symbolic Computation
17
(6), 1994, pp. 473-486
Two fast parallel prime number sieves
Jonathan Sorenson
,
Ian Parberry
Information and Computation
114
(1), 1994, October, pp. 115-130
Polylog depth circuits for integer factoring and discrete logarithms
Jonathan Sorenson
Information and Computation
110
(1), 1994, April, pp. 1-18
Two fast GCD algorithms
Jonathan Sorenson
Journal of Algorithms
16
(1), 1994, pp. 110-144
Sieve algorithms for perfect power testing
Eric Bach
,
Jonathan Sorenson
Algorithmica
9
, 1993, pp. 313-328
Counting the integers - Cyclotomic methods can factor
Jonathan Sorenson
misc, 1990, March
Polylog depth circuits for integer factoring and discrete logarithms
Jonathan Sorenson
misc, 1989, August