Zobrazeno 1 - 10
of 46
pro vyhledávání: '"Gabriel Istrate"'
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol vol. 22 no. 1, Iss Combinatorics (2020)
We investigate the partitioning of partial orders into a minimal number of heapable subsets. We prove a characterization result reminiscent of the proof of Dilworth's theorem, which yields as a byproduct a flow-based algorithm for computing such a mi
Externí odkaz:
https://doaj.org/article/7fa68d46164443898e59e798365d70bd
Autor:
Gabriel Istrate, Cosmin Bonchiş
Publikováno v:
Theoretical Computer Science. 940:189-205
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4b754a6a231829e926997bbd9e3bde1e
https://doi.org/10.1016/j.tcs.2022.10.039
https://doi.org/10.1016/j.tcs.2022.10.039
Computer science and physics have been closely linked since the birth of modern computing. In recent years, an interdisciplinary area has blossomed at the junction of these fields, connecting insights from statistical physics with basic computational
Autor:
Gabriel Istrate
We investigate Kantian equilibria in finite normal form games, a class of non-Nashian, morally motivated courses of action that was recently proposed in the economics literature. We highlight a number of problems with such equilibria, including compu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ed778146ecb24ecacea45a86a6804dfc
http://arxiv.org/abs/2106.11503
http://arxiv.org/abs/2106.11503
Publikováno v:
Physica A: Statistical Mechanics and its Applications. 468:147-157
A multiagent ruin-game is studied on Erdős–Renyi type graphs. Initially the players have the same wealth. At each time step a monopolist game is played on all active links (links that connect nodes with nonzero wealth). In such a game each player
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9157b7425535265940a7bdbe6cda6c62
https://doi.org/10.1016/j.physa.2016.10.056
https://doi.org/10.1016/j.physa.2016.10.056
Autor:
Gabriel Istrate, Karthekeyan Chandrasekaran, Young-San Lin, Minshen Zhu, Elena Grigorescu, Shubhang Kulkarni
We introduce and investigate the approximability of the maximum binary tree problem (MBT) in directed and undirected graphs. The goal in MBT is to find a maximum-sized binary tree in a given graph. MBT is a natural variant of the well-studied longest
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::248cf7879857a5b2b6a554bdc811bb7c
http://arxiv.org/abs/1909.07915
http://arxiv.org/abs/1909.07915
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319924014
MCU
MCU
We study languages and formal power series associated to (variants of) the Hammersley process. We show that the ordinary Hammersley process yields a regular language and the Hammersley tree process yields deterministic context-free (but non-regular)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cc43f9f2250403d53c92a64bad94db6c
https://doi.org/10.1007/978-3-319-92402-1_4
https://doi.org/10.1007/978-3-319-92402-1_4
Autor:
Gabriel Istrate
Publikováno v:
Developments in Language Theory ISBN: 9783319986531
ACRI
ACRI
We investigate the dependence of steady-state properties of Schelling’s segregation model on the agents’ activation order. Our basic formalism is the Pollicott-Weiss version of Schelling’s segregation model. Our main result modifies this baseli
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::81a90513f96c69030409c0c7471c0cf7
https://doi.org/10.1007/978-3-319-99813-8_38
https://doi.org/10.1007/978-3-319-99813-8_38
Autor:
Gabriel Istrate
Publikováno v:
Theoretical Computer Science. 580:83-93
We study a discrete asynchronous dynamical system on hypergraphs that can be regarded as a natural extension of annihilating walks along two directions: first, the interaction topology is a hypergraph; second, the "number of particles" at a vertex of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::887a7f1a19a677bae5243142abf624d1
https://doi.org/10.1016/j.tcs.2015.02.035
https://doi.org/10.1016/j.tcs.2015.02.035
Autor:
Cosmin Bonchis, Gabriel Istrate
Publikováno v:
Lecture Notes in Computer Science
18th International Workshop on Descriptional Complexity of Formal Systems (DCFS)
18th International Workshop on Descriptional Complexity of Formal Systems (DCFS), Jul 2016, Bucharest, Romania. pp.18-28, ⟨10.1007/978-3-319-41114-9_2⟩
Descriptional Complexity of Formal Systems ISBN: 9783319411132
DCFS
18th International Workshop on Descriptional Complexity of Formal Systems (DCFS)
18th International Workshop on Descriptional Complexity of Formal Systems (DCFS), Jul 2016, Bucharest, Romania. pp.18-28, ⟨10.1007/978-3-319-41114-9_2⟩
Descriptional Complexity of Formal Systems ISBN: 9783319411132
DCFS
International audience; We outline results and open problems concerning partitioning of integer sequences and partial orders into heapable subsequences (previously defined and established by Byers et al.).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2a2a6804d3f9ecc5e088c76c8d3ab7ec
https://hal.inria.fr/hal-01633954/file/416473_1_En_2_Chapter.pdf
https://hal.inria.fr/hal-01633954/file/416473_1_En_2_Chapter.pdf