Остановите войну!
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 14 matches
- 2017
- Genya Ishigaki, Riti Gour, Ashkan Yousefpour, Norihiko Shinomiya, Jason P. Jue:
Cluster Leader Election Problem for Distributed Controller Placement in SDN. GLOBECOM 2017: 1-6 - Dorit Aharonov, Maor Ganz, Loïck Magnin:
Dining Philosophers, Leader Election and Ring Size problems, in the quantum setting. CoRR abs/1707.01187 (2017) - 2015
- Peter Banda, John S. Caughman IV, Jiri Pospichal:
Configuration Symmetry and Performance Upper Bound of One-Dimensional Cellular Automata for the Leader Election Problem. J. Cell. Autom. 10(1-2): 1-21 (2015) - 2012
- Seiichiro Tani, Hirotada Kobayashi, Keiji Matsumoto:
Exact Quantum Algorithms for the Leader Election Problem. ACM Trans. Comput. Theory 4(1): 1:1-1:24 (2012) - 2010
- Yoann Dieudonné, Franck Petit, Vincent Villain:
Leader Election Problem versus Pattern Formation Problem. DISC 2010: 267-281 - 2009
- Gal Katz, Doron A. Peled:
Synthesizing Solutions to the Leader Election Problem Using Model Checking and Genetic Programming. Haifa Verification Conference 2009: 117-132 - Yoann Dieudonné, Franck Petit, Vincent Villain:
Leader Election Problem Versus Pattern Formation Problem. CoRR abs/0902.2851 (2009) - 2007
- Maria Grazia Vigliotti, Iain Phillips, Catuscia Palamidessi:
Tutorial on separation results in process calculi via leader election problems. Theor. Comput. Sci. 388(1-3): 267-289 (2007) - Seiichiro Tani, Hirotada Kobayashi, Keiji Matsumoto:
Exact Quantum Algorithms for the Leader Election Problem. CoRR abs/0712.4213 (2007) - 2006
- Wei-Mei Chen:
Cost distribution of the Chang-Roberts leader election algorithm and related problems. Theor. Comput. Sci. 369(1-3): 442-447 (2006) - 2005
- Maria Grazia Vigliotti, Iain Phillips, Catuscia Palamidessi:
Separation Results Via Leader Election Problems. FMCO 2005: 172-194 - Seiichiro Tani, Hirotada Kobayashi, Keiji Matsumoto:
Exact Quantum Algorithms for the Leader Election Problem. STACS 2005: 581-592 - 1999
- Masafumi Yamashita, Tsunehiko Kameda:
Leader Election Problem on Networks in which Processor Identity Numbers Are Not Distinct. IEEE Trans. Parallel Distributed Syst. 10(9): 878-887 (1999) - 1987
- Baruch Awerbuch:
Optimal Distributed Algorithms for Minimum Weight Spanning Tree, Counting, Leader Election and Related Problems (Detailed Summary). STOC 1987: 230-240
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-25 16:29 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