DOI,IST REx ID,Research Group,Title of publication
null,15082,"KrCh,UlWa",Disjoint tree-compatible plane perfect matchings
10.6084/m9.figshare.5973013.v1,9814,KrCh,Data and mathematica notebooks for plotting figures from language learning with communication between learners from language acquisition with communication between learners
10.1007/978-3-030-30281-8_7,6942,"KrCh,ChLa",Strategy representation by decision trees with linear classifiers
10.1145/3339984,7014,KrCh,Non-polynomial worst-case analysis of recursive programs
10.1145/3363525,7158,KrCh,Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth
10.1007/978-3-030-31784-3_27,7183,KrCh,Deciding fast termination for probabilistic VASS with nondeterminism
10.1038/s42003-019-0373-y,7210,KrCh,Population structure determines the tradeoff between fixation probability and fixation time
10.1109/lics.2019.8785706,7402,KrCh,Graph planning with expected finite horizon
null,7950,"HeEd,UlWa,KrCh",Token swapping on trees
10.1007/978-3-030-11245-5_22,5948,KrCh,Termination of nondeterministic probabilistic programs
10.1109/BLOC.2019.8751326,6056,KrCh,Probabilistic smart contracts: Secure randomness on the blockchain
10.1145/3314221.3314581,6175,KrCh,Cost analysis of nondeterministic probabilistic programs
10.1145/3297280.3297319,6378,KrCh,"Hybrid Mining: Exploiting blockchain’s computational power for distributed problem solving"
10.1145/3290366,6380,KrCh,Efficient parameterized algorithms for data packing
10.1007/978-3-030-25540-4_36,6462,"ToHe,KrCh",Run-time optimization for learned controllers through quantitative games
10.1145/3297280.3297322,6490,KrCh,The treewidth of smart contracts
10.1145/3360555,6780,KrCh,Modular verification for almost-sure termination of probabilistic programs
10.1038/s41586-019-1488-5,6836,KrCh,Social dilemmas among unequals
10.4230/LIPICS.MFCS.2019.11,6884,"ToHe,KrCh",Bidding mechanisms in graph games
10.4230/LIPICS.CONCUR.2019.27,6885,"ToHe,KrCh",Long-run average behavior of vector addition systems with states