-
1
المساهمون: Technische Universität Dortmund [Dortmund] (TU), Aalto University, DFINITY Foundation [Zurich], University of Vienna [Vienna], Équipe Tolérance aux fautes et Sûreté de Fonctionnement informatique (LAAS-TSF), Laboratoire d'analyse et d'architecture des systèmes (LAAS), Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT)-Université de Toulouse (UT)-Institut National des Sciences Appliquées - Toulouse (INSA Toulouse), Institut National des Sciences Appliquées (INSA)-Université de Toulouse (UT)-Institut National des Sciences Appliquées (INSA)-Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université de Toulouse (UT)-Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT), subvention 16KISK020KFonds pour la science et la technologie de Vienne (WWTF), projet ICT19-045 (WHATIF), 2020-2024.
المصدر: 2022 52nd Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN)
52nd Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN)
52nd Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN), Jun 2022, Baltimore, United States. pp.215-226, ⟨10.1109/dsn53405.2022.00032⟩مصطلحات موضوعية: Networking and Internet Architecture (cs.NI), FOS: Computer and information sciences, Computer Science - Networking and Internet Architecture, Computer Science - Distributed, Parallel, and Cluster Computing, [INFO]Computer Science [cs], Distributed, Parallel, and Cluster Computing (cs.DC)
URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::04fc188563a51ba8d4fd38471c61f15b
http://arxiv.org/abs/2204.03413 -
2
المؤلفون: Ami Paz, Mor Perry, Laurent Feuilloley, Juho Hirvonen, Pierre Fraigniaud
المساهمون: Institut de Recherche en Informatique Fondamentale (IRIF (UMR_8243)), Université Paris Diderot - Paris 7 (UPD7)-Centre National de la Recherche Scientifique (CNRS), Networks, Graphs and Algorithms (GANG), Université Paris Diderot - Paris 7 (UPD7)-Centre National de la Recherche Scientifique (CNRS)-Université Paris Diderot - Paris 7 (UPD7)-Centre National de la Recherche Scientifique (CNRS)-Inria de Paris, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Tel Aviv University (TAU), Universidad de Chile, Institut de Recherche en Informatique Fondamentale, Department of Computer Science, University of Vienna, Weizmann Institute of Science, Aalto-yliopisto, Aalto University, Tel Aviv University [Tel Aviv], Schmid, Ulrich, Hirvonen, Juho, Professorship Suomela J., Tel Aviv University
المصدر: 32nd International Symposium on Distributed Computing
32nd International Symposium on Distributed Computing, 2018, New Orleans, United States. ⟨10.4230/LIPIcs.DISC.2018.24⟩
Distributed Computingمصطلحات موضوعية: FOS: Computer and information sciences, Theoretical computer science, Correctness, Proof-labeling schemes, Computer Networks and Communications, Computer science, 0102 computer and information sciences, 02 engineering and technology, Gas meter prover, Mathematical proof, 01 natural sciences, Article, Theoretical Computer Science, 0202 electrical engineering, electronic engineering, information engineering, Redundancy (engineering), Nondeterminism, non-determinism, ta113, 000 Computer science, knowledge, general works, Spanning tree, Node (networking), Distributed verification, 020206 networking & telecommunications, Certificate, Space-time tradeoffs, Computer Science - Distributed, Parallel, and Cluster Computing, Computational Theory and Mathematics, 010201 computation theory & mathematics, Hardware and Architecture, Distributed algorithm, Distributed graph algorithms, Computer Science, Distributed, Parallel, and Cluster Computing (cs.DC), [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC]
وصف الملف: application/pdf
-
3
المؤلفون: Alkida Balliu, Juho Hirvonen, Darya Melnyk, Dennis Olivetti, Joel Rybicki, Jukka Suomela
المصدر: Structural Information and Communication Complexity ISBN: 9783031099922
URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_________::0d087d722193a26755a47994d89f2e13
https://doi.org/10.1007/978-3-031-09993-9_1 -
4
المؤلفون: Yannic Maus, Juho Hirvonen, Jara Uitto, Fabian Kuhn, Mohsen Ghaffari, Jukka Suomela
المساهمون: Swiss Federal Institute of Technology Zurich, Institut de Recherche en Informatique Fondamentale, University of Freiburg, Department of Computer Science, Aalto-yliopisto, Aalto University, Richa, Andrea
المصدر: Leibniz International Proceedings in Informatics (LIPIcs), 91
31st International Symposium on Distributed Computing (DISC 2017)مصطلحات موضوعية: FOS: Computer and information sciences, Computer Networks and Communications, Deterministic algorithm, 0102 computer and information sciences, 01 natural sciences, Theoretical Computer Science, Combinatorics, 03 medical and health sciences, 0302 clinical medicine, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), Discrepancy, Computer communication networks, Mathematics, ta113, 000 Computer science, knowledge, general works, Distributed Graph Algorithms, Degree (graph theory), Edge Coloring, Degree Splitting, Edge coloring, Computer Science - Distributed, Parallel, and Cluster Computing, Computational Theory and Mathematics, 010201 computation theory & mathematics, Hardware and Architecture, Distributed algorithm, 030220 oncology & carcinogenesis, Computer Science, Theory of computation, Graph (abstract data type), Node (circuits), Distributed, Parallel, and Cluster Computing (cs.DC), MathematicsofComputing_DISCRETEMATHEMATICS
وصف الملف: application/pdf; application/application/pdf
-
5
المؤلفون: Juho Hirvonen, Jukka Suomela, Alkida Balliu, Yuval Efron, Sebastian Brandt, Dennis Olivetti, Yannic Maus
المساهمون: University of Freiburg, ETH Zurich, Technion-Israel Institute of Technology, Professorship Suomela J., Department of Computer Science, Aalto-yliopisto, Aalto University
المصدر: PODC
مصطلحات موضوعية: Discrete mathematics, distributed computational complexity, Computer science, Formalism (philosophy), 010102 general mathematics, Binary number, LOCAL model, 0102 computer and information sciences, Orientation (graph theory), Binary logarithm, 01 natural sciences, Asymptotically optimal algorithm, 010201 computation theory & mathematics, Graph (abstract data type), Enhanced Data Rates for GSM Evolution, locally checkable labeling problems, 0101 mathematics, graph problems, Time complexity
وصف الملف: application/pdf
URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d3eda0ec13dfc84c3b4706113a85a090
https://aaltodoc.aalto.fi/handle/123456789/111066 -
6
المؤلفون: Juho Hirvonen, Jukka Suomela, Alkida Balliu, Dennis Olivetti
المصدر: PODC
مصطلحات موضوعية: FOS: Computer and information sciences, Computational complexity theory, Computer science, Distributed computing, 010102 general mathematics, 0102 computer and information sciences, Computational Complexity (cs.CC), 01 natural sciences, Upper and lower bounds, Graph, Computer Science - Computational Complexity, Labeling Problem, Computer Science - Distributed, Parallel, and Cluster Computing, 010201 computation theory & mathematics, Distributed, Parallel, and Cluster Computing (cs.DC), Graph algorithms, Symmetry breaking, 0101 mathematics, MathematicsofComputing_DISCRETEMATHEMATICS
URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4871dd841a4f2236f54241ee049b420b
https://doi.org/10.1145/3293611.3331605 -
7
المؤلفون: Jukka Suomela, Juho Hirvonen, Christoph Lenzen, Alkida Balliu, Dennis Olivetti
المصدر: Structural Information and Communication Complexity ISBN: 9783030249212
SIROCCOمصطلحات موضوعية: Combinatorics, TheoryofComputation_COMPUTATIONBYABSTRACTDEVICES, Computational complexity theory, Distributed algorithm, Locality, Weak coloring, Binary logarithm, Graph, MathematicsofComputing_DISCRETEMATHEMATICS, Mathematics
URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_________::bd7222797586a7fe9c04e5b743c19ecc
https://doi.org/10.1007/978-3-030-24922-9_3 -
8
المؤلفون: Klaus-Tycho Foerster, Jukka Suomela, Stefan Schmid, Juho Hirvonen
المصدر: INFOCOM
مصطلحات موضوعية: FOS: Computer and information sciences, ta113, Computer science, Distributed computing, Locality, Decentralization, Approximation algorithm, Network topology, Software-defined networks, Computer Science - Distributed, Parallel, and Cluster Computing, Distributed algorithm, Independent set, Precomputation, Scalability, Key (cryptography), Distributed, Parallel, and Cluster Computing (cs.DC), Local algorithms
URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b1df4648df0d30a1eef7da86d887b084
http://arxiv.org/abs/1812.00854 -
9
المؤلفون: Mohsen Ghaffari, Fabian Kuhn, Juho Hirvonen, Yannic Maus
المصدر: Distributed Computing, 34 (4)
PODCمصطلحات موضوعية: TheoryofComputation_MISCELLANEOUS, Computer Networks and Communications, Computer science, 0102 computer and information sciences, 02 engineering and technology, Omega, 01 natural sciences, Upper and lower bounds, Theoretical Computer Science, Combinatorics, Log-log plot, TheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITY, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Graph coloring, Computer communication networks, Mathematics, 020203 distributed computing, TheoryofComputation_GENERAL, 020206 networking & telecommunications, State (functional analysis), Binary logarithm, Randomized algorithm, Computational Theory and Mathematics, Computer Science - Distributed, Parallel, and Cluster Computing, Hardware and Architecture, 010201 computation theory & mathematics, Distributed algorithm, MathematicsofComputing_DISCRETEMATHEMATICS
وصف الملف: application/application/pdf
-
10
المؤلفون: Juho Hirvonen, Joel Rybicki, Stefan Schmid, Jukka Suomela
المساهمون: Institut de Recherche en Informatique Fondamentale, University of Helsinki, Aalborg University, Department of Computer Science, Aalto-yliopisto, Aalto University, Biosciences, Centre of Excellence in Metapopulation Research
المصدر: Hirvonen, J, Rybicki, J, Schmid, S & Suomela, J 2017, ' Large cuts with local algorithms on triangle-free graphs ', Electronic Journal of Combinatorics, vol. 24, no. 4, #P4.21 .
Scopus-Elsevier
Aalto University
Aalborg Universityمصطلحات موضوعية: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), graph theory, Maximum cut, regular graphs, 0102 computer and information sciences, Neighbourhood graph, 01 natural sciences, Upper and lower bounds, Theoretical Computer Science, Combinatorics, RAMANUJAN GRAPHS, Computer Science - Data Structures and Algorithms, 0103 physical sciences, 111 Mathematics, Discrete Mathematics and Combinatorics, Data Structures and Algorithms (cs.DS), BIPARTITE SUBGRAPHS, MAX-CUT, 010306 general physics, Mathematics, Applied Mathematics, Cuts, Graph theory, Regular graphs, Graph, Computer Science - Distributed, Parallel, and Cluster Computing, Computational Theory and Mathematics, 010201 computation theory & mathematics, Bipartite graph, cuts, Distributed, Parallel, and Cluster Computing (cs.DC), Geometry and Topology, Algorithm, APPROXIMATION, Computer Science - Discrete Mathematics, MathematicsofComputing_DISCRETEMATHEMATICS
وصف الملف: application/pdf
URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::44aa14d759a82e87b586cbb18c789914
https://doi.org/10.37236/6862
Find this article in full text from Springer Verlag.