Sciweavers

876 search results - page 75 / 176
» Limits on the Usefulness of Random Oracles
Sort
View
96
Voted
SODA
2001
ACM
110views Algorithms» more  SODA 2001»
15 years 2 months ago
Absolute convergence: true trees from short sequences
Fast-converging methods for reconstructing phylogenetic trees require that the sequences characterizing the taxa be of only polynomial length, a major asset in practice, since rea...
Tandy Warnow, Bernard M. E. Moret, Katherine St. J...
78
Voted
ASPDAC
2006
ACM
107views Hardware» more  ASPDAC 2006»
15 years 6 months ago
Jitter decomposition in ring oscillators
Abstract— It is important to separate random jitter from deterministic jitter to quantify their contributions to the total jitter. This paper identifies the limitations of the e...
Qingqi Dou, Jacob A. Abraham
ICCD
2000
IEEE
120views Hardware» more  ICCD 2000»
15 years 5 months ago
Equivalence Checking Combining a Structural SAT-Solver, BDDs, and Simulation
This paper presents a verification technique for functional comparison of large combinational circuits using a novel combination of known approaches. The idea is based on a tight...
Viresh Paruthi, Andreas Kuehlmann
CORR
2008
Springer
97views Education» more  CORR 2008»
15 years 26 days ago
Lower bounds for adaptive linearity tests
Linearity tests are randomized algorithms which have oracle access to the truth table of some function f, and are supposed to distinguish between linear functions and functions whi...
Shachar Lovett
101
Voted
SIAMCOMP
2010
94views more  SIAMCOMP 2010»
14 years 11 months ago
Local Monotonicity Reconstruction
We propose a general model of local property reconstruction. Suppose we have a function f on domain Γ, which is supposed to have a particular property P, but may not have the pro...
Michael E. Saks, C. Seshadhri