{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T05:41:13Z","timestamp":1737006073147,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540427339"},{"type":"electronic","value":"9783540454960"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45496-9_6","type":"book-chapter","created":{"date-parts":[[2007,5,5]],"date-time":"2007-05-05T13:08:40Z","timestamp":1178370520000},"page":"66-81","source":"Crossref","is-referenced-by-count":1,"title":["Computational Forensic Techniques for Intellectual Property Protection"],"prefix":"10.1007","author":[{"given":"Jennifer L.","family":"Wong","sequence":"first","affiliation":[]},{"given":"Darko","family":"Kirovski","sequence":"additional","affiliation":[]},{"given":"Miodrag","family":"Potkonjak","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,10,24]]},"reference":[{"key":"6_CR1","unstructured":"B. S. Baker and U. Manber. Deducing similarities in Java sources from byte-codes. USENIX Technical Conference, pp. 179\u201390, 1998."},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"R. J. Bayardo and R. Schrag. Using CSP look-back techniques to solve exceptionally hard SAT instances. Principles and Practice of Constraint Programming, pp. 46\u201360, 1996.","DOI":"10.1007\/3-540-61551-2_65"},{"issue":"2","key":"6_CR3","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1145\/269012.269017","volume":"41","author":"B. C. Behrens","year":"1998","unstructured":"B. C. Behrens and R. R. Levary. Practical legal aspects of software reverse engineering. Comm. of the ACM, vol. 41, (no. 2), pp. 27\u20139, 1998.","journal-title":"Comm. of the ACM"},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1145\/359094.359101","volume":"22","author":"D. Brelaz","year":"1979","unstructured":"D. Brelaz. New methods to color the vertices of a graph. Comm. of the ACM, vol. 22, (no. 4), pp. 251\u20136, 1979.","journal-title":"Comm. of the ACM"},{"issue":"2","key":"6_CR5","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1145\/568271.223855","volume":"24","author":"S. Brin","year":"1995","unstructured":"S. Brin, J. Davis, and H. Garcia-Molina. Copy detection mechanisms for digital documents. SIGMOD Record, vol. 24, (no. 2), pp. 398\u2013409, 1995.","journal-title":"SIGMOD Record"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"R. E. Bryant. Binary decision diagrams and beyond: enabling technologies for formal verification. ICCAD, pp. 236\u2013243, 1995.","DOI":"10.1109\/ICCAD.1995.480018"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"E. Charbon and I. Torunoglu. Watermarking layout topologies. ASP-DAC, pp. 213\u201316, 1999.","DOI":"10.1109\/ASPDAC.1999.759998"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"C. S. Collberg and C. Thomborson. Software Watermarking: Models and Dynamic Embeddings. Symposium on Principles of Programming Languages, 1999.","DOI":"10.1145\/292540.292569"},{"key":"6_CR9","unstructured":"J. M. Crawford. Solving Satisfiability Problems Using a Combination of Systematic and Local Search. Second DIMACS Challenge, 1993."},{"key":"6_CR10","unstructured":"http:\/\/www.cs.ualberta.ca\/joe"},{"key":"6_CR11","volume-title":"Probability and Statistics","author":"M. Groot De","year":"1989","unstructured":"M. De Groot. Probability and Statistics. Addison-Wesley, Reading, 1989."},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"S. Devadas. Optimal layout via Boolean satisfiability. Internationsl Conference on Computer-Aided Design, pp. 294\u20137, 1989.","DOI":"10.1109\/ICCAD.1989.76956"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"B. Efron, R. Tibshirani. An introduction to the bootstrap. 1993.","DOI":"10.1007\/978-1-4899-4541-9"},{"key":"6_CR14","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/BF02125407","volume":"63","author":"C. Fleurent","year":"1996","unstructured":"C. Fleurent and J. A. Ferland. Genetic and hybrid algorithms for graph coloring. Annals of Operations Research, vol. 63, pp. 437\u2013461, 1996.","journal-title":"Annals of Operations Research"},{"key":"6_CR15","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson. Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman, San Francisco, 1979."},{"issue":"6","key":"6_CR16","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"M. X. Goemans","year":"1995","unstructured":"M. X. Goemans and D. P. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. of the ACM, vol. 42, (no. 6), pp. 1115\u201345, 1995.","journal-title":"J. of the ACM"},{"issue":"2","key":"6_CR17","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/S0267-3649(97)82141-3","volume":"14","author":"D. Grover","year":"1998","unstructured":"D. Grover. Forensic copyright protection. Computer Law and Security Report, vol14, (no. 2), pp. 121\u20132, 1998.","journal-title":"Computer Law and Security Report"},{"key":"6_CR18","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-1904-8","volume-title":"Principal component analysis","author":"I. T. Jolliffe","year":"1986","unstructured":"I. T. Jolliffe. Principal component analysis. New York, Springer-Verlag, 1986."},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"A. B. Kahng et al. Robust IP Watermarking Methodologies for Physical Design. DAC, 1998.","DOI":"10.1145\/277044.277241"},{"key":"6_CR20","unstructured":"H. Karhunen. Ueber lineare Methoden in der Wahrscheinlichkeitsrechnung. Ann. Acad. Sci. Fenn. AI, 37, 1947."},{"key":"6_CR21","doi-asserted-by":"crossref","unstructured":"D. Kirovski and M. Potkonjak. Efficient coloring of a large spectrum of graphs. DAC, pp. 427\u201332, 1998.","DOI":"10.1145\/277044.277165"},{"key":"6_CR22","doi-asserted-by":"crossref","unstructured":"H. Konuk and T. Larrabee. Explorations of sequential ATPG using Boolean Satisfiability. IEEE VLSI Test Symposium, pp. 85\u201390, 1993.","DOI":"10.1109\/VTEST.1993.313303"},{"key":"6_CR23","doi-asserted-by":"crossref","first-page":"489","DOI":"10.6028\/jres.084.024","volume":"84","author":"F. T. Leighton","year":"1979","unstructured":"F. T. Leighton. A Graph Coloring Algorithm for Large Scheduling Algorithms. Journal of Res. Natl. Bur. Standards, vol. 84, pp. 489\u2013506, 1979.","journal-title":"Journal of Res. Natl. Bur. Standards"},{"key":"6_CR24","volume-title":"Fonctions Aleatoire de Seconde Ordre","author":"M. Loeve","year":"1948","unstructured":"M. Loeve. Fonctions Aleatoire de Seconde Ordre. Hermann. Paris. 1948."},{"issue":"1","key":"6_CR25","first-page":"88","volume":"21","author":"D. F. McGahn","year":"1995","unstructured":"D. F. McGahn. Copyright infringement of protected computer software: an analytical method to determine substantial similarity. Rutgers Computer & Technology Law Journal, vol. 21, (no. 1), pp. 88\u2013142, 1995.","journal-title":"Rutgers Computer & Technology Law Journal"},{"key":"6_CR26","doi-asserted-by":"crossref","unstructured":"G. Qu and M. Potkonjak. Analysis of watermarking techniques for graph coloring problem. ICCAD, 1998.","DOI":"10.1145\/288548.288607"},{"key":"6_CR27","unstructured":"N. Rudin, K. Inman, G. Stolvitzky, and I. Rigoutsos. DNA Based Identification. BIOMETRICS personal Identification in Networked Society, Kluwer, 1998."},{"key":"6_CR28","unstructured":"B. Selman, H. J. Levesque, and D. Mitchell. A New Method for Solving Hard Satisfiability Problems. National Conference on Artificial Intelligence, 1992."},{"key":"6_CR29","unstructured":"B. Selman et alLocal Search Strategies for Satisfiability Testing. Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, 1993."},{"key":"6_CR30","first-page":"998","volume":"1","author":"B. Selman","year":"1995","unstructured":"B. Selman. Stochastic search and phase transitions: AI meets physics. IJCAI, pp. 998\u20131002, vol. 1, 1995.","journal-title":"IJCAI"},{"issue":"5","key":"6_CR31","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1109\/12.769433","volume":"48","author":"J. P. Marques-Silva","year":"1999","unstructured":"J. P. Marques-Silva and K. A. Sakallah. GRASP: a search algorithm for propositional satisfiability. T. on Computers, vol. 48, (no. 5), pp. 506\u201321, 1999.","journal-title":"T. on Computers"},{"issue":"9","key":"6_CR32","doi-asserted-by":"publisher","first-page":"1167","DOI":"10.1109\/43.536723","volume":"15","author":"P. Stephan","year":"1996","unstructured":"P. Stephan, et al. Combinational test generation using satisfiability. Transactions on Computer-Aided Design of Intergrated Circuits and Systems, vol. 15, (no. 9), pp. 1167\u201376, 1996.","journal-title":"Transactions on Computer-Aided Design of Intergrated Circuits and Systems"},{"key":"6_CR33","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1093\/biomet\/74.3.445","volume":"74","author":"R. Thisted","year":"1987","unstructured":"R. Thisted and B. Efron Did Shakespeare Write a newly discovered Poem? Biometrika, 74, pp. 445\u2013455, 1987.","journal-title":"Biometrika"},{"key":"6_CR34","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/0377-2217(85)90167-5","volume":"19","author":"D. Werra de","year":"1985","unstructured":"D. de Werra. An Introduction to Timetabling. European Journal of Operations Research, vol. 19, pp. 151\u2013162, 1985.","journal-title":"European Journal of Operations Research"}],"container-title":["Lecture Notes in Computer Science","Information Hiding"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45496-9_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T02:14:53Z","timestamp":1736993693000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45496-9_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540427339","9783540454960"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/3-540-45496-9_6","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}