|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
No Growbag Graphs found.
|
|
|
Results
Found 42 publication records. Showing 42 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
1 | Luca Becchetti, Andrea Clementi, Francesco Pasquale, Luca Trevisan, Isabella Ziccardi |
Bond Percolation in Small-World Graphs with Power-Law Distribution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAND ![In: 2nd Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2023, June 19-21, 2023, Pisa, Italy, pp. 3:1-3:22, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-275-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Johanne Cohen, Laurence Pilard, Mikaël Rabie, Jonas Sénizergues |
Making Self-Stabilizing Algorithms for Any Locally Greedy Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAND ![In: 2nd Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2023, June 19-21, 2023, Pisa, Italy, pp. 11:1-11:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-275-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | |
Front Matter, Table of Contents, Preface, Conference Organization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAND ![In: 2nd Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2023, June 19-21, 2023, Pisa, Italy, pp. 0:1-0:10, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-275-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Vincent Bridonneau, Frédéric Guinand, Yoann Pigné |
Dynamic Graphs Generators Analysis: An Illustrative Case Study. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAND ![In: 2nd Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2023, June 19-21, 2023, Pisa, Italy, pp. 8:1-8:19, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-275-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Masahiro Shibata, Naoki Kitamura, Ryota Eguchi, Yuichi Sudo, Junya Nakamura 0001, Yonghwan Kim 0001 |
Partial Gathering of Mobile Agents in Dynamic Tori. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAND ![In: 2nd Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2023, June 19-21, 2023, Pisa, Italy, pp. 2:1-2:22, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-275-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Jan Boeckmann, Clemens Thielen, Alina Wittmann |
Complexity of the Temporal Shortest Path Interdiction Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAND ![In: 2nd Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2023, June 19-21, 2023, Pisa, Italy, pp. 9:1-9:20, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-275-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Filippo Brunelli, Laurent Viennot |
Computing Temporal Reachability Under Waiting-Time Constraints in Linear Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAND ![In: 2nd Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2023, June 19-21, 2023, Pisa, Italy, pp. 4:1-4:11, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-275-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Joshua Ani, Michael J. Coulombe, Erik D. Demaine, Yevhenii Diomidov, Timothy Gomez, Dylan H. Hendrickson, Jayson Lynch |
Complexity of Motion Planning of Arbitrarily Many Robots: Gadgets, Petri Nets, and Counter Machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAND ![In: 2nd Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2023, June 19-21, 2023, Pisa, Italy, pp. 5:1-5:21, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-275-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Allen Ibiapina, Ana Silva 0001 |
Snapshot Disjointness in Temporal Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAND ![In: 2nd Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2023, June 19-21, 2023, Pisa, Italy, pp. 1:1-1:20, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-275-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | David Doty, Paul G. Spirakis (eds.) |
2nd Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2023, June 19-21, 2023, Pisa, Italy ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAND ![Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-275-4 The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP BibTeX RDF |
|
1 | Robert M. Alaniz, David Caballero, Timothy Gomez, Elise Grizzell, Andrew Rodriguez, Robert T. Schweller, Tim Wylie |
Covert Computation in the Abstract Tile-Assembly Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAND ![In: 2nd Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2023, June 19-21, 2023, Pisa, Italy, pp. 12:1-12:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-275-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Thomas Bellitto, Cyril Conchon-Kerjan, Bruno Escoffier |
Restless Exploration of Periodic Temporal Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAND ![In: 2nd Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2023, June 19-21, 2023, Pisa, Italy, pp. 13:1-13:15, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-275-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Bernard Chazelle, Kritkorn Karntikoon |
A Connectivity-Sensitive Approach to Consensus Dynamics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAND ![In: 2nd Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2023, June 19-21, 2023, Pisa, Italy, pp. 10:1-10:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-275-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Shunhao Oh, Dana Randall, Andréa W. Richa |
Adaptive Collective Responses to Local Stimuli in Anonymous Dynamic Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAND ![In: 2nd Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2023, June 19-21, 2023, Pisa, Italy, pp. 6:1-6:23, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-275-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Markus Chimani, Niklas Troost |
Multistage Shortest Path: Instances and Practical Evaluation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAND ![In: 2nd Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2023, June 19-21, 2023, Pisa, Italy, pp. 14:1-14:19, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-275-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Swan Dubois, Laurent Feuilloley, Franck Petit, Mikaël Rabie |
When Should You Wait Before Updating? - Toward a Robustness Refinement. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAND ![In: 2nd Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2023, June 19-21, 2023, Pisa, Italy, pp. 7:1-7:15, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-275-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Kathrin Hanauer, Monika Henzinger, Qi Cheng Hua |
Fully Dynamic Four-Vertex Subgraph Counting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAND ![In: 1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference., pp. 18:1-18:17, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-224-2. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Eugen Füchsle, Hendrik Molter, Rolf Niedermeier, Malte Renken |
Temporal Connectivity: Coping with Foreseen and Unforeseen Delays. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAND ![In: 1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference., pp. 17:1-17:17, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-224-2. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Austin Luchsinger |
Brief Announcement: Barrier-1 Reachability for Thermodynamic Binding Networks Is PSPACE-Complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAND ![In: 1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference., pp. 24:1-24:3, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-224-2. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | John Augustine, Srikkanth Ramachandran |
Brief Announcement: Cooperative Guarding in Polygons with Holes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAND ![In: 1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference., pp. 21:1-21:3, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-224-2. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Joshua J. Daymude, Andréa W. Richa, Christian Scheideler |
Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAND ![In: 1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference., pp. 12:1-12:19, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-224-2. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | David Caballero, Timothy Gomez, Robert T. Schweller, Tim Wylie |
Complexity of Verification in Self-Assembly with Prebuilt Assemblies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAND ![In: 1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference., pp. 8:1-8:15, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-224-2. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Danny Hermelin, Yuval Itzhaki, Hendrik Molter, Rolf Niedermeier |
Temporal Unit Interval Independent Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAND ![In: 1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference., pp. 19:1-19:16, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-224-2. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Antonia Adamik, Leon Sering |
Atomic Splittable Flow Over Time Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAND ![In: 1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference., pp. 4:1-4:16, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-224-2. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Petra Berenbrink, Felix Biermeier, Christopher Hahn, Dominik Kaaser |
Loosely-Stabilizing Phase Clocks and The Adaptive Majority Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAND ![In: 1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference., pp. 7:1-7:17, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-224-2. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Paul G. Spirakis |
Algorithmic Problems on Temporal Graphs (Invited Talk). ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAND ![In: 1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference., pp. 2:1-2:1, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-224-2. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Robert M. Alaniz, David Caballero, Sonya C. Cirlos, Timothy Gomez, Elise Grizzell, Andrew Rodriguez, Robert T. Schweller, Armando Tenorio, Tim Wylie |
Building Squares with Optimal State Complexity in Restricted Active Self-Assembly. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAND ![In: 1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference., pp. 6:1-6:18, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-224-2. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Thomas Erlebach, Jakob T. Spooner |
Parameterized Temporal Exploration Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAND ![In: 1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference., pp. 15:1-15:17, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-224-2. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Samuel D. Hand, Jessica A. Enright, Kitty Meeks |
Brief Announcement: The Temporal Firefighter Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAND ![In: 1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference., pp. 22:1-22:3, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-224-2. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Bernadette Charron-Bost, Patrick Lambein-Monette |
Computing Outside the Box: Average Consensus over Dynamic Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAND ![In: 1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference., pp. 10:1-10:16, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-224-2. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Till Fluschnik, Pascal Kunz |
Bipartite Temporal Graphs and the Parameterized Complexity of Multistage 2-Coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAND ![In: 1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference., pp. 16:1-16:18, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-224-2. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Philipp Czerner, Roland Guttenberg, Martin Helfrich, Javier Esparza |
Fast and Succinct Population Protocols for Presburger Arithmetic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAND ![In: 1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference., pp. 11:1-11:17, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-224-2. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Roger Wattenhofer |
Networks, Dynamics, Algorithms, and Learning (Invited Talk). ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAND ![In: 1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference., pp. 3:1-3:1, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-224-2. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Arnaud Casteigts, Timothée Corsini, Hervé Hocquard, Arnaud Labourel |
Robustness of Distances and Diameter in a Fragile Network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAND ![In: 1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference., pp. 9:1-9:16, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-224-2. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | David Doty, Mahsa Eftekhari |
Dynamic Size Counting in Population Protocols. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAND ![In: 1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference., pp. 13:1-13:18, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-224-2. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Ryonosuke Yamada, Yukiko Yamauchi |
Search by a Metamorphic Robotic System in a Finite 3D Cubic Grid. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAND ![In: 1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference., pp. 20:1-20:16, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-224-2. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | James Aspnes, Othon Michail (eds.) |
1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAND ![Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-224-2 The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
1 | Irina Kostitsyna, Christian Scheideler, Daniel Warner 0001 |
Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAND ![In: 1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference., pp. 23:1-23:3, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-224-2. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | |
Front Matter, Table of Contents, Preface, Conference Organization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAND ![In: 1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference., pp. 0:1-0:16, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-224-2. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Kathrin Hanauer, Monika Henzinger, Christian Schulz 0003 |
Recent Advances in Fully Dynamic Graph Algorithms (Invited Talk). ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAND ![In: 1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference., pp. 1:1-1:47, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-224-2. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Duncan Adamson, Vladimir V. Gusev, Dmitriy S. Malyshev, Viktor Zamaraev |
Faster Exploration of Some Temporal Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAND ![In: 1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference., pp. 5:1-5:10, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-224-2. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | David Doty, Aaron Ong |
Simulating 3-Symbol Turing Machines with SIMD||DNA. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAND ![In: 1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference., pp. 14:1-14:15, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-224-2. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #42 of 42 (100 per page; Change: )
|
|