2168 search results - page 407 / 434 » Randomized Algorithms and Complexity Theory |
139
click to vote
CCR
2008
15 years 2 months ago
2008
With steady improvement in the reliability and performance of communication devices, routing instabilities now contribute to many of the remaining service degradations and interru...
113
click to vote
CG
2006
Springer
15 years 2 months ago
2006
Springer
The investigation of molecular structures often requires the use of graphics software to display different representations of the molecule of interest. Unfortunately, the commonly...
116
Voted
ECCC
2006
15 years 2 months ago
2006
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
122
Voted
JACM
2000
15 years 2 months ago
2000
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...
149
Voted
DAM
2011
14 years 9 months ago
2011
Partial words, which are sequences that may have some undefined positions called holes, can be viewed as sequences over an extended alphabet A = A ∪ { }, where stands for a hol...