Search

Your search keyword '"Ilcinkas, David"' showing total 32 results

Search Constraints

Start Over You searched for: Author "Ilcinkas, David" Remove constraint Author: "Ilcinkas, David" Journal distributed computing : 30th international symposium, disc 2016, paris, france, september 27-29, 2016. proceedings Remove constraint Journal: distributed computing : 30th international symposium, disc 2016, paris, france, september 27-29, 2016. proceedings
32 results on '"Ilcinkas, David"'

Search Results

1. Further Algebraic Algorithms in the Congested Clique Model and Applications to Graph-Theoretic Problems

2. Polynomial Lower Bound for Distributed Graph Coloring in a Weak LOCAL Model

3. Optimal Consistent Network Updates in Polynomial Time

4. Asynchronous Embedded Pattern Formation Without Orientation

5. Towards a Universal Approach for Monotonic Searchability in Self-stabilizing Overlay Networks

6. Near-Linear Lower Bounds for Distributed Distance Computations, Even in Sparse Networks

7. Upper Bounds for Boundless Tagging with Bounded Objects

8. Fast Distributed Algorithms for Testing Graph Properties

9. Deterministic Leader Election in Time with Messages of Size O(1)

10. Non-Bayesian Learning in the Presence of Byzantine Agents

11. Asynchronous Computability Theorems for t-Resilient Systems

12. Information Spreading in Dynamic Networks Under Oblivious Adversaries

13. Distributed Testing of Excluded Subgraphs

14. Lower Bound on the Step Complexity of Anonymous Binary Consensus

15. Priority Mutual Exclusion: Specification and Algorithm

16. How to Discreetly Spread a Rumor in a Crowd

17. Online Balanced Repartitioning

18. Buffer Size for Routing Limited-Rate Adversarial Traffic

19. Depth of a Random Binary Search Tree with Concurrent Insertions

20. k-Abortable Objects: Progress Under High Contention

21. Linearizability of Persistent Memory Objects Under a Full-System-Crash Failure Model

22. Fast Two-Robot Disk Evacuation with Wireless Communication

23. On Composition and Implementation of Sequential Consistency

24. Sublinear-Space Distance Labeling Using Hubs

25. Opacity vs TMS2: Expectations and Reality

26. Optimal Fair Computation

27. Certified Universal Gathering in for Oblivious Mobile Robots

28. Are Byzantine Failures Really Different from Crash Failures?

29. Anonymity-Preserving Failure Detectors

30. Non-local Probes Do Not Help with Many Graph Problems

31. Near-Optimal Low-Congestion Shortcuts on Bounded Parameter Graphs

32. Distributed Construction of Purely Additive Spanners

Catalog

Books, media, physical & digital resources