Sciweavers

1729 search results - page 98 / 346
» Deterministic Expressions in C
Sort
View
STOC
2004
ACM
158views Algorithms» more  STOC 2004»
16 years 7 months ago
Collective asynchronous reading with polylogarithmic worst-case overhead
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander ...
SPAA
2009
ACM
16 years 1 months ago
Locally scalable randomized consensus for synchronous crash failures
We consider bit communication complexity of binary consensus in synchronous message passing systems with processes prone to crashes. A distributed algorithm is locally scalable wh...
Bogdan S. Chlebus, Dariusz R. Kowalski
ICCS
2007
Springer
16 years 1 months ago
Characterizing Implications of Injective Partial Orders
Abstract. Previous work of the authors has studied a notion of implication between sets of sequences based on the conceptual structure of a Galois lattice, and also a way of repres...
José L. Balcázar, Gemma C. Garriga
ALGORITHMICA
1999
156views more  ALGORITHMICA 1999»
15 years 6 months ago
Competitive Optimal On-Line Leasing
Consider an on-line player who needs some equipment (e.g., a computer) for an initially unknown number of periods. At the start of each period it is determined whether the player w...
Ran El-Yaniv, R. Kaniel, Nathan Linial
DATE
2006
IEEE
117views Hardware» more  DATE 2006»
16 years 27 days ago
Formal verification of systemc designs using a petri-net based representation
This paper presents an effective approach to formally verify SystemC designs. The approach translates SystemC models into a Petri-Net based representation. The Petri-net model is ...
Daniel Karlsson, Petru Eles, Zebo Peng