Sciweavers

CORR
2011
Springer
202views Education» more  CORR 2011»
13 years 7 months ago
High Degree Vertices, Eigenvalues and Diameter of Random Apollonian Networks
ABSTRACT. Upon the discovery of power laws [8, 16, 30], a large body of work in complex network analysis has focused on developing generative models of graphs which mimick real-wor...
Alan M. Frieze, Charalampos E. Tsourakakis
CORR
2008
Springer
99views Education» more  CORR 2008»
14 years 15 days ago
Perturbation analysis of an M/M/1 queue in a diffusion random environment
Abstract. We study in this paper an M/M/1 queue whose server rate depends upon the state of an independent Ornstein-Uhlenbeck diffusion process (X(t)) so that its value at time t i...
Christine Fricker, Fabrice Guillemin, Philippe Rob...
EUROPKI
2007
Springer
14 years 4 months ago
Time Capsule Signature: Efficient and Provably Secure Constructions
Time Capsule Signature, first formalized by Dodis and Yum in Financial Cryptography 2005, is a digital signature scheme which allows a signature to bear a (future) time t so that t...
Bessie C. Hu, Duncan S. Wong, Qiong Huang, Guomin ...
ISW
2001
Springer
14 years 4 months ago
Persistent Authenticated Dictionaries and Their Applications
Abstract. We introduce the notion of persistent authenticated dictionaries, that is, dictionaries where the user can make queries of the type “was element e in set S at time t?...
Aris Anagnostopoulos, Michael T. Goodrich, Roberto...
ISSRE
2002
IEEE
14 years 5 months ago
Worst Case Reliability Prediction Based on a Prior Estimate of Residual Defects
In this paper we extend an earlier worst case bound reliability theory to derive a worst case reliability function R(t), which gives the worst case probability of surviving a furt...
Peter G. Bishop, Robin E. Bloomfield
FC
2005
Springer
97views Cryptology» more  FC 2005»
14 years 6 months ago
Time Capsule Signature
Abstract. We introduce a new cryptographic problem called time capsule signature. Time capsule signature is a ‘future signature’ that becomes valid from a specific future time...
Yevgeniy Dodis, Dae Hyun Yum
SPAA
2005
ACM
14 years 6 months ago
Parallelizing time with polynomial circuits
We study the problem of asymptotically reducing the runtime of serial computations with circuits of polynomial size. We give an algorithmic size-depth tradeoff for parallelizing ...
Ryan Williams
ASAP
2005
IEEE
112views Hardware» more  ASAP 2005»
14 years 6 months ago
The Midlifekicker Microarchitecture Evaluation Metric
We introduce the midlifekicker metric for evaluating microarchitectures mostly during the design process. We assume a microarchitecture designed at a time T-1 and estimate if a ne...
Stamatis Vassiliadis, Leonel Sousa, Georgi Gaydadj...
EDBT
2008
ACM
150views Database» more  EDBT 2008»
15 years 17 days ago
Finding time-dependent shortest paths over large graphs
The spatial and temporal databases have been studied widely and intensively over years. In this paper, we study how to answer queries of finding the best departure time that minim...
Bolin Ding, Jeffrey Xu Yu, Lu Qin