On Greedy Trie Execution

In the paper "How to select a looser'' Prodinger was analyzing an algorithm where $n$ participants are selecting a leader by flipping fair coins, where recursively, the 0-party (those who i.e. have tossed heads) continues until the leader is chosen. We give an answer to the question s...

Full description

Saved in:
Bibliographic Details
Published in:Discrete mathematics and theoretical computer science Vol. DMTCS Proceedings vol. AQ,...; no. Proceedings; pp. 377 - 380
Main Authors: Gołębiewski, Zbigniew, Zagórski, Filip
Format: Journal Article Conference Proceeding
Language:English
Published: DMTCS 01.01.2012
Discrete Mathematics and Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science
Series:DMTCS Proceedings
Subjects:
[info.info-cg] computer science [cs]/computational geometry [cs.cg]
[info.info-dm] computer science [cs]/discrete mathematics [cs.dm]
[info.info-ds] computer science [cs]/data structures and algorithms [cs.ds]
[math.math-co] mathematics [math]/combinatorics [math.co]
Combinatorics
Computational Geometry
Computer Science
Data Structures and Algorithms
Discrete Mathematics
leader election
Mathematics
trie
Trie
leader election
ISSN:1365-8050, 1462-7264, 1365-8050
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract In the paper "How to select a looser'' Prodinger was analyzing an algorithm where $n$ participants are selecting a leader by flipping fair coins, where recursively, the 0-party (those who i.e. have tossed heads) continues until the leader is chosen. We give an answer to the question stated in the Prodinger's paper – what happens if not a 0-party is recursively looking for a leader but always a party with a smaller cardinality. We show the lower bound on the number of rounds of the greedy algorithm (for fair coin).
AbstractList In the paper "How to select a looser'' Prodinger was analyzing an algorithm where $n$ participants are selecting a leader by flipping fair coins, where recursively, the 0-party (those who i.e. have tossed heads) continues until the leader is chosen. We give an answer to the question stated in the Prodinger's paper – what happens if not a 0-party is recursively looking for a leader but always a party with a smaller cardinality. We show the lower bound on the number of rounds of the greedy algorithm (for fair coin).
Author Zagórski, Filip
Gołębiewski, Zbigniew
Author_xml – sequence: 1
  givenname: Zbigniew
  surname: Gołębiewski
  fullname: Gołębiewski, Zbigniew
  organization: Faculty of Fundamental Problems of Technology [Wroclaw]
– sequence: 2
  givenname: Filip
  surname: Zagórski
  fullname: Zagórski, Filip
  organization: Faculty of Fundamental Problems of Technology [Wroclaw]
BackLink https://inria.hal.science/hal-01197231$$DView record in HAL
BookMark eNpVkE1LAzEQhoNUsK2evHjsVWRrJrNpNsdS-gWFXuo55GOiW9pdyVax_952K6KHYYaXd57D02Odqq6IsXvgw3wkdPEc9gffDJFzdcW6gCOZFVzyzp_7hvWaZss5CJ2rLntYV4N5IgrHwSaVNJh-kf84lHV1y66j3TV097P77GU23UwW2Wo9X07Gq8yDQpWhUMJJDRidL-KosFy6wAPlOqDHEEQAKcBZGQU5IBWFIw85tiOVxz5bXrihtlvznsq9TUdT29K0QZ1ejU2H0u_IWIpk0XHvOeZW5wWKoIJXgltJ2rkT6_HCerO7f6jFeGXOGQfQSiB8wqn7dOn6VDdNovj7ANy0Mk0r05xl4jdtRme8
ContentType Journal Article
Conference Proceeding
Copyright Distributed under a Creative Commons Attribution 4.0 International License
Copyright_xml – notice: Distributed under a Creative Commons Attribution 4.0 International License
DBID AAYXX
CITATION
1XC
VOOES
DOA
DOI 10.46298/dmtcs.3007
DatabaseName CrossRef
Hyper Article en Ligne (HAL)
Hyper Article en Ligne (HAL) (Open Access)
DOAJ Directory of Open Access Journals
DatabaseTitle CrossRef
DatabaseTitleList
CrossRef
Database_xml – sequence: 1
  dbid: DOA
  name: DOAJ (Directory of Open Access Journals)
  url: https://www.doaj.org/
  sourceTypes: Open Website
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
Computer Science
EISSN 1365-8050
EndPage 380
ExternalDocumentID oai_doaj_org_article_aefea3b0cc034a94832d7dc720a5e9bb
oai:HAL:hal-01197231v1
10_46298_dmtcs_3007
GroupedDBID -~9
.4S
.DC
29G
2WC
5GY
5VS
8FE
8FG
AAFWJ
AAYXX
ABDBF
ABJCF
ABUWG
ACGFO
ACIWK
ACUHS
ADBBV
ADQAK
AENEX
AFFHD
AFKRA
AFPKN
AIAGR
ALMA_UNASSIGNED_HOLDINGS
AMVHM
ARCSS
B0M
BCNDV
BENPR
BFMQW
BGLVJ
BPHCQ
C1A
CCPQU
CITATION
EAP
EBS
ECS
EDO
EJD
EMK
EPL
EST
ESX
GROUPED_DOAJ
HCIFZ
I-F
IAO
IBB
ICD
ITC
J9A
KQ8
KWQ
L6V
M7S
MK~
ML~
OK1
OVT
P2P
PHGZM
PHGZT
PIMPY
PQGLB
PQQKQ
PROAC
PTHSS
REM
RNS
RSU
TR2
TUS
XSB
~8M
1XC
VOOES
ID FETCH-LOGICAL-c1737-3272b5913fbc8f68a05bd0de49d3c3dd2d1521ba5f2eb1e7f2bec143c143c57c3
IEDL.DBID DOA
ISSN 1365-8050
1462-7264
IngestDate Fri Oct 03 12:52:06 EDT 2025
Sat Nov 29 15:00:35 EST 2025
Sat Nov 29 02:48:24 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue Proceedings
Keywords Trie
leader election
Language English
License Distributed under a Creative Commons Attribution 4.0 International License: http://creativecommons.org/licenses/by/4.0
LinkModel DirectLink
MeetingName 23rd International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'12)
MergedId FETCHMERGED-LOGICAL-c1737-3272b5913fbc8f68a05bd0de49d3c3dd2d1521ba5f2eb1e7f2bec143c143c57c3
OpenAccessLink https://doaj.org/article/aefea3b0cc034a94832d7dc720a5e9bb
PageCount 4
ParticipantIDs doaj_primary_oai_doaj_org_article_aefea3b0cc034a94832d7dc720a5e9bb
hal_primary_oai_HAL_hal_01197231v1
crossref_primary_10_46298_dmtcs_3007
PublicationCentury 2000
PublicationDate 2012-01-01
PublicationDateYYYYMMDD 2012-01-01
PublicationDate_xml – month: 01
  year: 2012
  text: 2012-01-01
  day: 01
PublicationDecade 2010
PublicationSeriesTitle DMTCS Proceedings
PublicationTitle Discrete mathematics and theoretical computer science
PublicationYear 2012
Publisher DMTCS
Discrete Mathematics and Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science
Publisher_xml – name: Discrete Mathematics and Theoretical Computer Science
– name: DMTCS
– name: Discrete Mathematics & Theoretical Computer Science
SSID ssj0012947
ssib044734695
Score 1.8250667
Snippet In the paper "How to select a looser'' Prodinger was analyzing an algorithm where $n$ participants are selecting a leader by flipping fair coins, where...
SourceID doaj
hal
crossref
SourceType Open Website
Open Access Repository
Index Database
StartPage 377
SubjectTerms [info.info-cg] computer science [cs]/computational geometry [cs.cg]
[info.info-dm] computer science [cs]/discrete mathematics [cs.dm]
[info.info-ds] computer science [cs]/data structures and algorithms [cs.ds]
[math.math-co] mathematics [math]/combinatorics [math.co]
Combinatorics
Computational Geometry
Computer Science
Data Structures and Algorithms
Discrete Mathematics
leader election
Mathematics
trie
Title On Greedy Trie Execution
URI https://inria.hal.science/hal-01197231
https://doaj.org/article/aefea3b0cc034a94832d7dc720a5e9bb
Volume DMTCS Proceedings vol. AQ,...
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAON
  databaseName: DOAJ (Directory of Open Access Journals)
  customDbUrl:
  eissn: 1365-8050
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0012947
  issn: 1365-8050
  databaseCode: DOA
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: https://www.doaj.org/
  providerName: Directory of Open Access Journals
– providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 1365-8050
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssib044734695
  issn: 1365-8050
  databaseCode: M~E
  dateStart: 19980101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
– providerCode: PRVPQU
  databaseName: Continental Europe Database
  customDbUrl:
  eissn: 1365-8050
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0012947
  issn: 1365-8050
  databaseCode: BFMQW
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/conteurope
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Engineering Database
  customDbUrl:
  eissn: 1365-8050
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0012947
  issn: 1365-8050
  databaseCode: M7S
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl:
  eissn: 1365-8050
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0012947
  issn: 1365-8050
  databaseCode: BENPR
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Publicly Available Content Database
  customDbUrl:
  eissn: 1365-8050
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0012947
  issn: 1365-8050
  databaseCode: PIMPY
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/publiccontent
  providerName: ProQuest
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV07T8MwED6hwgADjwJqeVQR6hpI7Li2x4JaFYmWDiCVKfIrgoGC2lLBwm_n7KQIJhaGRJEVJfF3d747x74PoM2soZZZF-tU6DhzNMErJmIMFqwVxnGdFIFsgo9GYjKR4x9UX35NWFkeuATuQrnCKaoTYxKaKZmhBlpuDSeJYk5q7UdfjHpWyVT1_4DIjJe78bIOkeLCPi_M_JwmnjX2h_8JZfrRqzyuZlGDV-nvwnYVDkbd8jP2YM1N67CzolqIKsurw9bwu7zqfB8at9PIL5ixH9EdprpR792ZoEAHcN_v3V0N4oriIDYpp2jehBPNZEoLbUTRESph2ibWZdJSBNES6_2rVqwgOKg6XhDEHEOccDBu6CHUpi9T14CIKMmEMEVWKJoZ0dFSEYLmJVOmtaZpE9qrjuevZSWLHDOAgE8e8Mk9Pk249KB83-LLT4cGFEpeCSX_SyhNOENIfz1j0L3JfVtFdJYu06P_eNMxbGIIQ8pJkROoLWZv7hQ2zHLxNJ-1glLgefjZa8H6-Ho4fvgCm5rAHw
linkProvider Directory of Open Access Journals
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=proceeding&rft.title=Discrete+mathematics+and+theoretical+computer+science&rft.atitle=On+Greedy+Trie+Execution&rft.au=Go%C5%82%C4%99biewski%2C+Zbigniew&rft.au=Zag%C3%B3rski%2C+Filip&rft.series=DMTCS+Proceedings&rft.date=2012-01-01&rft.pub=DMTCS&rft.issn=1462-7264&rft.eissn=1365-8050&rft.volume=DMTCS+Proceedings+vol.+AQ%2C+23rd+Intern.+Meeting+on+Probabilistic%2C+Combinatorial%2C+and+Asymptotic+Methods+for+the+Analysis+of+Algorithms+%28AofA%2712%29&rft.spage=377&rft.epage=380&rft_id=info:doi/10.46298%2Fdmtcs.3007&rft.externalDBID=HAS_PDF_LINK&rft.externalDocID=oai%3AHAL%3Ahal-01197231v1
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1365-8050&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1365-8050&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1365-8050&client=summon