{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T21:45:54Z","timestamp":1649195154082},"reference-count":10,"publisher":"EDP Sciences","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO. Inform. th\u00e9or."],"published-print":{"date-parts":[[1978]]},"DOI":"10.1051\/ita\/1978120100031","type":"journal-article","created":{"date-parts":[[2017,2,6]],"date-time":"2017-02-06T10:32:17Z","timestamp":1486377137000},"page":"3-14","source":"Crossref","is-referenced-by-count":0,"title":["Deux constructions \u00e9quivalentes d'un jeu d'arrangements pour les fichiers inverses multi-indices"],"prefix":"10.1051","volume":"12","author":[{"given":"M.","family":"Trehel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2011,1,8]]},"reference":[{"key":"R1","unstructured":"1. BERGE C., Graphes et hypergraphes, Dunod, Paris, 1970.3571730213.25702"},{"key":"R2","doi-asserted-by":"crossref","unstructured":"2. BROWN T. C., A Proof of Sperner's Lemma via Hall's Theorem, Math. Proc. Camb. Phil. Soc, vol. 78, 1975, p. 387.3820120324.05006","DOI":"10.1017\/S0305004100051859"},{"key":"R3","unstructured":"3. BRUN B., Fichiers invers\u00e9s sur une caract\u00e9ristique en vue de la r\u00e9ponse \u00e0 nue f-question, Th\u00e8se d'Universit\u00e9, Besan\u00e7on, janvier 1976."},{"key":"R4","unstructured":"4. GONDRAN M., Structure combinatoire de fichiers, \u00c9lectricit\u00e9 de France, Bulletin. de la direction des \u00e9tudes et des recherches, S\u00e9rie C, Math\u00e9matiques-Informatiques, n\u00b0 2, 1971, p. 55-80."},{"key":"R5","unstructured":"5. GRATTAROLA J. C., Conception et r\u00e9alisation d'un syst\u00e8me d'interrogation de fichiers en temps r\u00e9el, Th\u00e8se de sp\u00e9cialit\u00e9, Nice, novembre 1976."},{"key":"R6","unstructured":"6. KNUTH D. E., Sorting and Searching, vol. 3 de la collection \"The Art of Computer Programming\", Addison-Wesley, Reading, U.S.A., 1973.4459480302.68010"},{"key":"R7","doi-asserted-by":"crossref","unstructured":"7. LUM V. Y., Multi Attribute Retrieval of Combined Indexes, Comm. A.C.M., vol. 13, n\u00b0 11, novembre 1970, p. 660-665.","DOI":"10.1145\/362790.362794"},{"key":"R8","doi-asserted-by":"crossref","unstructured":"8. RAY-CHAUDHURI D. K., Combinatorial Information Retrieval Systems for Files, S.I.A.M. J. Appl. Math., vol. 16, n\u00b0 5, 1968, p. 973-992.2386090205.19102","DOI":"10.1137\/0116079"},{"key":"R9","doi-asserted-by":"crossref","unstructured":"9. SHNEIDERMAN B., Reduced Combined, Indexes for Efficient Multiple Attribute Retrieval (\u00e0 para\u00eetre dans Information Systems, vol. 2, n\u00b0 4).","DOI":"10.1016\/0306-4379(77)90003-5"},{"key":"R10","doi-asserted-by":"crossref","unstructured":"10. SPERNER E., Ein Satz \u00fcber untermengen einer endlichen Menge, Math. Zeits-chrift, 27, 1928, p. 544-548.167993154492554.0090.06","DOI":"10.1007\/BF01171114"}],"container-title":["RAIRO. Informatique th\u00e9orique"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1978120100031\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T05:33:13Z","timestamp":1568784793000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1978120100031"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978]]},"references-count":10,"journal-issue":{"issue":"1"},"alternative-id":["ita1978120100031"],"URL":"https:\/\/doi.org\/10.1051\/ita\/1978120100031","relation":{},"ISSN":["0399-0540"],"issn-type":[{"value":"0399-0540","type":"print"}],"subject":[],"published":{"date-parts":[[1978]]}}}