Sciweavers

4315 search results - page 176 / 863
» Sorting in linear time
Sort
View
ESA
2000
Springer
104views Algorithms» more  ESA 2000»
14 years 24 days ago
Efficient Algorithms for Centers and Medians in Interval and Circular-Arc Graphs
The p-center problem is to locate p facilities on a network so as to minimize the largest distance from a demand point to its nearest facility. The p-median problem is to locate p ...
Sergei Bespamyatnikh, Binay K. Bhattacharya, J. Ma...
SODA
1990
ACM
173views Algorithms» more  SODA 1990»
13 years 10 months ago
Suffix Arrays: A New Method for On-Line String Searches
A new and conceptually simple data structure, called a suffix array, for on-line string searches is introduced in this paper. Constructing and querying suffix arrays is reduced to...
Udi Manber, Gene Myers
SPAA
1997
ACM
14 years 1 months ago
Pipelining with Futures
Pipelining has been used in the design of many PRAM algorithms to reduce their asymptotic running time. Paul, Vishkin, and Wagener (PVW) used the approach in a parallel implementat...
Guy E. Blelloch, Margaret Reid-Miller
ICCAD
2003
IEEE
140views Hardware» more  ICCAD 2003»
14 years 6 months ago
Block-based Static Timing Analysis with Uncertainty
Static timing analysis is a critical step in design of any digital integrated circuit. Technology and design trends have led to significant increase in environmental and process v...
Anirudh Devgan, Chandramouli V. Kashyap
CONCUR
1992
Springer
14 years 1 months ago
The Duality of TIme and Information
The states of a computing system bear information and change time, while its events bear time and change information. We develop a primitive algebraic model of this duality of tim...
Vaughan R. Pratt