828 search results - page 85 / 166 » Bounded Hairpin Completion |
DAC
2005
ACM
16 years 1 months ago
2005
ACM
We present several improvements to general-purpose sequential redundancy removal. First, we propose using a robust variety of synergistic transformation and verification algorithm...
124
Voted
VLSID
2005
IEEE
16 years 1 months ago
2005
IEEE
In this article we address efficiency issues in implementation of Monte Carlo algorithm for 3D capacitance extraction. Error bounds in statistical capacitance estimation are discus...
75
Voted
STOC
2005
ACM
16 years 29 days ago
2005
ACM
We present a deterministic, log-space algorithm that solves st-connectivity in undirected graphs. The previous bound on the space complexity of undirected st-connectivity was log4...
89
Voted
STOC
2003
ACM
16 years 29 days ago
2003
ACM
We study novel combinatorial properties of graphs that allow us to devise a completely new approach to dynamic all pairs shortest paths problems. Our approach yields a fully dynam...
98
Voted
FSTTCS
2009
Springer
15 years 7 months ago
2009
Springer
Motivated by the Hadamard product of matrices we define the Hadamard product of multivariate polynomials and study its arithmetic circuit and branching program complexity. We also...