Ruszinkó M. On a 2- and 3-dimensional search problem. (1993) Megjelent: Proceedings of the sixth joint Swedish-Russian workshop on information theory. Mölle, 1993 pp. 437-440,
159762
Egyéb konferenciaközlemény/Konferenciaközlemény (Egyéb konferenciaközlemény)/Tudományos[159762]
Kolev E. Nonadaptive search problem with sets of equal sum. (2003) CENTRAL EUROPEAN JOURNAL OF MATHEMATICS 1895-1074 1644-3616 1 3 272-283
Ruszinkó M. On the upper bound of the size of the r-cover-free families. (1994) JOURNAL OF COMBINATORIAL THEORY SERIES A 0097-3165 1096-0899 66 2 302-310,
160225
Gargano L. et al. Low-weight superimposed codes and related combinatorial structures: Bounds and applications. (2020) THEORETICAL COMPUTER SCIENCE 0304-3975 806 655-672
Alon Noga et al. A probabilistic variant of Sperner 's theorem and of maximal r-cover free families. (2020) DISCRETE MATHEMATICS 0012-365X 1872-681X 343 10
De Bonis A. et al. A new kind of selectors and their applications to conflict resolution in wireless multichannels networks. (2019) THEORETICAL COMPUTER SCIENCE 0304-3975 & p. &
Vorobyev Ilya. A New Algorithm for Two-Stage Group Testing. (2019) Megjelent: 2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) pp. 101-105
Sharma A. et al. On Finding a Subset of Non-Defective Items from a Large Population. (2018) IEEE TRANSACTIONS ON SIGNAL PROCESSING 1053-587X 66 21 5762-5775
Gargano L. et al. Low-weight superimposed codes and their applications. (2018) Megjelent: 12th International Frontiers of Algorithmics Workshop, FAW 2018 pp. 197-211
Kiss S Z et al. Bloom Filter with a False Positive Free Zone. (2018) Megjelent: IEEE INFOCOM 2018 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) pp. 1412-1420
Sharma A et al. Computationally tractable algorithms for finding a subset of non-defective items from a large population. (2017) IEEE TRANSACTIONS ON INFORMATION THEORY 0018-9448 63 11 7149-7165
de Bonis A et al. A new kind of selectors and their applications to conflict resolution in wireless multichannels networks. (2017) LECTURE NOTES IN COMPUTER SCIENCE 0302-9743 1611-3349 10050 45-61
de Bonis et al. A new kind of selectors and their applications to conflict resolution in wireless multichannels networks. (2017) Megjelent: 12th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2016 pp. 45-61
De Bonis A et al. ϵ-almost selectors and their applications to multiple-access communication. (2017) IEEE TRANSACTIONS ON INFORMATION THEORY 0018-9448 63 11 7304-7319
Ubaru Shashanka et al. Group testing schemes from low-weight codewords of BCH codes. (2016) Megjelent: IEEE International Symposium on Information Theory pp. 2863-2867
De Bonis Annalisa. Constraining the number of positive responses in adaptive, non-adaptive, and two-stage group testing. (2016) JOURNAL OF COMBINATORIAL OPTIMIZATION 1382-6905 1573-2886 32 Atlanta 1254-1287
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
Egyéb konferenciaközlemény/Konferenciaközlemény (Egyéb konferenciaközlemény)/Tudományos[26293218] [Admin láttamozott]
Briët J et al. Round elimination in exact communication complexity. (2015) Megjelent: 10th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2015 pp. 206-225
De Bonis A. Efficient Group Testing Algorithms with a Constrained Number of Positive Responses. (2014) LECTURE NOTES IN ARTIFICIAL INTELLIGENCE 0302-9743 8881 506-521
van den Berg Ewout et al. Single-photon sampling architecture for solid-state imaging sensors. (2013) PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA 0027-8424 1091-6490 110 30 E2752-E2761
Miller A. On the complexity of fixed-schedule neighbourhood learning in wireless ad hoc radio networks. (2013) LECTURE NOTES IN COMPUTER SCIENCE 0302-9743 1611-3349 8243 LNCS 244-259
Miller A. On the complexity of fixed-schedule neighbourhood learning in wireless ad hoc radio networks. (2013) LECTURE NOTES IN ARTIFICIAL INTELLIGENCE 0302-9743 8243 LNCS 244-259
Asuncion AU et al. Nonadaptive mastermind algorithms for string and vector databases, with case studies. (2013) IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING 1041-4347 25 1 131-144
Hajiabolhassan H et al. Some new bounds for cover-free families through biclique covers. (2012) DISCRETE MATHEMATICS 0012-365X 1872-681X 312 24 3626-3635
Damaschke P. Optimal randomized group testing: A canonical form and the one-defective case Optimal randomized group testing: A canonical form and the one-defective case. (2011) Megjelent: Nincs cím pp. 55-67
Egyéb konferenciaközlemény[22849276] [Admin láttamozott]
Feng Y. Bandwidth efficient anti-collusion digital fingerprinting scheme. (2011) INTERNATIONAL REVIEW ON COMPUTERS AND SOFTWARE 1828-6003 1828-6011 6 3 393-399
Chen HB et al. An Almost Optimal Algorithm for Generalized Threshold Group Testing with Inhibitors. (2011) JOURNAL OF COMPUTATIONAL BIOLOGY 1066-5277 1557-8666 18 6 851-864
Asuncion AU. Turning privacy leaks into floods: Surreptitious discovery of social network friendships and other sensitive binary attribute vectors Turning privacy leaks into floods: Surreptitious discovery of social network friendships and other sensitive binary attribute vectors. (2010) Megjelent: 9th Annual ACM Workshop on Privacy in the Electronic Society, WPES '10, Co-located with CCS'10 pp. 21-30
Egyéb konferenciaközlemény[22832297] [Admin láttamozott]
Asuncion AU. Turning privacy leaks into floods: surreptitious discovery of social network friendships and other sensitive binary attribute vectors Turning privacy leaks into floods: surreptitious discovery of social network friendships and other sensitive binary attribute vectors. (2010) Megjelent: Proceedings of the 9th annual ACM workshop on Privacy in the electronic society pp. 21-30
Damaschke P et al. Competitive group testing and learning hidden vertex covers with minimum adaptivity. (2010) DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS 1793-8309 1793-8317 2 3 291-311
Wang J. Secure and efficient VSS scheme based on partial broadcast channels. (2009) JOURNAL OF COMPUTATIONAL INFORMATION SYSTEMS 1553-9105 5 3 1149-1155
Moran T et al. Deterministic history-independent strategies for storing information on write-once memories. (2009) THEORY OF COMPUTING 1557-2862 5 43-67
Cheraghchi M et al. Compressed sensing with probabilistic measurements: A group testing solution Compressed sensing with probabilistic measurements: A group testing solution. (2009) Megjelent: 2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009 pp. 30-35
Egyéb konferenciaközlemény[22832306] [Admin láttamozott]
Cheraghchi M et al. Compressed sensing with probabilistic measurements: A group testing solution Compressed sensing with probabilistic measurements: A group testing solution. (2009) Megjelent: Communication, Control, and Computing, 2009. Allerton 2009. 47th Annual Allerton Conference on pp. 30-35
Damaschke P. Competitive group testing and learning hidden vertex covers with minimum adaptivity Competitive group testing and learning hidden vertex covers with minimum adaptivity. (2009) Megjelent: Nincs cím pp. 84-95
Egyéb konferenciaközlemény[22849292] [Admin láttamozott]
Colbourn Charles J et al. Locating and detecting arrays for interaction faults. (2008) JOURNAL OF COMBINATORIAL OPTIMIZATION 1382-6905 1573-2886 15 1 17-48
Goodrich MT et al. Improved adaptive group testing algorithms with applications to multiple access channels and dead sensor diagnosis. (2008) JOURNAL OF COMBINATORIAL OPTIMIZATION 1382-6905 1573-2886 15 1 95-121
Syrotiuk VR et al. Transport schemes for topology-transparent scheduling. (2007) JOURNAL OF COMBINATORIAL OPTIMIZATION 1382-6905 1573-2886 14 2-3 229-248
Chen Y et al. Topology-transparent duty cycling for wireless sensor networks Topology-transparent duty cycling for wireless sensor networks. (2007) Megjelent: 21st International Parallel and Distributed Processing Symposium, IPDPS 2007
Egyéb konferenciaközlemény[22832315] [Admin láttamozott]
Chen Y et al. Topology-transparent duty cycling for wireless sensor networks Topology-transparent duty cycling for wireless sensor networks. (2007) Megjelent: Parallel and Distributed Processing Symposium, 2007. IPDPS 2007. IEEE International pp. 1-10
D’Yachkov A. Nonadaptive and trivial two-stage group testing with error-correcting d e-disjunct inclusion matrices. (2007) Entropy, Search, Complexity 71-83
Baird L. Jam-resistant communication without shared secrets through the use of concurrent codes. (2007) United States Air Force Academy, Tech. Rep. USAFA-TR-2007-01
Niederreiter H. Function fields over finite fields and their applications to cryptography. (2007) Topics in Geometry, Coding Theory and Cryptography 59-104
Niederreiter H. Function fields over finite fields and their applications to cryptography. (2007) Megjelent: Topics in Geometry, Coding Theory and Cryptography pp. 59-104
Cheng YX et al. Efficient constructions of disjunct matrices with applications to DNA library screening. (2007) JOURNAL OF COMPUTATIONAL BIOLOGY 1066-5277 1557-8666 14 9 1208-1216
De Bonis A et al. Optimal algorithms for two group testing problems, and new bounds on generalized superimposed codes. (2006) IEEE TRANSACTIONS ON INFORMATION THEORY 0018-9448 52 10 4673-4680
Boztaş S. On transmission scheduling in wireless networks. (2006) Megjelent: 2006 IEEE International Symposium on Information Theory, ISIT 2006 pp. 2754-2758
Eppstein D et al. Improved combinatorial group testing algorithms for real-world problem sizes. (2006) SIAM JOURNAL ON COMPUTING 0097-5397 1095-7111 36 5 1360-1375
Goodrich MT et al. Efficient parallel algorithms for dead sensor diagnosis and multiple access channels Efficient parallel algorithms for dead sensor diagnosis and multiple access channels. (2006) Megjelent: Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures pp. 118-127
Tonien D. An efficient single-key pirates tracing scheme using cover-free families An efficient single-key pirates tracing scheme using cover-free families. (2006) Megjelent: Nincs cím pp. 82-97
Egyéb konferenciaközlemény[22849322] [Admin láttamozott]
Tonien D et al. An efficient single-key pirates tracing scheme using cover-free families. (2006) LECTURE NOTES IN COMPUTER SCIENCE 0302-9743 1611-3349 3989 82-97
Gyori S. Signature coding for OR channel with asynchronous access Signature coding for OR channel with asynchronous access. (2005) Megjelent: Information Theory, 2005. ISIT 2005. Proceedings. International Symposium on pp. 2040-2044
Gyóri S. Signature coding for or channel with asynchronous access Signature coding for or channel with asynchronous access. (2005) Megjelent: 2005 IEEE International Symposium on Information Theory, ISIT 05 pp. 2040-2044
Egyéb konferenciaközlemény[22832328] [Admin láttamozott]
