2095 search results - page 247 / 419 » Improved pebbling bounds |
160
Voted
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. Asynchronous automata are parallel compositions of finitestate processes synchronizing over shared variables. A deep theorem due to Zielonka says that every regular trac...
159
Voted
ASIACRYPT
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. We give a careful, fixed-size parameter analysis of a standard [1,4] way to form a pseudorandom generator by iterating a one-way function and then pseudo-random function...
183
Voted
ICALP
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. In this paper we investigate automated methods for externalizing internal memory data structures. We consider a class of balanced trees that we call weight-balanced parti...
170
click to vote
ICALP
2001
Springer
15 years 11 months ago
2001
Springer
We consider the set Gn of all period sets of strings of length n over a finite alphabet. We show that there is redundancy in period sets and introduce the notion of an irreducibl...
168
click to vote
MINAR
1998
Springer
15 years 11 months ago
1998
Springer
SimilarityIndexing is very importantfor content-basedretrieval on large multimedia databases, and the "tightness"of data set envelope is a factor that influences the perf...