Sciweavers

73 search results - page 7 / 15
» An Improved Construction for Universal Re-encryption
Sort
View
DAC
2006
ACM
14 years 8 months ago
Timing-driven Steiner trees are (practically) free
Traditionally, rectilinear Steiner minimum trees (RSMT) are widely used for routing estimation in design optimizations like floorplanning and physical synthesis. Since it optimize...
Charles J. Alpert, Andrew B. Kahng, Cliff C. N. Sz...
CCS
2001
ACM
13 years 11 months ago
A verifiable secret shuffle and its application to e-voting
We present a mathematical construct which provides a cryptographic protocol to verifiably shuffle a sequence of k modular integers, and discuss its application to secure, universa...
C. Andrew Neff
FM
2005
Springer
112views Formal Methods» more  FM 2005»
14 years 1 months ago
Dynamic Component Substitutability Analysis
This paper presents an automated and compositional procedure to solve the substitutability problem in the context of evolving software systems. Our solution contributes two techniq...
Natasha Sharygina, Sagar Chaki, Edmund M. Clarke, ...
STOC
2005
ACM
133views Algorithms» more  STOC 2005»
14 years 8 months ago
An O(log n log log n) space algorithm for undirected st-connectivity
Abstract. We present a deterministic O(log n log log n) space algorithm for undirected stconnectivity. It is based on a space-efficient simulation of the deterministic EREW algorit...
Vladimir Trifonov
ICAT
2003
IEEE
14 years 28 days ago
Civil Engineering Application for Virtual Collaborative Environment
The motivation for this project was to find a way to give engineers, and the community affected by Civil Engineering work, information that is often difficult to visualise via com...
Mauricio Capra, Marcio Aquino, Alan Dodson, Borian...