{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:32:36Z","timestamp":1725489156017},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540002253"},{"type":"electronic","value":"9783540362067"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36206-1_16","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T03:23:08Z","timestamp":1187234588000},"page":"169-181","source":"Crossref","is-referenced-by-count":3,"title":["Algorithmic Combinatorics Based on Slicing Posets"],"prefix":"10.1007","author":[{"given":"Vijay K.","family":"Garg","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,12,16]]},"reference":[{"issue":"8","key":"16_CR1","doi-asserted-by":"publisher","first-page":"704","DOI":"10.1109\/32.940566","volume":"27","author":"S. Alagar","year":"2001","unstructured":"S. Alagar and S. Venkatesan. Techniques to tackle state explosion in global predicate detection. IEEE Transactions on Software Engineering, 27(8):704\u2013714, August 2001.","journal-title":"IEEE Transactions on Software Engineering"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"R. Cooper and K. Marzullo. Consistent detection of global predicates. In Proc. of the Workshop on Parallel and Distributed Debugging, pages 163\u2013173, Santa Cruz, CA, May 1991. ACM\/ONR.","DOI":"10.1145\/122759.122774"},{"key":"16_CR3","volume-title":"Introduction to Lattices and Order","author":"B.A. Davey","year":"1990","unstructured":"B.A. Davey and H.A. Priestley.Introduction to Lattices and Order. Cambridge University Press, Cambridge, UK, 1990."},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"S. Effler and F. Ruskey. A CAT algorithm for listing permutations with a given number of inversions. Information Processing Letters, 2002.","DOI":"10.1016\/S0020-0190(02)00481-7"},{"issue":"4","key":"16_CR5","doi-asserted-by":"publisher","first-page":"1075","DOI":"10.1137\/0215077","volume":"15","author":"U. Faigle","year":"1986","unstructured":"U. Faigle, L. Lov\u00e1sz, R. Schrader, and Gy. Tur\u00e1n. Searching in trees, seriesparallel and interval orders. SIAM Journal on Computing, 15(4):1075\u20131084, 1986.","journal-title":"SIAM Journal on Computing"},{"key":"16_CR6","unstructured":"V. K. Garg. Detecting global predicates in distributed computations. Technical report, Parallel and Distributed Systems Laboratory, ECE Dept. University of Texas at Austin, September 2002. available at http:\/\/www.ece.utexas.edu\/\u223cgarg\/pubs.html ."},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"V.K. Garg and N. Mittal. On slicing a distributed computation. In 21st International Conference on Distributed Computing Systems (ICDCS\u2019 01), pages 322\u2013329, Washington-Brussels-Tokyo, April 2001. IEEE.","DOI":"10.1109\/ICDSC.2001.918962"},{"key":"16_CR8","volume-title":"The Art of Computer Programming","author":"D. E. Knuth","year":"1998","unstructured":"Donald E. Knuth. Sorting and Searching, volume 3 of The Art of Computer Programming. Addison-Wesley, Reading, MA, USA, second edition, 1998.","edition":"second edition"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"N. Mittal and V. K. Garg. Slicing a distributed computation: Techniques and theory. In 5th International Symposium on DIStributed Computing (DISC\u201901), pages 78\u201392, October 2001.","DOI":"10.1007\/3-540-45414-4_6"},{"key":"16_CR10","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1137\/0212053","volume":"12","author":"J.S. Provan","year":"1983","unstructured":"J.S. Provan and M. O. Ball. The complexity of counting cuts and of computing the probability that a graph is connected. SIAM Journal on Computing, 12:777\u2013788, 1983.","journal-title":"SIAM Journal on Computing"},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"I. Rival. Maximal sublattices of finite distributive lattices. Proc. Amer. Math. Soc., pages 417\u2013420, 1973.","DOI":"10.1090\/S0002-9939-1973-0311527-9"},{"issue":"3","key":"16_CR12","doi-asserted-by":"publisher","first-page":"658","DOI":"10.1137\/0214048","volume":"14","author":"J. Spinrad","year":"1985","unstructured":"Jeremy Spinrad. On comparability and permutation graphs. SIAM Journal on Computing, 14(3):658\u2013670, 1985.","journal-title":"SIAM Journal on Computing"},{"key":"16_CR13","unstructured":"M. Squire. Gray Codes and Efficient Generation of Combinatorial Structures. PhD Dissertation, Department of Computer Science, North Carolina State University, 1995."},{"key":"16_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-9763-6","volume-title":"Enumerative Combinatorics","author":"R. Stanley","year":"1986","unstructured":"R. Stanley. Enumerative Combinatorics Volume 1. Wadsworth and Brookes\/ Cole, Monterey, California, 1986."},{"key":"16_CR15","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1287\/moor.9.2.248","volume":"9","author":"G. Steiner","year":"1984","unstructured":"G. Steiner. Single machine scheduling with precedence constraints of dimension 2. Math. Operations Research, 9:248\u2013259, 1984.","journal-title":"Math. Operations Research"},{"issue":"6","key":"16_CR16","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/0167-6377(86)90071-4","volume":"5","author":"G. Steiner","year":"1986","unstructured":"G. Steiner. An algorithm to generate the ideals of a partial order. Operations Research Letters, 5(6):317\u2013320, 1986.","journal-title":"Operations Research Letters"},{"key":"16_CR17","doi-asserted-by":"crossref","unstructured":"D. Stanton and D. White. Constructive Combinatorics. Springer-Verlag, 1986.","DOI":"10.1007\/978-1-4612-4968-9"},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"W.T. Trotter. Combinatorics and Partially Ordered Sets: Dimension Theory. The Johns Hopkins University Press, 1992.","DOI":"10.56021\/9780801844256"},{"key":"16_CR19","unstructured":"J.H. van Lint and R. M. Wilson. A Course in Combinatorics. Cambridge University Press, 1992."}],"container-title":["Lecture Notes in Computer Science","FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36206-1_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,13]],"date-time":"2023-05-13T16:18:54Z","timestamp":1683994734000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36206-1_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540002253","9783540362067"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-36206-1_16","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}