{ "labelLang" : "hun", "responseDate" : "2024-03-29 11:30", "content" : { "otype" : "BookChapter", "mtid" : 26293218, "status" : "APPROVED", "published" : true, "comment" : "A4", "unhandledTickets" : 0, "oldTimestamp" : "2018-01-03T13:55:22.000+0000", "deleted" : false, "oldId" : 16293218, "lastRefresh" : "2024-02-09T09:09:42.168+0000", "lastModified" : "2024-02-09T08:56:52.906+0000", "created" : "2017-01-11T11:32:38.000+0000", "creator" : { "otype" : "Admin", "mtid" : 10015168, "link" : "/api/admin/10015168", "label" : "Szakonyi Erzsebet (RAMKI admin 4)", "familyName" : "Szakonyi", "givenName" : "Erzsebet", "published" : true, "oldId" : 10015168, "snippet" : true }, "lastDuplumOK" : "2024-02-09T08:36:31.636+0000", "lastDuplumSearch" : "2024-02-09T08:36:31.636+0000", "core" : false, "citation" : true, "publicationPending" : false, "type" : { "otype" : "PublicationType", "mtid" : 31, "link" : "/api/publicationtype/31", "label" : "Egyéb konferenciaközlemény", "code" : 31, "otypeName" : "BookChapter", "listPosition" : 4, "published" : true, "oldId" : 31, "snippet" : true }, "subType" : { "otype" : "SubType", "mtid" : 10000197, "link" : "/api/subtype/10000197", "label" : "Konferenciaközlemény (Egyéb konferenciaközlemény)", "name" : "Konferenciaközlemény", "nameEng" : "Conference paper", "docType" : { "otype" : "PublicationType", "mtid" : 31, "link" : "/api/publicationtype/31", "label" : "Egyéb konferenciaközlemény", "code" : 31, "otypeName" : "BookChapter", "listPosition" : 4, "published" : true, "oldId" : 31, "snippet" : true }, "listPosition" : 452, "published" : true, "oldId" : 10000197, "snippet" : true }, "category" : { "otype" : "Category", "mtid" : 1, "link" : "/api/category/1", "label" : "Tudományos", "published" : true, "oldId" : 1, "snippet" : true }, "languages" : [ { "otype" : "Language", "mtid" : 10002, "link" : "/api/language/10002", "label" : "Angol", "name" : "Angol", "nameEng" : "English", "published" : true, "oldId" : 2, "snippet" : true } ], "firstAuthor" : "Lace, A", "authorships" : [ { "otype" : "PersonAuthorship", "mtid" : 62298471, "link" : "/api/authorship/62298471", "label" : "Lace, A", "listPosition" : 1, "share" : 0.0, "first" : true, "last" : false, "familyName" : "Lace", "givenName" : "A", "authorTyped" : true, "editorTyped" : false, "otherTyped" : false, "type" : { "otype" : "AuthorshipType", "mtid" : 1, "link" : "/api/authorshiptype/1", "label" : "Szerző", "code" : 0, "published" : true, "oldId" : 0, "snippet" : true }, "published" : false, "oldId" : 127506359, "snippet" : true }, { "otype" : "PersonAuthorship", "mtid" : 62298472, "link" : "/api/authorship/62298472", "label" : "Rudzitis, M", "listPosition" : 2, "share" : 0.0, "first" : false, "last" : false, "familyName" : "Rudzitis", "givenName" : "M", "authorTyped" : true, "editorTyped" : false, "otherTyped" : false, "type" : { "otype" : "AuthorshipType", "mtid" : 1, "link" : "/api/authorshiptype/1", "label" : "Szerző", "code" : 0, "published" : true, "oldId" : 0, "snippet" : true }, "published" : false, "oldId" : 127506358, "snippet" : true }, { "otype" : "PersonAuthorship", "mtid" : 62298473, "link" : "/api/authorship/62298473", "label" : "Gopaks, E", "listPosition" : 3, "share" : 0.0, "first" : false, "last" : false, "familyName" : "Gopaks", "givenName" : "E", "authorTyped" : true, "editorTyped" : false, "otherTyped" : false, "type" : { "otype" : "AuthorshipType", "mtid" : 1, "link" : "/api/authorshiptype/1", "label" : "Szerző", "code" : 0, "published" : true, "oldId" : 0, "snippet" : true }, "published" : false, "oldId" : 127506357, "snippet" : true }, { "otype" : "PersonAuthorship", "mtid" : 62298474, "link" : "/api/authorship/62298474", "label" : "Freivalds, R", "listPosition" : 4, "share" : 0.0, "first" : false, "last" : true, "familyName" : "Freivalds", "givenName" : "R", "authorTyped" : true, "editorTyped" : false, "otherTyped" : false, "type" : { "otype" : "AuthorshipType", "mtid" : 1, "link" : "/api/authorshiptype/1", "label" : "Szerző", "code" : 0, "published" : true, "oldId" : 0, "snippet" : true }, "published" : false, "oldId" : 127506356, "snippet" : true } ], "title" : "Superimposed codes and query algorithms", "identifiers" : [ { "otype" : "PublicationIdentifier", "mtid" : 11934680, "link" : "/api/publicationidentifier/11934680", "label" : "Scopus: 84961330603", "source" : { "otype" : "PlainSource", "mtid" : 3, "link" : "/api/publicationsource/3", "label" : "Scopus", "type" : { "otype" : "PublicationSourceType", "mtid" : 10003, "link" : "/api/publicationsourcetype/10003", "label" : "Indexelő adatbázis", "mayHaveOa" : false, "published" : true, "snippet" : true }, "name" : "Scopus", "linkPattern" : "http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-@@@", "publiclyVisible" : true, "published" : true, "oldId" : 3, "snippet" : true }, "validState" : "IDENTICAL", "idValue" : "84961330603", "realUrl" : "http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84961330603", "published" : false, "oldId" : 13966318, "snippet" : true } ], "firstPage" : "140", "lastPage" : "147", "firstPageOrInternalIdForSort" : "140", "pageLength" : 8, "publishedYear" : 2015, "digital" : null, "printed" : null, "sourceYear" : 2017, "packet" : "(Szakonyi Erzsebet (MATK admin); 2017.01.11. 12:20:19)", "foreignEdition" : null, "foreignLanguage" : true, "fullPublication" : true, "conferencePublication" : true, "nationalOrigin" : null, "missingAuthor" : false, "oaType" : "NONE", "oaCheckDate" : "2024-02-09", "oaFree" : false, "citationCount" : 0, "citationCountUnpublished" : 0, "citationCountWoOther" : 0, "independentCitCountWoOther" : 0, "doiCitationCount" : 0, "wosCitationCount" : 0, "scopusCitationCount" : 0, "independentCitationCount" : 0, "unhandledCitationCount" : 0, "citingPubCount" : 0, "independentCitingPubCount" : 0, "unhandledCitingPubCount" : 0, "citedPubCount" : 2, "citedCount" : 2, "referenceList" : "Adamsons, V., Jeriņš, K., Krišlauks, R., Lapiņa, M., Pakulis, A., Freivalds, R., Advantages of ultrametric counter automata (2015) Proceedings of SOFSEM 2015, 2; \n\nBach, E., Shallit, J., (1996) Algorithmic Number Theory, , MIT Press; \n\nBuhrman, H., De Wolf, R., Complexity measures and decision tree complexity: A survey (2002) Theoretical Computer Science, 288 (1), pp. 21-43; \n\nDembowski, P., (1968) Finite Geometries, , Springer; \n\nD'yachkov, A.G., Rykov, V.V., Bounds on the length of disjunct codes (1982) Problemy Peredachi Informatsii, 17, pp. 7-13. , (in Russian); \n\nD'yachkov, A.G., Macula, A.J., Rykov, V.V., New constructions of superimposed codes (2000) IEEE Transactions on Information Theory, 46, pp. 284-290; \n\nD'yachkov, A.G., Macula, A.J., Rykov, V.V., New applications and results of superimposed code theory arising from the potentialities of molecular biology (2000) Numbers, Information and Complexity, pp. 265-282. , Kluwer Academic Publishers, Dordrecht; \n\nErdös, P., Frankl, P., Füredi, Z., Families of finite sets in which no set is covered by the union of r others (1985) Israel Journal of Mathematics, 51 (1-2), pp. 79-89; \n\nFreivalds, R., Probabilistic two-way machines (1981) Lecture Notes in Computer Science, 118, pp. 33-45; \n\nFreivalds, R., On the growth of the number of states in result of the determinization of probabilistic finite automata (1982) Avtomatika i Vichislitel'naya Tekhnika, (3), pp. 39-42. , (Russian); \n\nFreivalds, R., Ultrametric finite automata and turing machines (2013) Lecture Notes in Computer Science, 7907, pp. 1-11; \n\nFüredi, Z., A note of r-cover-free families (1996) Journal of Combinatorial Theory, Ser. A, 73, pp. 172-173; \n\nKautz, W.H., Singleton, R.C., Nonrandom binary superimposed codes (1964) IEEE Transactions on Information Theory, 10, pp. 363-377; \n\nKunc, M., Okhotin, A., State complexity of union and intersection for two-way nondeterministic finite automata (2011) Fundamenta Informaticae, 110 (1-4), pp. 231-239; \n\nQuang, A.N., Zeisel, T., Bounds on constant weight binary superimposed codes (1988) Problems of Control and Information Theory, 17, pp. 223-230; \n\nNisan, N., CREW PRAMs and decision trees (1991) SIAM Journal of Computing, 20 (6), pp. 999-1007; \n\nRuszinko, M., On the upper bound of the size of r-cover-free families (1994) Journal of Combinatorial Theory, 66, pp. 302-310. , Ser. A; \n\nSaks, M.E., Wigderson, A., Probabilistic Boolean decision trees and the complexity of evaluating game trees (1986) Proceedings of the 27th Annual Symposium on Foundations of Computer Science, pp. 29-38; \n\nSantha, M., On the Monte Carlo Boolean decision tree complexity of read-once formulae (1995) Random Structures and Algorithms, 6 (1), pp. 75-87; \n\nStinson, D.R., Wei, R., Zhu, L., Some new bounds for cover-free families (2000) Journal of Combinatorial Theory, 90, pp. 224-234. , Ser. A", "hasCitationDuplums" : false, "userChangeableUntil" : "2017-02-15T17:52:04.000+0000", "publishDate" : "2017-01-11T11:33:08.000+0000", "directInstitutesForSort" : "", "ownerAuthorCount" : 4, "ownerInstituteCount" : 15, "directInstituteCount" : 0, "authorCount" : 4, "contributorCount" : 0, "book" : { "otype" : "Book", "mtid" : 30246397, "link" : "/api/publication/30246397", "label" : "41st International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2015. (2015)", "core" : false, "citation" : false, "publicationPending" : false, "type" : { "otype" : "PublicationType", "mtid" : 32, "link" : "/api/publicationtype/32", "label" : "Egyéb konferenciakötet", "code" : 32, "otypeName" : "Book", "listPosition" : 6, "published" : true, "oldId" : 32, "snippet" : true }, "category" : { "otype" : "Category", "mtid" : 1, "link" : "/api/category/1", "label" : "Tudományos", "published" : true, "oldId" : 1, "snippet" : true }, "languages" : [ { "otype" : "Language", "mtid" : 10002, "link" : "/api/language/10002", "label" : "Angol", "name" : "Angol", "nameEng" : "English", "published" : true, "oldId" : 2, "snippet" : true } ], "title" : "41st International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2015", "identifiers" : [ ], "publishedAt" : [ ], "publishedYear" : 2015, "foreignLanguage" : true, "fullPublication" : false, "conferencePublication" : true, "published" : true, "snippet" : true }, "hasQualityFactor" : false, "link" : "/api/publication/26293218", "label" : "Lace A et al. Superimposed codes and query algorithms. (2015) Megjelent: 41st International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2015 pp. 140-147", "template" : "