Dániel Lenger

Publication Activity (10 Years)

Years Active: 2017-2023
Publications (10 Years): 8

Top Topics

Query Formulation

Efficient Processing

Top Venues

Discret. Appl. Math.

Discret. Optim.

Publications

Ádám Fraknói, Dávid Á. Márton, Dániel G. Simon, Dániel Lenger
On the Rényi-Ulam game with restricted size queries. Discret. Optim. 48 (Part 1) (2023)
Dániel Gerbner, Dániel Lenger, Máté Vizer
A plurality problem with three colors and query size three. Discret. Math. 346 (1) (2023)
Dániel Gerbner, Balázs Keszegh, Dániel Lenger, Dániel T. Nagy, Dömötör Pálvölgyi, Balázs Patkós, Máté Vizer, Gábor Wiener
copies of a subgraph, and a related problem in search theory. Discret. Appl. Math. 341 (2023)
Endre Csóka, Zoltán L. Blázsik, Zoltán Király, Dániel Lenger
Upper bounds for the necklace folding problems. J. Comb. Theory, Ser. B 157 (2022)
Gábor Damásdi, Dániel Gerbner, Gyula O. H. Katona, Balázs Keszegh, Dániel Lenger, Abhishek Methuku, Dániel T. Nagy, Dömötör Pálvölgyi, Balázs Patkós, Máté Vizer, Gábor Wiener
Adaptive majority problems for restricted query graphs and for weighted sets. Discret. Appl. Math. 288 (2021)
Istvan Elek, Zoltán Blázsik, Tamás Héger, Dániel Lenger, Dániel Sindely
Communicating Digital Evolutionary Machines. SAI (2) (2021)
Gábor Damásdi, Dániel Gerbner, Gyula O. H. Katona, Balázs Keszegh, Dániel Lenger, Abhishek Methuku, Dániel T. Nagy, Dömötör Pálvölgyi, Balázs Patkós, Máté Vizer, Gábor Wiener
Adaptive Majority Problems for Restricted Query Graphs and for Weighted Sets. CoRR (2019)
Dániel Gerbner, Dániel Lenger, Máté Vizer
A plurality problem with three colors and query size three. CoRR (2017)