10871 search results - page 1857 / 2175 » A stable programming language |
161
click to vote
ICALP
2005
Springer
16 years 8 days ago
2005
Springer
We reduce the approximation factor for Vertex Cover to 2 − Θ( 1√ log n ) (instead of the previous 2 − Θ(log log n log n ), obtained by Bar-Yehuda and Even [2], and by Moni...
131
click to vote
ICALP
2005
Springer
16 years 8 days ago
2005
Springer
This paper presents a new protocol for atomic broadcast in an asynchronous network with a maximal number of Byzantine failures. It guarantees both safety and liveness without maki...
148
click to vote
ICALP
2005
Springer
16 years 8 days ago
2005
Springer
We consider the problem of testing the commutativity of a black-box group specified by its k generators. The complexity (in terms of k) of this problem was first considered by Pa...
172
click to vote
ICALP
2005
Springer
16 years 8 days ago
2005
Springer
Abstract. We investigate a general paradigm for constructing arbitraryinput-length (AIL) MACs from fixed-input-length (FIL) MACs, define the waste as the relevant efficiency para...
183
click to vote
ICALP
2005
Springer
16 years 8 days ago
2005
Springer
Abstract. We study the use of the elaboration preorder (due to ArunKumar and Natarajan) in the framework of up-to techniques for weak bisimulation. We show that elaboration yields ...