-
Algorithmica is a
monthly peer-reviewed
scientific journal focusing on
research and the
application of
computer science algorithms. The
journal was established...
- "Randomized
incremental construction of
Delaunay and
Voronoi diagrams".
Algorithmica. 7 (1–6): 381–413. doi:10.1007/BF01758770. S2CID 3770886. de Berg, Mark;...
- Goldreich, O. (1990). "An
improved parallel algorithm for
integer GCD".
Algorithmica. 5 (1–4): 1–10. doi:10.1007/BF01840374. S2CID 17699330. Adleman, L. M...
-
complexities of
ordered searching, sorting, and
element distinctness".
Algorithmica. 34 (4): 429–448. arXiv:quant-ph/0102078. doi:10.1007/s00453-002-0976-3...
- and
efficient hash
families suffice for
cuckoo hashing with a stash."
Algorithmica 70.3 (2014): 428-456. Mitzenmacher,
Michael (2009-09-09). "Some Open...
- Luc (2001). "On the
probabilistic worst-case time of 'find'" (PDF).
Algorithmica. 31 (3): 291–303. doi:10.1007/s00453-001-0046-2. MR 1855252. Blum-style...
- (January 1994). "On the
power of
randomization in on-line algorithms".
Algorithmica. 11 (1): 2–14. doi:10.1007/BF01294260. S2CID 26771869. Downs, Anthony...
- Real
Numbers in $$O\big (n\sqrt{\log n}\big )$$ Time and
Linear Space".
Algorithmica. 82 (4): 966–978. doi:10.1007/s00453-019-00626-0. ISSN 1432-0541. Wirth...
-
Geometry and Applications. He is also a
member of the
editorial board of
Algorithmica,
Discrete & Com****tional Geometry, and Com****tional Geometry: Theory...
- (1988), "Parallel
construction of a
suffix tree with applications",
Algorithmica, 3 (1–4): 347–365, doi:10.1007/bf01762122, S2CID 5024136. Baeza-Yates...
