Source: http://www.cs.toronto.edu/~vassos/research/list-of-publications.html
Timestamp: 2019-04-22 02:04:47+00:00

Document:
The material listed here is copyrighted by the respective publisher or, in the case of unpublished papers, by my co-author(s) and me. Permission to copy postscript versions (where available) is granted under the principle of ``fair use''. In some cases, the postscript file provided here is of a slightly earlier version of the paper than the published one; the differences, if any, are minor.
R. Danek and V. Hadzilacos. ``Local-spin group mutual exclusion algorithms.'' Proceedings of the 18th International Symposium on Distributed Computing}, Amsterdam, the Netherlands, October 2004 . Amsterdam, the Netherlands, October 2004.
C. Delporte-Gallet, H. Fauconnier, R. Guerraoui, V. Hadzilacos, P. Kouznetzov and S. Toueg. ``The weakest failure detectors to solve certain fundamental problems in distributed computing.'' Proceedings of the 20th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing . St. John's, Newfoundland, Canada, July 2004.
V. Hadzilacos. ``A note on group mutual exclusion''. Proceedings of the 20th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing . Newport, RI, August 2001.
T.D. Chandra, V. Hadzilacos, P. Jayanti and S. Toueg. ``Generalized irreducibility of consensus and the equivalence of t-resilient and wait-free implementations of consensus''. To appear in the SIAM Journal on Computing.
T.D. Chandra, V. Hadzilacos, P. Jayanti and S. Toueg. ``The h_m^r hierarchy is not robust''. Submitted for publication.
W.K. Lo and V. Hadzilacos. ``All of us are smarter than any of us: nondeterministic wait-free hierarchies are not robust''. SIAM Journal on Computing, 30(3):689--728, 2001.
W.K. Lo and V. Hadzilacos. ``On the power of shared object types to implement one-resilient Consensus''. Distributed Computing, 13(4):219--238, 2000.
K. Lin and V. Hadzilacos. ``Asynchronous group membership with oracles''. Proceedings of the 13th International Symposium on Distributed Computing . Bratislava, Slovakia, September 1999, pp. 79-93.
T.D. Chandra, V. Hadzilacos, S. Toueg and B. Charron-Bost ``Impossibility of group membership in asynchronous systems''.Proceedings of the 15th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing . Philadelphia, PA, May 1996, pp. 322-330.
T.D. Chandra, V. Hadzilacos and S. Toueg. ``The weakest failure detector for solving consensus''. Journal of the ACM, 43(4):685--722, July 1996.
W.K. Lo and V. Hadzilacos. ``Using failure detectors to solve consensus in asynchronous shared-memory systems''. Proceedings of the 8th International Workshop on Distributed Algorithms. Terschelling, The Netherlands, September--October 1994, pp.~280--295.
T.D. Chandra, V. Hadzilacos, P. Jayanti and S. Toueg. ``Wait-freedom vs. t-resiliency and the robustness of the h_m^r hierarchy. Proceedings of the 13th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing. Los Angeles, CA, August 1994, pp.~334--343.
V. Hadzilacos and S. Toueg. ``A modular approach to the specification and implementation of fault-tolerant broadcasts''. Technical Report TR94-1425. Department of Computer Science, Cornell University, Ithaca NY. May 1994.
V. Hadzilacos and J.Y. Halpern. ``Message-optimal protocols for Byzantine agreement''. Mathematical Systems Theory , 26:41--102, 1993.
V. Hadzilacos and J.Y. Halpern. ``The failure discovery problem''. Mathematical Systems Theory, 26:103--129, 1993.
E. Anagnostou and V. Hadzilacos. ``Tolerating transient and permanent failures''. Proceedings of the 7th International Workshop on Distributed Algorithms. Les Diablerets, Switzerland, September 1993 pp. 174--188.
E.S. Amdur, S.M. Weber and V. Hadzilacos. ``On the message complexity of binary Byzantine agreement under crash failures''.Distributed Computing, 5:175--186, 1992.
E. Anagnostou, R. El-Yaniv and V. Hadzilacos. ``Memory adaptive and fast self-stabilizing protocols''. Proceedings of the 6th Workshop on Distributed Algorithms. Haifa, Israel, November 1992, pp. 203-220.
E.A. Lycklama and V. Hadzilacos. ``A first-come-first-served mutual exclusion algorithm with small communication variables''. ACM Transactions on Programming Languages and Systems, 13(4):558--576, October 1991.
V. Hadzilacos. ``On the relationship between the atomic commitment and consensus problems''. Proceedings of the Workshop on Fault-Tolerant Distributed Computing. March 17--19, 1986, Pacific Grove, CA. Lecture Notes in Computer Science Vol. 448 (B. Simons and A. Spector, eds.), Springer-Verlag 1990, pp. 201-208.
V. Hadzilacos. ``Connectivity requirements for Byzantine agreement under restricted types of failures''. Distributed Computing, 2:95--103, 1987.
V. Hadzilacos. ``A knowledge-theoretic analysis of atomic commitment protocols (Preliminary Report)''. Proceedings of the 6th ACM SIGACT-SIGMOD Symposium on Principles of Database Systems. San Diego, CA, March 1987, pp. 129--134.
V.K. Chaudhri and V. Hadzilacos. ``Safe locking policies for dynamic databases''. Journal of Computer and System Science, 57:260--271, 1998.
V.K. Chaudhri, V. Hadzilacos, J. Mylopoulos and K.C. Sevcik. ``Quantitative evaluation of a transaction facility for a knowledge base management system''. Proceedings of the 3rd International Conference on Knowledge Management. Gaithersberg, MD, USA, November--December 1994, pp.~122-131.
T. Hadzilacos and V. Hadzilacos. ``Transaction synchronisation in object bases''. Journal of Computer and System Science, 43(1):2--24, August 1991.
V. Hadzilacos. ``A theory of reliability for database systems''. Journal of the ACM, 35(1):121--145, January 1988.
P.A. Bernstein, N. Goodman and V. Hadzilacos. ``Recovery algorithms for database systems''. In Information Processing 83, R.E.A. Mason ed. (Proceedings of the IFIP 9th World Computer Congress). North-Holland, Amsterdam, 1983, pp. 799--807.
V. Hadzilacos. ``An algorithm for minimizing roll-back cost''. Proceedings of the 1st ACM SIGACT-SIGMOD Symposium on Principles of Database Systems. Los Angeles, CA, March 1982, pp. 93--97.

References: V. 
 V. 

V. 
 V. 
 V. 
 V. 
 V. 
 V. 
 V. 
 V. 
 V. 
 V. 

V. 

V. 

V. 
 V. 
 V. 
 V. 
 V. 

V. 

V. 

V. 
 V. 
 V. 
 V. 

V. 
 V. 

V.