{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T05:17:11Z","timestamp":1738387031921,"version":"3.35.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540688655"},{"type":"electronic","value":"9783540688808"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-68880-8_26","type":"book-chapter","created":{"date-parts":[[2008,7,31]],"date-time":"2008-07-31T06:37:59Z","timestamp":1217486279000},"page":"271-279","source":"Crossref","is-referenced-by-count":2,"title":["The Secret Santa Problem"],"prefix":"10.1007","author":[{"given":"Leo","family":"Liberti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Franco","family":"Raimondi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"503","key":"26_CR1","doi-asserted-by":"publisher","first-page":"307","DOI":"10.2307\/3622033","volume":"85","author":"A.V. Boyd","year":"2001","unstructured":"Boyd, A.V., Ridley, J.N.: The return of Secret Santa. Mathematical Gazette\u00a085(503), 307\u2013311 (2001)","journal-title":"Mathematical Gazette"},{"issue":"1","key":"26_CR2","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF00206326","volume":"1","author":"D. Chaum","year":"1988","unstructured":"Chaum, D.: The dining cryptographers problem: unconditional sender and recipient untraceability. Journal of Cryptology\u00a01(1), 65\u201375 (1988)","journal-title":"Journal of Cryptology"},{"key":"26_CR3","unstructured":"Duncan, B.: Secret Santa reveals the secret side of giving. Technical Report 0601, University of Colorado at Denver (2006)"},{"key":"26_CR4","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/5803.001.0001","volume-title":"Reasoning about Knowledge","author":"R. Fagin","year":"1995","unstructured":"Fagin, R., Halpern, J.Y., Moses, Y., Vardi, M.Y.: Reasoning about Knowledge. MIT Press, Cambridge (1995)"},{"key":"26_CR5","volume-title":"The AMPL Book","author":"R. Fourer","year":"2002","unstructured":"Fourer, R., Gay, D.: The AMPL Book. Duxbury Press, Pacific Grove (2002)"},{"key":"26_CR6","unstructured":"ILOG. ILOG CPLEX 10.1 User\u2019s Manual. ILOG S.A., Gentilly, France (2006)"},{"issue":"498","key":"26_CR7","doi-asserted-by":"publisher","first-page":"467","DOI":"10.2307\/3620958","volume":"83","author":"K.M. McGuire","year":"1999","unstructured":"McGuire, K.M., Mackiw, G., Morrell, C.H.: The Secret Santa problem. Mathematical Gazette\u00a083(498), 467\u2013472 (1999)","journal-title":"Mathematical Gazette"},{"issue":"7","key":"26_CR8","doi-asserted-by":"publisher","first-page":"617","DOI":"10.2307\/2324927","volume":"98","author":"S. Penrice","year":"1991","unstructured":"Penrice, S.: Derangements, permanents and christmas presents. American Mathematical Monthly\u00a098(7), 617\u2013620 (1991)","journal-title":"American Mathematical Monthly"},{"issue":"502","key":"26_CR9","doi-asserted-by":"publisher","first-page":"96","DOI":"10.2307\/3620482","volume":"85","author":"R. Pinkham","year":"2001","unstructured":"Pinkham, R.: The Secret Santa problem revisited. Mathematical Gazette\u00a085(502), 96\u201397 (2001)","journal-title":"Mathematical Gazette"},{"key":"26_CR10","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency","author":"A. Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer, Berlin (2003)"},{"key":"26_CR11","volume-title":"Cryptografie, Beveiliging van de digitale maatschappij","author":"G. Tel","year":"2002","unstructured":"Tel, G.: Cryptografie, Beveiliging van de digitale maatschappij. Addison-Wesley, Reading (2002)"},{"key":"26_CR12","unstructured":"Verelst, J.: Secure computing and distributed solutions to the Secret Santa problem. Master\u2019s thesis, Computer Science Dept., University of Utrecht (2003)"},{"key":"26_CR13","unstructured":"White, M.: The Secret Santa problem. Rose-Hulman Institute of Technology Undergraduate Math Journal\u00a07(1) (paper 5) (2006)"},{"key":"26_CR14","unstructured":"Secret Santa. Wikipedia (2006), http:\/\/en.wikipedia.org\/wiki\/Secret_Santa"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-68880-8_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T07:22:42Z","timestamp":1738308162000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68880-8_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540688655","9783540688808"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68880-8_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}