Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Pagh, Anna"'
We show how to represent sets in a linear space data structure such that expressions involving unions and intersections of sets can be computed in a worst-case efficient way. This problem has applications in e.g. information retrieval and database sy
Externí odkaz:
http://arxiv.org/abs/0708.3259
Hashing with linear probing dates back to the 1950s, and is among the most studied algorithms. In recent years it has become one of the most important hash table organizations since it uses the cache of modern computers very well. Unfortunately, prev
Externí odkaz:
http://arxiv.org/abs/cs/0612055
Publikováno v:
SIAM Review, 2011 Sep 01. 53(3), 547-558.
Externí odkaz:
https://www.jstor.org/stable/23070146
Publikováno v:
SIAM Journal on Computing. 2009, Vol. 39 Issue 3, p1107-1120. 14p.
Autor:
Pagh, Anna1 annao@itu.dk, Pagh, Rasmus1 pagh@itu.dk
Publikováno v:
SIAM Journal on Computing. 2008, Vol. 38 Issue 1, p85-96. 12p.
Publikováno v:
Fagerberg, R, Pagh, A & Pagh, R 2006, External String Sorting: Faster and Cache-Oblivious . in B Durand & W Thomas (eds), STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science . Lecture Notes in Computer Science, vol. 3884, Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, 24/08/2010 . https://doi.org/10.1007/11672142_4
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3062::15e3a7c0616c2e4f863e88f393b5da93
https://portal.findresearcher.sdu.dk/da/publications/008f8050-df6f-11db-9628-000ea68e967b
https://portal.findresearcher.sdu.dk/da/publications/008f8050-df6f-11db-9628-000ea68e967b
Publikováno v:
Proceedings of the Thirty-Ninth Annual ACM Symposium: Theory of Computing; 6/11/2007, p318-327, 10p
Autor:
Hutchison, David, Kanade, Takeo, Kittler, Josef, Kleinberg, Jon M., Mattern, Friedemann, Mitchell, John C., Naor, Moni, Nierstrasz, Oscar, Pandu Rangan, C., Steffen, Bernhard, Sudan, Madhu, Terzopoulos, Demetri, Tygar, Doug, Vardi, Moshe Y., Weikum, Gerhard, Tokuyama, Takeshi, Bille, Philip, Pagh, Anna, Pagh, Rasmus
Publikováno v:
Algorithms & Computation (978-3-540-77118-0); 2007, p739-750, 12p
Publikováno v:
STACS 2006; 2006, p68-79, 12p
Publikováno v:
Proceedings of the Sixteenth Annual ACM-SIAM Symposium: Discrete Algorithms; 1/23/2005, p823-829, 7p