Sciweavers

77 search results - page 16 / 16
» On Array Theory of Bounded Elements
Sort
View
JACM
2000
131views more  JACM 2000»
13 years 5 months ago
The soft heap: an approximate priority queue with optimal error rate
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...
Bernard Chazelle
FOCS
2006
IEEE
13 years 11 months ago
Points on Computable Curves
The “analyst’s traveling salesman theorem” of geometric measure theory characterizes those subsets of Euclidean space that are contained in curves of finite length. This re...
Xiaoyang Gu, Jack H. Lutz, Elvira Mayordomo