Comments? You can tell
me what you think or send me things through:
|
Publications
Journal papers
Conference papers
- Anti-Omega: the weakest failure detector for set agreement
27th ACM Symposium on
Principles of Distributed Computing (PODC 2008)
conference paper
conference talk
Piotr Zieliński
-
Automatic classification of eventual
failure detectors
21th International
Symposium on Distributed Computing (DISC 2007),
September 2007.
conference version
extended version
Piotr Zieliński
-
Sampled traffic analysis by
Internet Exchange level adversaries
Privacy
Enhancing Technologies, June 2007.
Steven J. Murdoch
and Piotr Zieliński
-
Automatic verification and discovery of Byzantine Consensus protocols
The 37th Annual IEEE/IFIP
International Conference on Dependable Systems and Networks (DSN
2007), June 2007.
preprint
EPFL talk
DSN’07 talk
Piotr Zieliński
-
Low-latency Atomic Broadcast in the presence of contention
20th International Symposium on Distributed Computing (DISC
2006), September 2006.
extended version,
conference talk
Piotr Zieliński
-
Optimistically Terminating Consensus
5th International Symposium on
Parallel and Distributed Computing (ISPDC 2006), July
2006.
extended
version,
conference talk
Piotr Zieliński
-
On the Power of Anonymous Veto in Public Discussion
Security Protocols Workshop, Cambridge, UK, April 2006.
Feng Hao and Piotr
Zieliński
conference
talk,
cavendish talk,
poznan talk
-
Optimistic Generic Broadcast
19th International
Symposium on Distributed Computing (DISC 2005), September
2005.
conference version
extended
version,
conference talk,
complab talk,
microsoft talk,
cavendish talk
Piotr Zieliński
-
Covert channels for collusion in
online computer games
Information
Hiding, May 2004.
Steven J. Murdoch
and Piotr Zieliński
PhD Thesis
Technical Reports
Unpublished notes
- Sub-Consensus hierarchy is
false
Consider an n-process asynchronous shared memory system. Each
query to the ¬Ωk failure detector outputs n-k
processes; at least one correct process is eventually never
output. The "folklore" sub-Consensus hierarchy conjecture
states that any task not solvable with ¬Ωk requires
¬Ωk-1. The case k=n is true: any
non-free-implementable task requires ¬Ωn-1. In
general, however, the conjecture is false.
- Optimal codes for human beings
Standard T9 coding system is
suboptimal. Dasher
requires constant feedback. This paper presents a coding system
that is human-friendly, easily memorizable, and optimal in some
precisely defined sense. It has been implemented
in Tapir.
Posters and Talks
|