Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 42 matches
- 2023
- Robert M. Alaniz, David Caballero, Timothy Gomez, Elise Grizzell, Andrew Rodriguez, Robert T. Schweller, Tim Wylie:
Covert Computation in the Abstract Tile-Assembly Model. SAND 2023: 12:1-12:17 - 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. SAND 2023: 5:1-5:21 - Luca Becchetti, Andrea Clementi, Francesco Pasquale, Luca Trevisan, Isabella Ziccardi:
Bond Percolation in Small-World Graphs with Power-Law Distribution. SAND 2023: 3:1-3:22 - Thomas Bellitto, Cyril Conchon-Kerjan, Bruno Escoffier:
Restless Exploration of Periodic Temporal Graphs. SAND 2023: 13:1-13:15 - Jan Boeckmann, Clemens Thielen, Alina Wittmann:
Complexity of the Temporal Shortest Path Interdiction Problem. SAND 2023: 9:1-9:20 - Vincent Bridonneau, Frédéric Guinand, Yoann Pigné:
Dynamic Graphs Generators Analysis: An Illustrative Case Study. SAND 2023: 8:1-8:19 - Filippo Brunelli, Laurent Viennot:
Computing Temporal Reachability Under Waiting-Time Constraints in Linear Time. SAND 2023: 4:1-4:11 - Bernard Chazelle, Kritkorn Karntikoon:
A Connectivity-Sensitive Approach to Consensus Dynamics. SAND 2023: 10:1-10:17 - Markus Chimani, Niklas Troost:
Multistage Shortest Path: Instances and Practical Evaluation. SAND 2023: 14:1-14:19 - Johanne Cohen, Laurence Pilard, Mikaël Rabie, Jonas Sénizergues:
Making Self-Stabilizing Algorithms for Any Locally Greedy Problem. SAND 2023: 11:1-11:17 - Swan Dubois, Laurent Feuilloley, Franck Petit, Mikaël Rabie:
When Should You Wait Before Updating? - Toward a Robustness Refinement. SAND 2023: 7:1-7:15 - Allen Ibiapina, Ana Silva:
Snapshot Disjointness in Temporal Graphs. SAND 2023: 1:1-1:20 - Shunhao Oh, Dana Randall, Andréa W. Richa:
Adaptive Collective Responses to Local Stimuli in Anonymous Dynamic Networks. SAND 2023: 6:1-6:23 - Masahiro Shibata, Naoki Kitamura, Ryota Eguchi, Yuichi Sudo, Junya Nakamura, Yonghwan Kim:
Partial Gathering of Mobile Agents in Dynamic Tori. SAND 2023: 2:1-2:22 - Front Matter, Table of Contents, Preface, Conference Organization. SAND 2023: 0:1-0:10
- David Doty, Paul G. Spirakis:
2nd Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2023, June 19-21, 2023, Pisa, Italy. LIPIcs 257, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2023, ISBN 978-3-95977-275-4 [contents] - 2022
- Antonia Adamik, Leon Sering:
Atomic Splittable Flow Over Time Games. SAND 2022: 4:1-4:16 - Duncan Adamson, Vladimir V. Gusev, Dmitriy S. Malyshev, Viktor Zamaraev:
Faster Exploration of Some Temporal Graphs. SAND 2022: 5:1-5:10 - 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. SAND 2022: 6:1-6:18 - John Augustine, Srikkanth Ramachandran:
Brief Announcement: Cooperative Guarding in Polygons with Holes. SAND 2022: 21:1-21:3 - Petra Berenbrink, Felix Biermeier, Christopher Hahn, Dominik Kaaser:
Loosely-Stabilizing Phase Clocks and The Adaptive Majority Problem. SAND 2022: 7:1-7:17 - David Caballero, Timothy Gomez, Robert T. Schweller, Tim Wylie:
Complexity of Verification in Self-Assembly with Prebuilt Assemblies. SAND 2022: 8:1-8:15 - Arnaud Casteigts, Timothée Corsini, Hervé Hocquard, Arnaud Labourel:
Robustness of Distances and Diameter in a Fragile Network. SAND 2022: 9:1-9:16 - Bernadette Charron-Bost, Patrick Lambein-Monette:
Computing Outside the Box: Average Consensus over Dynamic Networks. SAND 2022: 10:1-10:16 - Philipp Czerner, Roland Guttenberg, Martin Helfrich, Javier Esparza:
Fast and Succinct Population Protocols for Presburger Arithmetic. SAND 2022: 11:1-11:17 - Joshua J. Daymude, Andréa W. Richa, Christian Scheideler:
Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems. SAND 2022: 12:1-12:19 - David Doty, Mahsa Eftekhari:
Dynamic Size Counting in Population Protocols. SAND 2022: 13:1-13:18 - David Doty, Aaron Ong:
Simulating 3-Symbol Turing Machines with SIMD||DNA. SAND 2022: 14:1-14:15 - Thomas Erlebach, Jakob T. Spooner:
Parameterized Temporal Exploration Problems. SAND 2022: 15:1-15:17 - Till Fluschnik, Pascal Kunz:
Bipartite Temporal Graphs and the Parameterized Complexity of Multistage 2-Coloring. SAND 2022: 16:1-16:18
skipping 12 more matches
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-04-23 14:35 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint