Sciweavers

15792 search results - page 243 / 3159
» Computational Abstraction Steps
Sort
View
ICDCN
2009
Springer
16 years 2 months ago
Fault-Tolerant Implementations of Regular Registers by Safe Registers with Applications to Networks
We present the first wait-free and self-stabilizing implementation of a single-writer/single-reader regular register by single-writer/single-reader safe registers. The constructio...
Colette Johnen, Lisa Higham
FCT
2001
Springer
15 years 11 months ago
Relating Automata-Theoretic Hierarchies to Complexity-Theoretic Hierarchies
We show that some natural refinements of the Straubing and Brzozowski hierarchies correspond (via the so called leaf-languages) step by step to similar refinements of the polynom...
Victor L. Selivanov
DCC
1999
IEEE
15 years 11 months ago
The Effect of Flexible Parsing for Dynamic Dictionary Based Data Compression
We report on the performance evaluation of greedy parsing with a single step lookahead, denoted as flexible parsing. We also introduce a new fingerprint based data structure which...
Yossi Matias, Nasir Rajpoot, Süleyman Cenk Sa...
FOCS
1996
IEEE
15 years 11 months ago
Universal Stability Results for Greedy Contention-Resolution Protocols
In this paper, we analyze the behavior of communication networks in which packets are generated dynamically at the nodes and routed in discrete time steps across the edges. We foc...
Matthew Andrews, Baruch Awerbuch, Antonio Fern&aac...
RELMICS
1997
Springer
15 years 11 months ago
Relational Matching for Graphical Calculi of Relations
In this paper we extend an earlierapproach to graphicalrelationcalculitowards relational matching, thus allowing proofs with fewer auxiliary steps and concentrating more on the es...
Wolfram Kahl