Search results for "word-RAM"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
95	Torben Hagerup	Sorting and Searching on the Word RAM.	STACS	1998	DBLP DOI BibTeX RDF	word-level parallelism, exponential range reduction, fusion trees, exponential search trees, AC', searching, Sorting, network flow, multiplication, dictionaries, tries, word RAM, conservative algorithms
68	Alejandro López-Ortiz, Mehdi Mirzazadeh, Mohammad Ali Safari, M. Hossein Sheikh Attar	Fast string sorting using order-preserving compression.	ACM J. Exp. Algorithmics	2005	DBLP DOI BibTeX RDF	Order-preserving compression, unit-cost RAM, sorting, word-RAM
45	Ilya Baran, Erik D. Demaine, Mihai Patrascu	Subquadratic Algorithms for 3SUM.	Algorithmica	2008	DBLP DOI BibTeX RDF	3SUM, Randomization, Word RAM
41	Erik D. Demaine, Mihai Patrascu	Tight bounds for dynamic convex hull queries (again).	SCG	2007	DBLP DOI BibTeX RDF	bounded precision, dynamic convex hull, word RAM
37	Timothy M. Chan	Dynamic coresets.	SCG	2008	DBLP DOI BibTeX RDF	approximation algorithms, randomization, dynamic data structures, geometric optimization, word ram
31	Milan Ruzic	Making deterministic signatures quickly.	ACM Trans. Algorithms	2009	DBLP DOI BibTeX RDF	Deterministic algorithms, perfect hashing
31	Milan Ruzic	Making deterministic signatures quickly.	SODA	2007	DBLP BibTeX RDF
27	Gudmund Skovbjerg Frandsen, Johan P. Hansen, Peter Bro Miltersen	Lower Bounds for Dynamic Algebraic Problems.	STACS	1999	DBLP DOI BibTeX RDF
26	Kevin Buchin, Wolfgang Mulzer	Delaunay Triangulations in O(sort(n)) Time and More.	FOCS	2009	DBLP DOI BibTeX RDF	transdichotomous algorithm, hereditary algorithm, Delaunay triangulation, word RAM
26	Timothy M. Chan, Mihai Patrascu	Voronoi diagrams in n·2osqrt(lg lg n) time.	STOC	2007	DBLP DOI BibTeX RDF	segment intersection, word-RAM algorithms, computational geometry, sorting, convex hulls, point location
26	Ran Mendelson, Robert Endre Tarjan, Mikkel Thorup, Uri Zwick	Melding priority queues.	ACM Trans. Algorithms	2006	DBLP DOI BibTeX RDF	disjoint set union, minimum directed spanning trees, optimum branchings, word RAM model, Priority queues, heaps, union-find
20	Philip Bille, Inge Li Gørtz, Tord Stordalen	Predecessor on the Ultra-Wide Word RAM.	Algorithmica	2024	DBLP DOI BibTeX RDF
20	Adam Karczmarz, Wojciech Nadara, Marek Sokolowski 0001	Exact Shortest Paths with Rational Weights on the Word RAM.	SODA	2024	DBLP DOI BibTeX RDF
20	Adam Karczmarz, Wojciech Nadara, Marek Sokolowski 0001	Exact Shortest Paths with Rational Weights on the Word RAM.	CoRR	2023	DBLP DOI BibTeX RDF
20	Philip Bille, Inge Li Gørtz, Frederik Rye Skjoldjensen	Partial sums on the ultra-wide word RAM.	Theor. Comput. Sci.	2022	DBLP DOI BibTeX RDF
20	Philip Bille, Inge Li Gørtz, Tord Stordalen	Predecessor on the Ultra-Wide Word RAM.	CoRR	2022	DBLP BibTeX RDF
20	Philip Bille, Inge Li Gørtz, Tord Stordalen	Predecessor on the Ultra-Wide Word RAM.	SWAT	2022	DBLP DOI BibTeX RDF
20	Philip Bille, Inge Li Gørtz, Frederik Rye Skjoldjensen	Partial Sums on the Ultra-Wide Word RAM.	TAMC	2020	DBLP DOI BibTeX RDF
20	Philip Bille, Inge Li Gørtz, Frederik Rye Skjoldjensen	Partial Sums on the Ultra-Wide Word RAM.	CoRR	2019	DBLP BibTeX RDF
20	Frank Kammer, Andrej Sajenko	Linear-Time In-Place DFS and BFS on the Word RAM.	CIAC	2019	DBLP DOI BibTeX RDF
20	Timothy M. Chan, Dimitrios Skrepetos	Dynamic data structures for approximate Hausdorff distance in the word RAM.	Comput. Geom.	2017	DBLP DOI BibTeX RDF
20	Torben Hagerup	Easy Multiple-Precision Divisors and Word-RAM Constants.	MFCS (2)	2015	DBLP DOI BibTeX RDF
20	Timothy M. Chan, Dimitrios Skrepetos	Dynamic data structures for approximate Hausdorff distance in the word RAM.	CCCG	2015	DBLP BibTeX RDF
20	Peyman Afshani	Fast Computation of Output-Sensitive Maxima in a Word RAM.	SODA	2014	DBLP DOI BibTeX RDF
20	Timothy M. Chan	Persistent Predecessor Search and Orthogonal Point Location on the Word RAM.	ACM Trans. Algorithms	2013	DBLP DOI BibTeX RDF
20	Okke Schrijvers, Frits van Bommel, Kevin Buchin	Delaunay Triangulations on the Word RAM: Towards a Practical Worst-Case Optimal Algorithm.	ISVD	2013	DBLP DOI BibTeX RDF
20	Patrick K. Nicholson	Space-Efficient Data Structures in the Word-RAM and Bitprobe Models.		2013	RDF
20	Djamal Belazzougui	Worst-case efficient single and multiple string matching on packed texts in the word-RAM model.	J. Discrete Algorithms	2012	DBLP DOI BibTeX RDF
20		Optimal Prefix Free Code: word-RAM Linear and Algebraic Instance Optimal	CoRR	2012	DBLP BibTeX RDF
20	Philippe Van Kessel, Claude-Guy Quimper	Filtering Algorithms Based on the Word-RAM Model.	AAAI	2012	DBLP DOI BibTeX RDF
20	Timothy M. Chan	Persistent Predecessor Search and Orthogonal point Location on the Word RAM.	SODA	2011	DBLP DOI BibTeX RDF
20	Djamal Belazzougui	Worst case efficient single and multiple string matching in the Word-RAM model	CoRR	2010	DBLP BibTeX RDF
20	David Pisinger	Dynamic Programming on the Word RAM.	Algorithmica	2003	DBLP DOI BibTeX RDF
20	Torben Hagerup	Improved Shortest Paths on the Word RAM.	ICALP	2000	DBLP DOI BibTeX RDF
19	Ilya Baran, Erik D. Demaine, Mihai Patrascu	Subquadratic Algorithms for 3SUM.	WADS	2005	DBLP DOI BibTeX RDF
19	Philip Bille	Fast Searching in Packed Strings.	CPM	2009	DBLP DOI BibTeX RDF
19	Milan Ruzic	Uniform deterministic dictionaries.	ACM Trans. Algorithms	2008	DBLP DOI BibTeX RDF	Deterministic algorithms, perfect hashing
19	Mikkel Thorup	Equivalence between priority queues and sorting.	J. ACM	2007	DBLP DOI BibTeX RDF	sorting, Priority queues
15	Kimmo Fredriksson, Szymon Grabowski	Fast Convolutions and Their Applications in Approximate String Matching.	IWOCA	2009	DBLP DOI BibTeX RDF
15	Wing-Kai Hon, Kunihiko Sadakane, Wing-Kin Sung	Succinct Data Structures for Searchable Partial Sums.	ISAAC	2003	DBLP DOI BibTeX RDF
12	Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup	Stream sampling for variance-optimal estimation of subset sums.	SODA	2009	DBLP DOI BibTeX RDF
12	Arash Farzan, J. Ian Munro	Succinct Representations of Arbitrary Graphs.	ESA	2008	DBLP DOI BibTeX RDF
12	Milan Ruzic	Constructing Efficient Dictionaries in Close to Sorting Time.	ICALP (1)	2008	DBLP DOI BibTeX RDF
12	Jesper Jansson 0001, Kunihiko Sadakane, Wing-Kin Sung	Ultra-succinct representation of ordered trees.	SODA	2007	DBLP BibTeX RDF
12	Ryan Williams 0001	Matrix-vector multiplication in sub-quadratic time: (some preprocessing required).	SODA	2007	DBLP BibTeX RDF
12	Erik D. Demaine, Friedhelm Meyer auf der Heide, Rasmus Pagh, Mihai Patrascu	De Dictionariis Dynamicis Pauco Spatio Utentibus (lat. On Dynamic Dictionaries Using Little Space).	LATIN	2006	DBLP DOI BibTeX RDF
12	Wing-Kai Hon, Kunihiko Sadakane, Wing-Kin Sung	Breaking a Time-and-Space Barrier in Constructing Full-Text Indices.	FOCS	2003	DBLP DOI BibTeX RDF