13603 search results - page 2660 / 2721 » On the Complexity of Computing Treelength |
154
click to vote
ASYNC
2000
IEEE
15 years 10 months ago
2000
IEEE
Fault Abstraction and Collapsing Framework for Asynchronous Circuits Philip P. Shirvani, Subhasish Mitra Center for Reliable Computing Stanford University Stanford, CA Jo C. Eberge...
159
click to vote
LICS
2000
IEEE
15 years 10 months ago
2000
IEEE
We consider two-player games which are played on a finite state space for an infinite number of rounds. The games are concurrent, that is, in each round, the two players choose ...
182
click to vote
WETICE
2000
IEEE
15 years 10 months ago
2000
IEEE
This paper presents joint work by the California Institute of Technology’s Jet Propulsion Laboratory and the University of California at Davis (UC Davis) sponsored by the Nation...
146
click to vote
ASPLOS
2000
ACM
15 years 10 months ago
2000
ACM
The emergence of the Internet as a trusted medium for commerce and communication has made cryptography an essential component of modern information systems. Cryptography provides ...
163
click to vote
ISSTA
2000
ACM
15 years 10 months ago
2000
ACM
During the past two decades many di erent pointer analysis algorithms have been published. Although some descriptions include measurements of the e ectiveness of the algorithm, qu...