Lower bounds on the state complexity of population protocols (Q6096031): Difference between revisions

@@ Property / DOI @@
-.1007/s00446-023-00450-4
@@ Property / DOI: 10.1007/s00446-023-00450-4 / rank @@
-Normal rank
@@ Property / title @@
+Lower Bounds on the State Complexity of Population Protocols (English)
+Normal rank
@@ Property / DOI @@
+.1145/3465084.3467912
@@ Property / DOI: 10.1145/3465084.3467912 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S00446-023-00450-4
@@ Property / DOI: 10.1007/S00446-023-00450-4 / rank @@
+Normal rank
@@ Property / published in @@
+Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing
+Normal rank
@@ Property / publication date @@
+March 2024Timestamp +2024-03-26T00:00:00Z
Timezone +00:00
Calendar Gregorian
Precision 1 day
Before 0
After 0
-Timestamp
++2024-03-26T00:00:00Z
-Timezone
++00:00
-Calendar
+Gregorian
-Precision
+day
 Before
 After
@@ Property / publication date: 26 March 2024 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+7824181
@@ Property / zbMATH DE Number: 7824181 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+distributed computing
@@ Property / zbMATH Keywords: distributed computing / rank @@
+Normal rank
@@ Property / cites work @@
+Linearizing well quasi-orders and bounding the length of bad sequences
+Normal rank
@@ Property / cites work @@
+Time-Space Trade-offs in Population Protocols
@@ Property / cites work: Time-Space Trade-offs in Population Protocols / rank @@
+Normal rank
@@ Property / cites work @@
+Q4608038
@@ Property / cites work: Q4608038 / rank @@
+Normal rank
@@ Property / cites work @@
+Computation in networks of passively mobile finite-state sensors
+Normal rank
@@ Property / cites work @@
+Computation in networks of passively mobile finite-state sensors
+Normal rank
@@ Property / cites work @@
+Fast computation by population protocols with a leader
+Normal rank
@@ Property / cites work @@
+The computational power of population protocols
@@ Property / cites work: The computational power of population protocols / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of controlled bad sequences over finite sets of Nd
+Normal rank
@@ Property / cites work @@
+Finding cut-offs in leaderless rendez-vous protocols is easy
+Normal rank
@@ Property / cites work @@
+Succinct Population Protocols for Presburger Arithmetic
+Normal rank
@@ Property / cites work @@
+Q3304110
@@ Property / cites work: Q3304110 / rank @@
+Normal rank
@@ Property / cites work @@
+The Reachability Problem for Petri Nets Is Not Elementary
+Normal rank
@@ Property / cites work @@
+Q5207878
@@ Property / cites work: Q5207878 / rank @@
+Normal rank
@@ Property / cites work @@
+Enhanced Phase Clocks, Population Protocols, and Fast Space Optimal Leader Election
+Normal rank
@@ Property / cites work @@
+Q5089313
@@ Property / cites work: Q5089313 / rank @@
+Normal rank
@@ Property / cites work @@
+Petri nets and large finite sets
@@ Property / cites work: Petri nets and large finite sets / rank @@
+Normal rank
@@ Property / cites work @@
+Minimal solutions of linear diophantine systems : bounds and algorithms
+Normal rank
@@ Property / cites work @@
+The covering and boundedness problems for vector addition systems
+Normal rank
@@ Property / cites work @@
+Complexity Hierarchies beyond Elementary
@@ Property / cites work: Complexity Hierarchies beyond Elementary / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:6096031