( en | de | ru )

 

Disambiguation of "Bonchis, Cosmin"

Author of the publication

copydeleteadd this publication to your clipboard
Computing a minimal partition of partial orders into heapable subsets.

, , , and . CoRR, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Cosmin Pocanschi

Cosmin Arad

Cosmin Lupulescu

Cosmin Contiu

Cosmin Dumitrescu

 

Other publications of authors with the same name

Information Theory over Multisets., , and . Comput. Informatics, 27 (3+): 441-451 (2008)A parametric worst-case approach to fairness in cooperative games with transferable utility., and . Theor. Comput. Sci., 940 (Part): 189-205 (2023)Being Central on the Cheap: Stability in Heterogeneous Multiagent Centrality Games., and . AAMAS, page 651-659. International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS), (2022)The Language (and Series) of Hammersley-Type Processes., , and . MCU, volume 10881 of Lecture Notes in Computer Science, page 69-87. Springer, (2018)Computing a minimal partition of partial orders into heapable subsets., , , and . CoRR, (2017)Dilated filters for edge detection algorithms., , and . CoRR, (2021)Number Encodings and Arithmetics over Multisets., , and . SYNASC, page 354-364. IEEE Computer Society, (2006)Kernelization, Proof Complexity and Social Choice., , and . ICALP, volume 198 of LIPIcs, page 135:1-135:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Being Central on the Cheap: Stability in Heterogeneous Multiagent Centrality Games., and . CoRR, (2020)A Web-Based P Systems Simulator and Its Parallelization., , , and . UC, volume 3699 of Lecture Notes in Computer Science, page 58-69. Springer, (2005)