4315 search results - page 786 / 863 » Sorting in linear time |
145
click to vote
ICCAD
1999
IEEE
15 years 7 months ago
1999
IEEE
The minimum rectilinear Steiner tree (RST) problem is one of the fundamental problems in the field of electronic design automation. The problem is NP-hard, and much work has been ...
130
click to vote
EURODAC
1994
IEEE
15 years 7 months ago
1994
IEEE
- The accelerator is destined to circuit-level simulation of digital and analog/digital MOS VLSI'c containing of up to 100 thousand transistors (with 16 Mb RAM host-machine). ...
122
click to vote
EUROSYS
2010
ACM
15 years 7 months ago
2010
ACM
When a performance crisis occurs in a datacenter, rapid recovery requires quickly recognizing whether a similar incident occurred before, in which case a known remedy may apply, o...
128
click to vote
FSE
1994
Springer
15 years 7 months ago
1994
Springer
This paper shows that the actual proposal for an unbalanced Feistel network by Schneier and Blaze is as vulnerable to differential cryptanalysis as the DES. 1 McGuffin Schneier and...
165
click to vote
PODS
1994
ACM
15 years 6 months ago
1994
ACM
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...