Bibliography

  1. A. Agarwal and V. K. Garg. Efficient dependency tracking for relevant events in shared-memory systems. In M. K. Aguilera and J. Aspnes, editors, Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, PODC 2005, Las Vegas, NV, July 17-20, 2005, pages 19–28. ACM, 2005.
  2. A. Agarwal, V. K. Garg, and V. A. Ogale. Modeling and analyzing periodic distributed computations. In S. Dolev, J. A. Cobb, M. J. Fischer, and M. Yung, editors, Stabilization, Safety, and Security of Distributed Systems - 12th International Symposium, SSS 2010, New York, NY, September 20-22, 2010. Proceedings, volume 6366 of Lecture Notes in Computer Science, pages 191–205. Springer, 2010.
  3. S. Alagar and S. Venkatesan. Techniques to tackle state explosion in global predicate detection. IEEE Transactions on Software Engineering, 27(8):704–714, 2001.
  4. G. Birkhoff. Lattice Theory. Providence, RI, 1940. First edition.
  5. G. Birkhoff. Lattice Theory. Providence, RI, 1948. Second edition.
  6. G. Birkhoff. Lattice Theory. Providence, RI, 1967. Third edition.
  7. K. P. Bogart. An obvious proof of fishburn's interval order theorem. Discrete Mathematics, 118(1):21–23, 1993.
  8. B. Bosek, S. Felsner, K. Kloch, T. Krawczyk, G. Matecki, and P. Micek. On-line chain partitions of orders: a survey. Order, 29:49–73, 2012. DOI: 10.1007/s11083-011- 9197-1.
  9. N. Caspard, B. Leclerc, and B. Monjardet. Finite Ordered Sets: Concepts, Results and Uses, volume 144. Cambridge University Press, 2012.
  10. A. Chakraborty and V. K. Garg. On reducing the global state graph for verification of distributed computations. In International Workshop on Microprocessor Test and Verification (MTV'06)>, Austin, TX, December 2006.
  11. C. Chase and V. K. Garg. On techniques and their limitations for the global predicate detection problem. In Proceedings of the Workshop on Distributed Algorithms, pages 303–317, France, September 1995.
  12. C. M. Chase and V. K. Garg. Detection of global predicates: techniques and their limitations. Distributed Computing, 11(4):191–201, 1998.
  13. R. Cooper and K. Marzullo. Consistent detection of global predicates. In Proceedings of the Workshop on Parallel and Distributed Debuyyiny, pages 163–173, Santa Cruz, CA, May 1991.
  14. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. The MIT Press and McGraw-Hill, 2001. Second edition.
  15. B. A. Davey and H. A. Priestley. Introduction to Lattices and Order. Cambridge University Press, Cambridge, UK, 1990.
  16. E. W. Dijkstra and C. S. Scholten. Predicate Calculus and Program Semantics. Springer-Verlag New York Inc., New York, 1990.
  17. R. P. Dilworth. A decomposition theorem for partially ordered sets. Annals of Mathematics, 51:161–166, 1950.
  18. B. Dushnik and E. Miller. Partially ordered sets. American Journal of Mathematics, 63:600–610, 1941.
  19. E. Egervary. On combinatorial properties of matrices. Matematikai Lapok, 38:16–28, 1931.
  20. S. Effler and F. Ruskey. A CAT algorithm for generating permutations with a fixed number of inversions. Information Processing Letters, 86(2), 107–112, (2003).
  21. U. Faigle, L. Lovász, R. Schrader, and Gy. Turán. Searching in trees, series-parallel and interval orders. SIAM Journal on Computing, 15(4):1075–1084, 1986.
  22. S. Felsner. On-line chain paritions of orders. Theoretical Computer Science, 175: 283–292, 1997.
  23. C. J. Fidge. Partial orders for parallel debugging. Proceedings of the ACM SIGPLAN/SIGOPS Workshop on Parallel and Distributed Debugging, (ACM SIGPLAN Notices), 24(1):183–194, 1989.
  24. P. C. Fishburn. Interval Orders and Interval Graphs. John Wiley and Sons, 1985.
  25. R. Freese, J. Jaroslav, and J. B. Nation. Free Lattices. American Mathematical Society, 1996.
  26. D. R. Fulkerson. Note on dilworth's decomposition theorem for partially ordered sets. Proceedings of the American Mathematical Society, 7(4):701–702, 1956.
  27. F. Galvin. A proof of dilworth's chain decomposition theorem. American Mathematical Monthly, 101(4):352–353, 1994.
  28. B. Ganter and K. Reuter. Finding all closed sets: a general approach. Order, 8(3):283–290, 1991.
  29. V. K. Garg. An algebraic approach to modeling probabilistic discrete event systems. In Decision and Control, 1992, Proceedings of the 31st IEEE Conference on, pages 2348–2353. IEEE, 1992.
  30. V. K. Garg. Enumerating global states of a distributed computation. In International Conference on Parallel and Distributed Computing and Systems, pages 134–139, November 2003.
  31. V. K. Garg. Algorithmic combinatorics based on slicing posets. Theoretical Computer Science, 359(1-3):200–213, 2006.
  32. V. K. Garg. Lattice completion algorithms for distributed computations. In Proceedings of Principles of Distributed Systems, 16th International Conference, OPODIS 2012, Rome, Italy, December 18-20, 2012. pages 166–180, December 2012.
  33. V. K. Garg. Maximal antichain lattice algorithms for distributed computations. In D. Frey, M. Raynal, S. Sarkar, R. K. Shyamasundar, and P. Sinha, editors, ICDCN, volume 7730 of Lecture Notes in Computer Science, pages 240–254. Springer, 2013.
  34. V. K. Garg. Lexical enumeration of combinatorial structures by enumerating order ideals. Technical report, University of Texas at Austin, Dept. of Electrical and Computer Engineering, Austin, TX, 2014.
  35. V. K. Garg and N. Mittal. On slicing a distributed computation. In 21st International Conference on Distributed Computing Systems (ICDCS' 01), pages 322–329, Washington - Brussels - Tokyo, April 2001. IEEE.
  36. V. K. Garg and C. Skawratananond. String realizers of posets with applications to distributed computing. In 20th Annual ACM Symposium on Principles of Distributed Computing (PODC-00), pages 72–80. ACM, August 2001.
  37. G. Grätzer. Lattice Theory. W.H. Freeman and Company, San Francisco, CA, 1971.
  38. G. Grätzer. General Lattice Theory. Birkhäuser, Basel, 2003.
  39. J.Y. Halpern and Y. Moses. Knowledge and common knowledge in a distributed environment. In Proceedings of the ACM Symposium on Principles of Distributed Computing, pages 50–61, Vancouver, BC, 1984.
  40. T. Hiraguchi. On the dimension of orders. Science Reports of Kanazawa University, 4:1–20, 1955.
  41. J. E. Hopcroft and R. M. Karp. A bref-math-0001 algorithm for maximum matchings in bipartite. In Switching and Automata Theory, 1971, 12th Annual Symposium on, pages 122–125–, October 1971.
  42. S. Ikiz and V. K. Garg. Efficient incremental optimal chain partition of distributed program traces. In ICDCS, page 18–. IEEE Computer Society, 2006.
  43. G.-V. Jourdan, J.-X. Rampon, and C. Jard. Computing on-line the lattice of maximal antichains of posets. Order, 11:197–210, 1994. DOI: 10.1007/BF02115811.
  44. H. A. Kierstead. Recursive colorings of highly recursive graphs. Canadian Journal of Mathematics, 33(6):1279–1290, 1981.
  45. D. E. Knuth. Sorting and searching, volume 3 of The Art of Computer Programming. Addison-Wesley, Reading, MA, Second edition, 1998.
  46. K. M. Koh. On the lattice of maximum-sized antichains of a finite poset. Algebra Universalis, 17(1):73–86, 1983.
  47. D. Konig. Graphen und matrizen. Matematikaiés Fizikai Lapok, 38:116–119, 1931.
  48. L. Lamport. Time, clocks, and the ordering of events in a distributed system. Communications of the ACM, 21(7):558–565, 1978.
  49. J.-L. Lassez, V. L. Nguyen, and E. A. Sonenberg. Fixed point theorems and semantics: a folk tale. Information Processing Letters, 14(3):112–116, 1982.
  50. F. Mattern. Virtual time and global states of distributed systems. In Proceedings of the International Workshop on Parallel and Distributed Algorithms, pages 215–226, 1989.
  51. L. Mirsky. A dual of dilworth's decomposition theorem. American Mathematical Monthly, 78(8):876–877, 1971.
  52. N. Mittal and V. K. Garg. On detecting global predicates in distributed computations. In 21st International Conference on Distributed Computing Systems (ICDCS' 01), pages 3–10, Washington - Brussels - Tokyo, April 2001. IEEE.
  53. N. Mittal and V. K. Garg. Slicing a distributed computation: Techniques and theory. In 5th International Symposium on DIStributed Computing (DISC'01), October 2001.
  54. N. Mittal and V. K. Garg. Rectangles are better than chains for encoding partially ordered sets. Technical report, University of Texas at Austin, Dept. of Electrical and Computer Engineering, Austin, TX, September 2004.
  55. N. Mittal, A. Sen, and V. K. Garg. Solving computation slicing using predicate detection. IEEE Transactions on Parallel and Distributed Systems, 18(12):1700–1713, 2007.
  56. R. H. Mohring. Computationally tractable classes of ordered sets. Algorithms and Order, pages 105–192. Kluwer Academic Publishers, Dordrecht, 1989.
  57. L. Nourine and O. Raynaud. A fast algorithm for building lattices. Information Processing Letters, 71(5-6):199–204, 1999.
  58. L. Nourine and O. Raynaud. A fast incremental algorithm for building lattices. Journal of Experimental & Theoretical Artificial Intelligence, 14(2-3):217–227, 2002.
  59. I. Rabinovitch and I. Rival. The rank of a distributive lattice. Discrete Mathematics, 25(3):275–279, 1979.
  60. O. Raynaud and E. Thierry. The complexity of embedding orders into small products of chains. Order, 27:365–381, 2010.
  61. N. Reading. Order dimension, strong bruhat order and lattice properties of posets. Order, 19:73–100, 2002.
  62. K. Reuter. The jump number and the lattice of maximal antichains. Discrete Mathematics, 88(2â “3):289–307, 1991.
  63. S. Roman. Lattices and Ordered Sets. Springer, 2008.
  64. J. Spinrad. On comparability and permutation graphs. SIAM Journal on Computing, 14(3):658–670, 1985.
  65. D. Stanton and D. White. Constructive Combinatorics. Springer-Verlag, 1986.
  66. G. Steiner. Single machine scheduling with precedence constraints of dimension 2. Mathematics of Operations Research, 9:248–259, 1984.
  67. E. Szpilrajn. La dimension et la mesure. Fundamenta Mathematicae, 28:81–89, 1937.
  68. A. Tarski. A lattice-theoretic fixed point theorem and its applications. Pacific Journal of Mathematics, 5:285–309, 1955.
  69. A. I. Tomlinson and V. K. Garg. Monitoring functions on global states of distributed programs. Journal for Parallel and Distributed Computing, 1997. a preliminary version appeared in Proceedings of the ACM Workshop on Parallel and Distributed Debugging, San Diego, CA, May 1993, pp.21–31.
  70. W. T. Trotter. Combinatorics and Partially Ordered Sets: Dimension Theory. The Johns Hopkins University Press, 1992.
  71. J. H. van Lint and R. M. Wilson. A Course in Combinatorics. Cambridge University Press, 1992.
  72. D. B. West. Order and Optimization. 2004. pre-release version.
..................Content has been hidden....................

You can't read the all page of ebook, please click here login for view all page.
Reset
3.15.154.69