-
1
المؤلفون: Alkida Balliu, Janne H. Korhonen, Fabian Kuhn, Henrik Lievonen, Dennis Olivetti, Shreyas Pai, Ami Paz, Joel Rybicki, Stefan Schmid, Jan Studený, Jukka Suomela, Jara Uitto
المصدر: Symposium on Simplicity in Algorithms (SOSA) ISBN: 9781611977585
URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_________::65bfb6ccd3587862c5ecf9d27ee25860
https://doi.org/10.1137/1.9781611977585.ch17 -
2
المؤلفون: Chetan Gupta, Rustam Latypov, Yannic Maus, Shreyas Pai, Simo Särkkä, Jan Studený, Jukka Suomela, Jara Uitto, Hossein Vahidi
مصطلحات موضوعية: FOS: Computer and information sciences, Computer Science - Distributed, Parallel, and Cluster Computing, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), Distributed, Parallel, and Cluster Computing (cs.DC)
URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::edfef69a6946ffb00c7eaa96b87e9231
-
3
المؤلفون: Yi-Jun Chang, Jan Studený, Jukka Suomela
المساهمون: National University of Singapore, Department of Computer Science, Computer Science Professors, Aalto-yliopisto, Aalto University, Jurdziński, Tomasz, Schmid, Stefan, Eidgenössische Technische Hochschule Zürich
المصدر: Theoretical Computer Science. 951:113710
مصطلحات موضوعية: FOS: Computer and information sciences, General Computer Science, Formal Languages and Automata Theory (cs.FL), Algorithm synthesis, LOCAL model, Computer Science - Formal Languages and Automata Theory, Computational Complexity (cs.CC), Theoretical Computer Science, Computational complexity, Computer Science - Computational Complexity, Computer Science - Distributed, Parallel, and Cluster Computing, Distributed algorithms, LCL problems, Distributed, Parallel, and Cluster Computing (cs.DC), Automata theory
وصف الملف: application/pdf
-
4
المؤلفون: Jan Studený, Jukka Suomela, Yi-Jun Chang
المصدر: Structural Information and Communication Complexity ISBN: 9783030795269
SIROCCOمصطلحات موضوعية: Discrete mathematics, Unary operation, Locality, Graph (abstract data type), Nondeterministic finite automaton, Function (mathematics), Complement (complexity), Undecidable problem, PSPACE, Mathematics
URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_________::63d4de9b055e3364fbdd21643bf1e192
https://doi.org/10.1007/978-3-030-79527-6_3