Search on a Line by Byzantine Robots Article Swipe
Jurek Czyzowicz
,
Konstantinos Georgiou
,
Evangelos Kranakis
,
Danny Kriz̧anc
,
Lata Narayanan
,
Jaroslav Opatrný
,
Sunil Shende
·
YOU?
·
· 2016
· Open Access
·
· DOI: https://doi.org/10.4230/lipics.isaac.2016.27
YOU?
·
· 2016
· Open Access
·
· DOI: https://doi.org/10.4230/lipics.isaac.2016.27
We consider the problem of fault-tolerant parallel search on an infinite line by n robots. Starting from the origin, the robots are required to find a target at an unknown location. The robots can move with maximum speed 1 and can communicate in wireless mode among themselves. However, among the n robots, there are f robots that exhibit byzantine faults. A faulty robot can fail to report the target even after reaching it, or it can make malicious claims about having found the target when in fact it has not. Given the presence of such faulty robots, the search for the target can only be concluded when the non-faulty robots have sufficient verification that the target has been found. We aim to design algorithms that minimize the value of S_d (n, f), the time to find a target at a distance d from the origin by n robots among which f are faulty. We give several different algorithms whose running time depends on the ratio f/n, the density of faulty robots, and also prove lower bounds. Our algorithms are optimal for some densities of faulty robots.
Related Topics
Concepts
Metadata
- Type
- article
- Language
- en
- Landing Page
- https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.27
- https://drops.dagstuhl.de/storage/00lipics/lipics-vol064-isaac2016/LIPIcs.ISAAC.2016.27/LIPIcs.ISAAC.2016.27.pdf
- OA Status
- green
- Cited By
- 23
- Related Works
- 20
- OpenAlex ID
- https://openalex.org/W2557516132
All OpenAlex metadata
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W2557516132Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.4230/lipics.isaac.2016.27Digital Object Identifier
- Title
-
Search on a Line by Byzantine RobotsWork title
- Type
-
articleOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2016Year of publication
- Publication date
-
2016-01-01Full publication date if available
- Authors
-
Jurek Czyzowicz, Konstantinos Georgiou, Evangelos Kranakis, Danny Kriz̧anc, Lata Narayanan, Jaroslav Opatrný, Sunil ShendeList of authors in order
- Landing page
-
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.27Publisher landing page
- PDF URL
-
https://drops.dagstuhl.de/storage/00lipics/lipics-vol064-isaac2016/LIPIcs.ISAAC.2016.27/LIPIcs.ISAAC.2016.27.pdfDirect link to full text PDF
- Open access
-
YesWhether a free full text is available
- OA status
-
greenOpen access status per OpenAlex
- OA URL
-
https://drops.dagstuhl.de/storage/00lipics/lipics-vol064-isaac2016/LIPIcs.ISAAC.2016.27/LIPIcs.ISAAC.2016.27.pdfDirect OA link when available
- Concepts
-
Robot, Line (geometry), Computer science, Mobile robot, Fault tolerance, Algorithm, Distributed computing, Artificial intelligence, Mathematics, GeometryTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
23Total citation count in OpenAlex
- Citations by year (recent)
-
2023: 1, 2022: 1, 2021: 6, 2020: 3, 2019: 6Per-year citation counts (last 5 years)
- Related works (count)
-
20Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W2557516132 |
|---|---|
| doi | https://doi.org/10.4230/lipics.isaac.2016.27 |
| ids.doi | https://doi.org/10.4230/lipics.isaac.2016.27 |
| ids.mag | 2557516132 |
| ids.openalex | https://openalex.org/W2557516132 |
| fwci | 3.58242211 |
| type | article |
| title | Search on a Line by Byzantine Robots |
| biblio.issue | |
| biblio.volume | |
| biblio.last_page | |
| biblio.first_page | |
| topics[0].id | https://openalex.org/T12288 |
| topics[0].field.id | https://openalex.org/fields/17 |
| topics[0].field.display_name | Computer Science |
| topics[0].score | 0.9995999932289124 |
| topics[0].domain.id | https://openalex.org/domains/3 |
| topics[0].domain.display_name | Physical Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/1705 |
| topics[0].subfield.display_name | Computer Networks and Communications |
| topics[0].display_name | Optimization and Search Problems |
| topics[1].id | https://openalex.org/T10772 |
| topics[1].field.id | https://openalex.org/fields/17 |
| topics[1].field.display_name | Computer Science |
| topics[1].score | 0.9732999801635742 |
| topics[1].domain.id | https://openalex.org/domains/3 |
| topics[1].domain.display_name | Physical Sciences |
| topics[1].subfield.id | https://openalex.org/subfields/1705 |
| topics[1].subfield.display_name | Computer Networks and Communications |
| topics[1].display_name | Distributed systems and fault tolerance |
| topics[2].id | https://openalex.org/T12784 |
| topics[2].field.id | https://openalex.org/fields/22 |
| topics[2].field.display_name | Engineering |
| topics[2].score | 0.9729999899864197 |
| topics[2].domain.id | https://openalex.org/domains/3 |
| topics[2].domain.display_name | Physical Sciences |
| topics[2].subfield.id | https://openalex.org/subfields/2210 |
| topics[2].subfield.display_name | Mechanical Engineering |
| topics[2].display_name | Modular Robots and Swarm Intelligence |
| is_xpac | False |
| apc_list | |
| apc_paid | |
| concepts[0].id | https://openalex.org/C90509273 |
| concepts[0].level | 2 |
| concepts[0].score | 0.8866883516311646 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q11012 |
| concepts[0].display_name | Robot |
| concepts[1].id | https://openalex.org/C198352243 |
| concepts[1].level | 2 |
| concepts[1].score | 0.5466998815536499 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q37105 |
| concepts[1].display_name | Line (geometry) |
| concepts[2].id | https://openalex.org/C41008148 |
| concepts[2].level | 0 |
| concepts[2].score | 0.5438421964645386 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[2].display_name | Computer science |
| concepts[3].id | https://openalex.org/C19966478 |
| concepts[3].level | 3 |
| concepts[3].score | 0.5055794715881348 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q4810574 |
| concepts[3].display_name | Mobile robot |
| concepts[4].id | https://openalex.org/C63540848 |
| concepts[4].level | 2 |
| concepts[4].score | 0.4991905689239502 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q3140932 |
| concepts[4].display_name | Fault tolerance |
| concepts[5].id | https://openalex.org/C11413529 |
| concepts[5].level | 1 |
| concepts[5].score | 0.4789717197418213 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q8366 |
| concepts[5].display_name | Algorithm |
| concepts[6].id | https://openalex.org/C120314980 |
| concepts[6].level | 1 |
| concepts[6].score | 0.32004672288894653 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q180634 |
| concepts[6].display_name | Distributed computing |
| concepts[7].id | https://openalex.org/C154945302 |
| concepts[7].level | 1 |
| concepts[7].score | 0.307206392288208 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q11660 |
| concepts[7].display_name | Artificial intelligence |
| concepts[8].id | https://openalex.org/C33923547 |
| concepts[8].level | 0 |
| concepts[8].score | 0.2881935238838196 |
| concepts[8].wikidata | https://www.wikidata.org/wiki/Q395 |
| concepts[8].display_name | Mathematics |
| concepts[9].id | https://openalex.org/C2524010 |
| concepts[9].level | 1 |
| concepts[9].score | 0.0 |
| concepts[9].wikidata | https://www.wikidata.org/wiki/Q8087 |
| concepts[9].display_name | Geometry |
| keywords[0].id | https://openalex.org/keywords/robot |
| keywords[0].score | 0.8866883516311646 |
| keywords[0].display_name | Robot |
| keywords[1].id | https://openalex.org/keywords/line |
| keywords[1].score | 0.5466998815536499 |
| keywords[1].display_name | Line (geometry) |
| keywords[2].id | https://openalex.org/keywords/computer-science |
| keywords[2].score | 0.5438421964645386 |
| keywords[2].display_name | Computer science |
| keywords[3].id | https://openalex.org/keywords/mobile-robot |
| keywords[3].score | 0.5055794715881348 |
| keywords[3].display_name | Mobile robot |
| keywords[4].id | https://openalex.org/keywords/fault-tolerance |
| keywords[4].score | 0.4991905689239502 |
| keywords[4].display_name | Fault tolerance |
| keywords[5].id | https://openalex.org/keywords/algorithm |
| keywords[5].score | 0.4789717197418213 |
| keywords[5].display_name | Algorithm |
| keywords[6].id | https://openalex.org/keywords/distributed-computing |
| keywords[6].score | 0.32004672288894653 |
| keywords[6].display_name | Distributed computing |
| keywords[7].id | https://openalex.org/keywords/artificial-intelligence |
| keywords[7].score | 0.307206392288208 |
| keywords[7].display_name | Artificial intelligence |
| keywords[8].id | https://openalex.org/keywords/mathematics |
| keywords[8].score | 0.2881935238838196 |
| keywords[8].display_name | Mathematics |
| language | en |
| locations[0].id | pmh:oai:drops-oai.dagstuhl.de:6797 |
| locations[0].is_oa | True |
| locations[0].source.id | https://openalex.org/S4306402524 |
| locations[0].source.issn | |
| locations[0].source.type | repository |
| locations[0].source.is_oa | False |
| locations[0].source.issn_l | |
| locations[0].source.is_core | False |
| locations[0].source.is_in_doaj | False |
| locations[0].source.display_name | Leibniz-Zentrum für Informatik (Schloss Dagstuhl) |
| locations[0].source.host_organization | https://openalex.org/I2799853480 |
| locations[0].source.host_organization_name | Schloss Dagstuhl – Leibniz Center for Informatics |
| locations[0].source.host_organization_lineage | https://openalex.org/I2799853480 |
| locations[0].license | cc-by |
| locations[0].pdf_url | https://drops.dagstuhl.de/storage/00lipics/lipics-vol064-isaac2016/LIPIcs.ISAAC.2016.27/LIPIcs.ISAAC.2016.27.pdf |
| locations[0].version | submittedVersion |
| locations[0].raw_type | InProceedings |
| locations[0].license_id | https://openalex.org/licenses/cc-by |
| locations[0].is_accepted | False |
| locations[0].is_published | False |
| locations[0].raw_source_name | |
| locations[0].landing_page_url | https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.27 |
| locations[1].id | doi:10.4230/lipics.isaac.2016.27 |
| locations[1].is_oa | True |
| locations[1].source.id | https://openalex.org/S7407052059 |
| locations[1].source.type | repository |
| locations[1].source.is_oa | False |
| locations[1].source.issn_l | |
| locations[1].source.is_core | False |
| locations[1].source.is_in_doaj | False |
| locations[1].source.display_name | Dagstuhl Research Online Publication Server |
| locations[1].source.host_organization | |
| locations[1].source.host_organization_name | |
| locations[1].license | cc-by |
| locations[1].pdf_url | |
| locations[1].version | |
| locations[1].raw_type | |
| locations[1].license_id | https://openalex.org/licenses/cc-by |
| locations[1].is_accepted | False |
| locations[1].is_published | |
| locations[1].raw_source_name | |
| locations[1].landing_page_url | https://doi.org/10.4230/lipics.isaac.2016.27 |
| indexed_in | datacite |
| authorships[0].author.id | https://openalex.org/A5067736776 |
| authorships[0].author.orcid | https://orcid.org/0000-0002-9026-1217 |
| authorships[0].author.display_name | Jurek Czyzowicz |
| authorships[0].countries | CA |
| authorships[0].affiliations[0].institution_ids | https://openalex.org/I33217400 |
| authorships[0].affiliations[0].raw_affiliation_string | UNIVERSITÉ DU QUÉBEC EN OUTAOUAIS |
| authorships[0].institutions[0].id | https://openalex.org/I33217400 |
| authorships[0].institutions[0].ror | https://ror.org/011pqxa69 |
| authorships[0].institutions[0].type | education |
| authorships[0].institutions[0].lineage | https://openalex.org/I33217400, https://openalex.org/I49663120 |
| authorships[0].institutions[0].country_code | CA |
| authorships[0].institutions[0].display_name | Université du Québec en Outaouais |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Jurek Czyzowicz |
| authorships[0].is_corresponding | False |
| authorships[0].raw_affiliation_strings | UNIVERSITÉ DU QUÉBEC EN OUTAOUAIS |
| authorships[1].author.id | https://openalex.org/A5104807074 |
| authorships[1].author.orcid | |
| authorships[1].author.display_name | Konstantinos Georgiou |
| authorships[1].countries | CA |
| authorships[1].affiliations[0].institution_ids | https://openalex.org/I530967 |
| authorships[1].affiliations[0].raw_affiliation_string | |
| authorships[1].institutions[0].id | https://openalex.org/I530967 |
| authorships[1].institutions[0].ror | https://ror.org/05g13zd79 |
| authorships[1].institutions[0].type | education |
| authorships[1].institutions[0].lineage | https://openalex.org/I530967 |
| authorships[1].institutions[0].country_code | CA |
| authorships[1].institutions[0].display_name | Toronto Metropolitan University |
| authorships[1].author_position | middle |
| authorships[1].raw_author_name | Konstantinos Georgiou |
| authorships[1].is_corresponding | False |
| authorships[1].raw_affiliation_strings | |
| authorships[2].author.id | https://openalex.org/A5003125546 |
| authorships[2].author.orcid | https://orcid.org/0000-0002-8959-4428 |
| authorships[2].author.display_name | Evangelos Kranakis |
| authorships[2].countries | CA |
| authorships[2].affiliations[0].institution_ids | https://openalex.org/I67031392 |
| authorships[2].affiliations[0].raw_affiliation_string | Carleton University |
| authorships[2].institutions[0].id | https://openalex.org/I67031392 |
| authorships[2].institutions[0].ror | https://ror.org/02qtvee93 |
| authorships[2].institutions[0].type | education |
| authorships[2].institutions[0].lineage | https://openalex.org/I67031392 |
| authorships[2].institutions[0].country_code | CA |
| authorships[2].institutions[0].display_name | Carleton University |
| authorships[2].author_position | middle |
| authorships[2].raw_author_name | Evangelos Kranakis |
| authorships[2].is_corresponding | False |
| authorships[2].raw_affiliation_strings | Carleton University |
| authorships[3].author.id | https://openalex.org/A5058262792 |
| authorships[3].author.orcid | https://orcid.org/0000-0002-0941-4010 |
| authorships[3].author.display_name | Danny Kriz̧anc |
| authorships[3].countries | US |
| authorships[3].affiliations[0].institution_ids | https://openalex.org/I100538780 |
| authorships[3].affiliations[0].raw_affiliation_string | Wesleyan University. |
| authorships[3].institutions[0].id | https://openalex.org/I100538780 |
| authorships[3].institutions[0].ror | https://ror.org/05h7xva58 |
| authorships[3].institutions[0].type | education |
| authorships[3].institutions[0].lineage | https://openalex.org/I100538780 |
| authorships[3].institutions[0].country_code | US |
| authorships[3].institutions[0].display_name | Wesleyan University |
| authorships[3].author_position | middle |
| authorships[3].raw_author_name | Danny Krizanc |
| authorships[3].is_corresponding | False |
| authorships[3].raw_affiliation_strings | Wesleyan University. |
| authorships[4].author.id | https://openalex.org/A5067542317 |
| authorships[4].author.orcid | https://orcid.org/0000-0002-3875-0371 |
| authorships[4].author.display_name | Lata Narayanan |
| authorships[4].countries | CA |
| authorships[4].affiliations[0].institution_ids | https://openalex.org/I60158472 |
| authorships[4].affiliations[0].raw_affiliation_string | Concordia University |
| authorships[4].institutions[0].id | https://openalex.org/I60158472 |
| authorships[4].institutions[0].ror | https://ror.org/0420zvk78 |
| authorships[4].institutions[0].type | education |
| authorships[4].institutions[0].lineage | https://openalex.org/I60158472 |
| authorships[4].institutions[0].country_code | CA |
| authorships[4].institutions[0].display_name | Concordia University |
| authorships[4].author_position | middle |
| authorships[4].raw_author_name | Lata Narayanan |
| authorships[4].is_corresponding | False |
| authorships[4].raw_affiliation_strings | Concordia University |
| authorships[5].author.id | https://openalex.org/A5012902253 |
| authorships[5].author.orcid | https://orcid.org/0000-0001-6149-003X |
| authorships[5].author.display_name | Jaroslav Opatrný |
| authorships[5].countries | CA |
| authorships[5].affiliations[0].institution_ids | https://openalex.org/I60158472 |
| authorships[5].affiliations[0].raw_affiliation_string | Concordia University |
| authorships[5].institutions[0].id | https://openalex.org/I60158472 |
| authorships[5].institutions[0].ror | https://ror.org/0420zvk78 |
| authorships[5].institutions[0].type | education |
| authorships[5].institutions[0].lineage | https://openalex.org/I60158472 |
| authorships[5].institutions[0].country_code | CA |
| authorships[5].institutions[0].display_name | Concordia University |
| authorships[5].author_position | middle |
| authorships[5].raw_author_name | Jaroslav Opatrny |
| authorships[5].is_corresponding | False |
| authorships[5].raw_affiliation_strings | Concordia University |
| authorships[6].author.id | https://openalex.org/A5012948179 |
| authorships[6].author.orcid | https://orcid.org/0000-0003-4336-5336 |
| authorships[6].author.display_name | Sunil Shende |
| authorships[6].countries | NL, US |
| authorships[6].affiliations[0].institution_ids | https://openalex.org/I102322142, https://openalex.org/I4210096112 |
| authorships[6].affiliations[0].raw_affiliation_string | The Rutgers Center for Computational and Integrative Biology (CCIB) |
| authorships[6].institutions[0].id | https://openalex.org/I4210096112 |
| authorships[6].institutions[0].ror | https://ror.org/00rcvgx40 |
| authorships[6].institutions[0].type | other |
| authorships[6].institutions[0].lineage | https://openalex.org/I4210096112 |
| authorships[6].institutions[0].country_code | NL |
| authorships[6].institutions[0].display_name | Rutgers Sexual and Reproductive Health and Rights |
| authorships[6].institutions[1].id | https://openalex.org/I102322142 |
| authorships[6].institutions[1].ror | https://ror.org/05vt9qd57 |
| authorships[6].institutions[1].type | education |
| authorships[6].institutions[1].lineage | https://openalex.org/I102322142 |
| authorships[6].institutions[1].country_code | US |
| authorships[6].institutions[1].display_name | Rutgers, The State University of New Jersey |
| authorships[6].author_position | last |
| authorships[6].raw_author_name | Sunil M. Shende |
| authorships[6].is_corresponding | False |
| authorships[6].raw_affiliation_strings | The Rutgers Center for Computational and Integrative Biology (CCIB) |
| has_content.pdf | True |
| has_content.grobid_xml | True |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://drops.dagstuhl.de/storage/00lipics/lipics-vol064-isaac2016/LIPIcs.ISAAC.2016.27/LIPIcs.ISAAC.2016.27.pdf |
| open_access.oa_status | green |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | Search on a Line by Byzantine Robots |
| has_fulltext | True |
| is_retracted | False |
| updated_date | 2025-11-06T06:51:31.235846 |
| primary_topic.id | https://openalex.org/T12288 |
| primary_topic.field.id | https://openalex.org/fields/17 |
| primary_topic.field.display_name | Computer Science |
| primary_topic.score | 0.9995999932289124 |
| primary_topic.domain.id | https://openalex.org/domains/3 |
| primary_topic.domain.display_name | Physical Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/1705 |
| primary_topic.subfield.display_name | Computer Networks and Communications |
| primary_topic.display_name | Optimization and Search Problems |
| related_works | https://openalex.org/W2477849570, https://openalex.org/W1990654078, https://openalex.org/W2019729116, https://openalex.org/W2027689366, https://openalex.org/W1501957312, https://openalex.org/W206135991, https://openalex.org/W1975581626, https://openalex.org/W1995434882, https://openalex.org/W32433637, https://openalex.org/W2607458834, https://openalex.org/W791172522, https://openalex.org/W2908766116, https://openalex.org/W2187411536, https://openalex.org/W2962766768, https://openalex.org/W2776347794, https://openalex.org/W2128634904, https://openalex.org/W2962946724, https://openalex.org/W2058489548, https://openalex.org/W2015425837, https://openalex.org/W2962698814 |
| cited_by_count | 23 |
| counts_by_year[0].year | 2023 |
| counts_by_year[0].cited_by_count | 1 |
| counts_by_year[1].year | 2022 |
| counts_by_year[1].cited_by_count | 1 |
| counts_by_year[2].year | 2021 |
| counts_by_year[2].cited_by_count | 6 |
| counts_by_year[3].year | 2020 |
| counts_by_year[3].cited_by_count | 3 |
| counts_by_year[4].year | 2019 |
| counts_by_year[4].cited_by_count | 6 |
| counts_by_year[5].year | 2018 |
| counts_by_year[5].cited_by_count | 5 |
| counts_by_year[6].year | 2017 |
| counts_by_year[6].cited_by_count | 1 |
| locations_count | 2 |
| best_oa_location.id | pmh:oai:drops-oai.dagstuhl.de:6797 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S4306402524 |
| best_oa_location.source.issn | |
| best_oa_location.source.type | repository |
| best_oa_location.source.is_oa | False |
| best_oa_location.source.issn_l | |
| best_oa_location.source.is_core | False |
| best_oa_location.source.is_in_doaj | False |
| best_oa_location.source.display_name | Leibniz-Zentrum für Informatik (Schloss Dagstuhl) |
| best_oa_location.source.host_organization | https://openalex.org/I2799853480 |
| best_oa_location.source.host_organization_name | Schloss Dagstuhl – Leibniz Center for Informatics |
| best_oa_location.source.host_organization_lineage | https://openalex.org/I2799853480 |
| best_oa_location.license | cc-by |
| best_oa_location.pdf_url | https://drops.dagstuhl.de/storage/00lipics/lipics-vol064-isaac2016/LIPIcs.ISAAC.2016.27/LIPIcs.ISAAC.2016.27.pdf |
| best_oa_location.version | submittedVersion |
| best_oa_location.raw_type | InProceedings |
| best_oa_location.license_id | https://openalex.org/licenses/cc-by |
| best_oa_location.is_accepted | False |
| best_oa_location.is_published | False |
| best_oa_location.raw_source_name | |
| best_oa_location.landing_page_url | https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.27 |
| primary_location.id | pmh:oai:drops-oai.dagstuhl.de:6797 |
| primary_location.is_oa | True |
| primary_location.source.id | https://openalex.org/S4306402524 |
| primary_location.source.issn | |
| primary_location.source.type | repository |
| primary_location.source.is_oa | False |
| primary_location.source.issn_l | |
| primary_location.source.is_core | False |
| primary_location.source.is_in_doaj | False |
| primary_location.source.display_name | Leibniz-Zentrum für Informatik (Schloss Dagstuhl) |
| primary_location.source.host_organization | https://openalex.org/I2799853480 |
| primary_location.source.host_organization_name | Schloss Dagstuhl – Leibniz Center for Informatics |
| primary_location.source.host_organization_lineage | https://openalex.org/I2799853480 |
| primary_location.license | cc-by |
| primary_location.pdf_url | https://drops.dagstuhl.de/storage/00lipics/lipics-vol064-isaac2016/LIPIcs.ISAAC.2016.27/LIPIcs.ISAAC.2016.27.pdf |
| primary_location.version | submittedVersion |
| primary_location.raw_type | InProceedings |
| primary_location.license_id | https://openalex.org/licenses/cc-by |
| primary_location.is_accepted | False |
| primary_location.is_published | False |
| primary_location.raw_source_name | |
| primary_location.landing_page_url | https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.27 |
| publication_date | 2016-01-01 |
| publication_year | 2016 |
| referenced_works_count | 0 |
| abstract_inverted_index.1 | 38 |
| abstract_inverted_index.A | 60 |
| abstract_inverted_index.a | 25, 136, 139 |
| abstract_inverted_index.d | 141 |
| abstract_inverted_index.f | 54, 150 |
| abstract_inverted_index.n | 13, 50, 146 |
| abstract_inverted_index.We | 0, 119, 153 |
| abstract_inverted_index.an | 9, 28 |
| abstract_inverted_index.at | 27, 138 |
| abstract_inverted_index.be | 104 |
| abstract_inverted_index.by | 12, 145 |
| abstract_inverted_index.in | 42, 85 |
| abstract_inverted_index.it | 74, 87 |
| abstract_inverted_index.of | 4, 93, 128, 168, 183 |
| abstract_inverted_index.on | 8, 162 |
| abstract_inverted_index.or | 73 |
| abstract_inverted_index.to | 23, 65, 121, 134 |
| abstract_inverted_index.(n, | 130 |
| abstract_inverted_index.Our | 176 |
| abstract_inverted_index.S_d | 129 |
| abstract_inverted_index.The | 31 |
| abstract_inverted_index.aim | 120 |
| abstract_inverted_index.and | 39, 171 |
| abstract_inverted_index.are | 21, 53, 151, 178 |
| abstract_inverted_index.can | 33, 40, 63, 75, 102 |
| abstract_inverted_index.f), | 131 |
| abstract_inverted_index.for | 99, 180 |
| abstract_inverted_index.has | 88, 116 |
| abstract_inverted_index.it, | 72 |
| abstract_inverted_index.the | 2, 17, 19, 49, 67, 82, 91, 97, 100, 107, 114, 126, 132, 143, 163, 166 |
| abstract_inverted_index.also | 172 |
| abstract_inverted_index.been | 117 |
| abstract_inverted_index.even | 69 |
| abstract_inverted_index.f/n, | 165 |
| abstract_inverted_index.fact | 86 |
| abstract_inverted_index.fail | 64 |
| abstract_inverted_index.find | 24, 135 |
| abstract_inverted_index.from | 16, 142 |
| abstract_inverted_index.give | 154 |
| abstract_inverted_index.have | 110 |
| abstract_inverted_index.line | 11 |
| abstract_inverted_index.make | 76 |
| abstract_inverted_index.mode | 44 |
| abstract_inverted_index.move | 34 |
| abstract_inverted_index.not. | 89 |
| abstract_inverted_index.only | 103 |
| abstract_inverted_index.some | 181 |
| abstract_inverted_index.such | 94 |
| abstract_inverted_index.that | 56, 113, 124 |
| abstract_inverted_index.time | 133, 160 |
| abstract_inverted_index.when | 84, 106 |
| abstract_inverted_index.with | 35 |
| abstract_inverted_index.Given | 90 |
| abstract_inverted_index.about | 79 |
| abstract_inverted_index.after | 70 |
| abstract_inverted_index.among | 45, 48, 148 |
| abstract_inverted_index.found | 81 |
| abstract_inverted_index.lower | 174 |
| abstract_inverted_index.prove | 173 |
| abstract_inverted_index.ratio | 164 |
| abstract_inverted_index.robot | 62 |
| abstract_inverted_index.speed | 37 |
| abstract_inverted_index.there | 52 |
| abstract_inverted_index.value | 127 |
| abstract_inverted_index.which | 149 |
| abstract_inverted_index.whose | 158 |
| abstract_inverted_index.claims | 78 |
| abstract_inverted_index.design | 122 |
| abstract_inverted_index.faulty | 61, 95, 169, 184 |
| abstract_inverted_index.found. | 118 |
| abstract_inverted_index.having | 80 |
| abstract_inverted_index.origin | 144 |
| abstract_inverted_index.report | 66 |
| abstract_inverted_index.robots | 20, 32, 55, 109, 147 |
| abstract_inverted_index.search | 7, 98 |
| abstract_inverted_index.target | 26, 68, 83, 101, 115, 137 |
| abstract_inverted_index.bounds. | 175 |
| abstract_inverted_index.density | 167 |
| abstract_inverted_index.depends | 161 |
| abstract_inverted_index.exhibit | 57 |
| abstract_inverted_index.faults. | 59 |
| abstract_inverted_index.faulty. | 152 |
| abstract_inverted_index.maximum | 36 |
| abstract_inverted_index.optimal | 179 |
| abstract_inverted_index.origin, | 18 |
| abstract_inverted_index.problem | 3 |
| abstract_inverted_index.robots, | 51, 96, 170 |
| abstract_inverted_index.robots. | 14, 185 |
| abstract_inverted_index.running | 159 |
| abstract_inverted_index.several | 155 |
| abstract_inverted_index.unknown | 29 |
| abstract_inverted_index.However, | 47 |
| abstract_inverted_index.Starting | 15 |
| abstract_inverted_index.consider | 1 |
| abstract_inverted_index.distance | 140 |
| abstract_inverted_index.infinite | 10 |
| abstract_inverted_index.minimize | 125 |
| abstract_inverted_index.parallel | 6 |
| abstract_inverted_index.presence | 92 |
| abstract_inverted_index.reaching | 71 |
| abstract_inverted_index.required | 22 |
| abstract_inverted_index.wireless | 43 |
| abstract_inverted_index.byzantine | 58 |
| abstract_inverted_index.concluded | 105 |
| abstract_inverted_index.densities | 182 |
| abstract_inverted_index.different | 156 |
| abstract_inverted_index.location. | 30 |
| abstract_inverted_index.malicious | 77 |
| abstract_inverted_index.algorithms | 123, 157, 177 |
| abstract_inverted_index.non-faulty | 108 |
| abstract_inverted_index.sufficient | 111 |
| abstract_inverted_index.communicate | 41 |
| abstract_inverted_index.themselves. | 46 |
| abstract_inverted_index.verification | 112 |
| abstract_inverted_index.fault-tolerant | 5 |
| cited_by_percentile_year.max | 99 |
| cited_by_percentile_year.min | 89 |
| countries_distinct_count | 3 |
| institutions_distinct_count | 7 |
| citation_normalized_percentile.value | 0.93874111 |
| citation_normalized_percentile.is_in_top_1_percent | False |
| citation_normalized_percentile.is_in_top_10_percent | True |