A further study on weak Byzantine gathering of mobile agents
The gathering of mobile agents in the presence of Byzantine faults is first studied by Dieudonné et al. Authors provide a polynomial time algorithm handling any number of weak Byzantine agents in the presence of at least one good agent considering start-up delays, i.e., the good agents may not wake...
Saved in:
| Published in: | Theoretical computer science Vol. 1022; p. 114892 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Elsevier B.V
29.12.2024
|
| Subjects: | |
| ISSN: | 0304-3975 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | The gathering of mobile agents in the presence of Byzantine faults is first studied by Dieudonné et al. Authors provide a polynomial time algorithm handling any number of weak Byzantine agents in the presence of at least one good agent considering start-up delays, i.e., the good agents may not wake up at the same time. Hirose et al. [1] come up with an algorithm considering start-up delays that use a strong team of at least 4f2+8f+4 many good agents but runs much faster than that of Dieudonné et al. Later, Hirose et al. [2] provided another polynomial time algorithm for gathering in the presence of at least 7f+7 good agents. This algorithm works considering start-up delay and achieves simultaneous termination. However, this algorithm depends on the length of the largest ID in the system. We, in this work, provide an algorithm considering start-up delays of the good agents, reducing the number of good agents w.r.t. [1] to f2+4f+9, and good agents achieve simultaneous termination. Our algorithm runs faster than [2] when the ID range of the good agents is significantly smaller in comparison to the ID range of all the agents. We also provide a much faster O(n2) time algorithm for trees using 3f+2 agents handling start-up delays and guaranteeing simultaneous termination on a restricted ID range. |
|---|---|
| AbstractList | The gathering of mobile agents in the presence of Byzantine faults is first studied by Dieudonné et al. Authors provide a polynomial time algorithm handling any number of weak Byzantine agents in the presence of at least one good agent considering start-up delays, i.e., the good agents may not wake up at the same time. Hirose et al. [1] come up with an algorithm considering start-up delays that use a strong team of at least 4f2+8f+4 many good agents but runs much faster than that of Dieudonné et al. Later, Hirose et al. [2] provided another polynomial time algorithm for gathering in the presence of at least 7f+7 good agents. This algorithm works considering start-up delay and achieves simultaneous termination. However, this algorithm depends on the length of the largest ID in the system. We, in this work, provide an algorithm considering start-up delays of the good agents, reducing the number of good agents w.r.t. [1] to f2+4f+9, and good agents achieve simultaneous termination. Our algorithm runs faster than [2] when the ID range of the good agents is significantly smaller in comparison to the ID range of all the agents. We also provide a much faster O(n2) time algorithm for trees using 3f+2 agents handling start-up delays and guaranteeing simultaneous termination on a restricted ID range. |
| ArticleNumber | 114892 |
| Author | Saxena, Ashish Mondal, Kaushik |
| Author_xml | – sequence: 1 givenname: Ashish surname: Saxena fullname: Saxena, Ashish – sequence: 2 givenname: Kaushik surname: Mondal fullname: Mondal, Kaushik email: kaushik.mondal@iitrpr.ac.in |
| BookMark | eNp9j7tOAzEQRV0EiSTwAXT-gV38SjYraELES4pEA7Xlx0xwSLzIdkDh69loqZkpphidq3smZBS7CIRccVZzxufX27q4XAsmVM25WrRiRMZMMlXJtpmdk0nOW9bPrJmPye2S4iGVd0g0l4M_0i7SbzAf9O74Y2IJEejGnN4hbmiHdN_ZsANqNhBLviBnaHYZLv_ulLw93L-unqr1y-PzarmunFBtqUzjsBFWSanQ8YXlXIi5FbbxDnm_6MC2hqNk6BD9jFuLYLxwsjHKL6ScEj7kutTlnAD1Zwp7k46aM31S1lvdK-uTsh6Ue-ZmYKAv9hUg6ewCRAc-JHBF-y78Q_8C0Q9kEg |
| Cites_doi | 10.1016/j.tcs.2008.02.010 10.1145/2601068 10.1145/2629656 10.1057/jors.1992.89 10.1145/1391289.1391291 10.1002/net.21453 10.1137/S036301299427816X 10.1007/s00446-022-00419-9 10.1016/j.tcs.2005.12.016 10.1145/2344422.2344427 10.1287/opre.49.1.107.11191 10.1137/S0097539704446475 10.1002/cpe.8055 10.1002/net.21810 10.1587/transinf.2017FCP0008 10.1007/s00446-016-0276-9 10.1007/s00453-006-0074-2 10.1016/j.tcs.2005.01.001 10.2307/3214827 10.1002/nav.1044 10.1137/S0363012996314130 |
| ContentType | Journal Article |
| Copyright | 2024 Elsevier B.V. |
| Copyright_xml | – notice: 2024 Elsevier B.V. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.tcs.2024.114892 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics Computer Science |
| ExternalDocumentID | 10_1016_j_tcs_2024_114892 S0304397524005097 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 0SF 123 1B1 1RT 1~. 1~5 4.4 457 4G. 5VS 7-5 71M 8P~ 9JN AABNK AACTN AAEDW AAFTH AAIKJ AAKOC AALRI AAOAW AAQFI AAXKI AAXUO AAYFN ABAOU ABBOA ABJNI ABMAC ABVKL ACDAQ ACGFS ACRLP ACZNC ADBBV ADEZE AEBSH AEKER AENEX AFJKZ AFKWA AFTJW AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIKHN AITUG AJOXV AKRWK ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ARUGR AXJTR BKOJK BLXMC CS3 DU5 EBS EFJIC EO8 EO9 EP2 EP3 F5P FDB FEDTE FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HVGLF IHE IXB J1W KOM LG9 M26 M41 MHUIS MO0 N9A O-L O9- OAUVE OK1 OZT P-8 P-9 P2P PC. Q38 ROL RPZ SCC SDF SDG SES SEW SPC SPCBC SSV SSW T5K TN5 WH7 YNT ZMT ~G- 29Q 9DU AAEDT AAQXK AATTM AAYWO AAYXX ABDPE ABEFU ABFNM ABWVN ABXDB ACLOT ACNNM ACRPL ACVFH ADCNI ADMUD ADNMO ADVLN AEIPS AEUPX AEXQZ AFPUW AGHFR AGQPQ AIGII AIIUN AKBMS AKYEP ANKPU APXCP ASPBG AVWKF AZFZN CITATION EFKBS EFLBG EJD FGOYB G-2 HZ~ R2- SSZ TAE WUQ ZY4 ~HD |
| ID | FETCH-LOGICAL-c249t-a7cf72b4334fc18b11226b2b7dcf1f1ffceb9a1f30fcffd51bbfead2c37a4d833 |
| ISICitedReferencesCount | 0 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001330826400001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0304-3975 |
| IngestDate | Sat Nov 29 05:49:22 EST 2025 Wed Dec 04 16:47:53 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Byzantine faults Gathering Deterministic algorithm Anonymous graphs Mobile agents |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c249t-a7cf72b4334fc18b11226b2b7dcf1f1ffceb9a1f30fcffd51bbfead2c37a4d833 |
| ParticipantIDs | crossref_primary_10_1016_j_tcs_2024_114892 elsevier_sciencedirect_doi_10_1016_j_tcs_2024_114892 |
| PublicationCentury | 2000 |
| PublicationDate | 2024-12-29 |
| PublicationDateYYYYMMDD | 2024-12-29 |
| PublicationDate_xml | – month: 12 year: 2024 text: 2024-12-29 day: 29 |
| PublicationDecade | 2020 |
| PublicationTitle | Theoretical computer science |
| PublicationYear | 2024 |
| Publisher | Elsevier B.V |
| Publisher_xml | – sequence: 0 name: Elsevier B.V |
| References | Czyzowicz, Pelc, Labourel (br0220) 2012; 8 Dessmark, Fraigniaud, Kowalski, Pelc (br0030) 2006; 46 Flocchini, Prencipe, Santoro, Widmayer (br0190) 2005; 337 Bouchard, Dieudonné, Lamani (br0260) 2022; 35 Kowalski, Malinowski (br0040) 2008; 399 Tsuchida, Ooshita, Inoue (br0290) 2019 Hirose, Nakamura, Ooshita, Inoue (br0020) 2024; 36 Thomas (br0170) 1992; 43 Hirose, Nakamura, Ooshita, Inoue (br0010) 2021 Baston (br0240) 2001; 48 Bouchard, Dieudonné, Ducourthial (br0250) 2016; 29 Pelc (br0110) 2018; 72 Israeli, Jalfon (br0150) 1990 Miller, Saha (br0270) 2020 Dieudonné, Pelc, Peleg (br0070) 2014; 11 Lim, Alpern (br0160) 1996; 34 Anderson, Fekete (br0080) 1998 Marco, Gargano, Kranakis, Krizanc, Pelc, Vaccaro (br0230) 2006; 355 Reingold (br0300) 2008; 55 Alpern, Gal (br0130) 2003; vol. 55 Ta-Shma, Zwick (br0050) 2014; 10 Anderson (br0090) 2001; 49 Anderson (br0060) 1990; 28 Schelling (br0120) 1960; vol. 55 Pelc (br0100) 2012; 59 Baston (br0140) 1998; 36 Cieliebak, Flocchini, Prencipe, Santoro (br0200) 2003 Tsuchida, Ooshita, Inoue (br0280) 2018; E101.D Cohen, Peleg (br0180) 2005; 34 Pelc (10.1016/j.tcs.2024.114892_br0100) 2012; 59 Baston (10.1016/j.tcs.2024.114892_br0240) 2001; 48 Schelling (10.1016/j.tcs.2024.114892_br0120) 1960; vol. 55 Alpern (10.1016/j.tcs.2024.114892_br0130) 2003; vol. 55 Dessmark (10.1016/j.tcs.2024.114892_br0030) 2006; 46 Anderson (10.1016/j.tcs.2024.114892_br0090) 2001; 49 Reingold (10.1016/j.tcs.2024.114892_br0300) 2008; 55 Cieliebak (10.1016/j.tcs.2024.114892_br0200) 2003 Israeli (10.1016/j.tcs.2024.114892_br0150) 1990 Hirose (10.1016/j.tcs.2024.114892_br0010) 2021 Kowalski (10.1016/j.tcs.2024.114892_br0040) 2008; 399 Hirose (10.1016/j.tcs.2024.114892_br0020) 2024; 36 Pelc (10.1016/j.tcs.2024.114892_br0110) 2018; 72 Marco (10.1016/j.tcs.2024.114892_br0230) 2006; 355 Czyzowicz (10.1016/j.tcs.2024.114892_br0220) 2012; 8 Tsuchida (10.1016/j.tcs.2024.114892_br0280) 2018; E101.D Ta-Shma (10.1016/j.tcs.2024.114892_br0050) 2014; 10 Lim (10.1016/j.tcs.2024.114892_br0160) 1996; 34 Thomas (10.1016/j.tcs.2024.114892_br0170) 1992; 43 Bouchard (10.1016/j.tcs.2024.114892_br0260) 2022; 35 Dieudonné (10.1016/j.tcs.2024.114892_br0070) 2014; 11 Cohen (10.1016/j.tcs.2024.114892_br0180) 2005; 34 Flocchini (10.1016/j.tcs.2024.114892_br0190) 2005; 337 Miller (10.1016/j.tcs.2024.114892_br0270) 2020 Tsuchida (10.1016/j.tcs.2024.114892_br0290) 2019 Anderson (10.1016/j.tcs.2024.114892_br0060) 1990; 28 Bouchard (10.1016/j.tcs.2024.114892_br0250) 2016; 29 Anderson (10.1016/j.tcs.2024.114892_br0080) 1998 Baston (10.1016/j.tcs.2024.114892_br0140) 1998; 36 |
| References_xml | – start-page: 140 year: 2020 end-page: 153 ident: br0270 article-title: Fast byzantine gathering with visibility in graphs publication-title: Algorithms for Sensor Systems – volume: 72 start-page: 182 year: 2018 end-page: 199 ident: br0110 article-title: Deterministic gathering with crash faults publication-title: Networks – volume: 337 start-page: 147 year: 2005 end-page: 168 ident: br0190 article-title: Gathering of asynchronous robots with limited visibility publication-title: Theor. Comput. Sci. – start-page: 85 year: 2019 end-page: 99 ident: br0290 article-title: Gathering of mobile agents in asynchronous byzantine environments with authenticated whiteboards publication-title: Networked Systems – volume: 399 start-page: 141 year: 2008 end-page: 156 ident: br0040 article-title: How to meet in anonymous network publication-title: Theor. Comput. Sci. – volume: vol. 55 year: 2003 ident: br0130 article-title: The Theory of Search Games and Rendezvous publication-title: International Series in Operations Research and Management Science – volume: 28 start-page: 839 year: 1990 end-page: 851 ident: br0060 article-title: The rendezvous problem on discrete locations publication-title: J. Appl. Probab. – volume: E101.D start-page: 602 year: 2018 end-page: 610 ident: br0280 article-title: Byzantine-tolerant gathering of mobile agents in arbitrary networks with authenticated whiteboards publication-title: IEICE Trans. Inf. Syst. – start-page: 26 year: 2021 end-page: 35 ident: br0010 article-title: Gathering with a strong team in weakly byzantine environments publication-title: Proceedings of the 22nd International Conference on Distributed Computing and Networking – volume: 355 start-page: 315 year: 2006 end-page: 326 ident: br0230 article-title: Asynchronous deterministic rendezvous in graphs publication-title: Theor. Comput. Sci. – volume: 59 start-page: 331 year: 2012 end-page: 347 ident: br0100 article-title: Deterministic rendezvous in networks: a comprehensive survey publication-title: Networks – volume: 29 start-page: 435 year: 2016 end-page: 457 ident: br0250 article-title: Byzantine gathering in networks publication-title: Distrib. Comput. – start-page: 365 year: 1998 end-page: 373 ident: br0080 article-title: Asymmetric rendezvous on the plane publication-title: Proceedings of the Fourteenth Annual Symposium on Computational Geometry – volume: 49 start-page: 107 year: 2001 end-page: 118 ident: br0090 article-title: Two dimensional rendezvous search publication-title: Oper. Res. – volume: 46 start-page: 69 year: 2006 end-page: 96 ident: br0030 article-title: Deterministic rendezvous in graphs publication-title: Algorithmica – start-page: 119 year: 1990 end-page: 131 ident: br0150 article-title: Token management schemes and random walks yield self-stabilizing mutual exclusion publication-title: Proceedings of the Ninth Annual ACM Symposium on Principles of Distributed Computing – volume: 34 start-page: 1650 year: 1996 end-page: 1665 ident: br0160 article-title: Minimax rendezvous on the line publication-title: SIAM J. Control Optim. – volume: 10 year: 2014 ident: br0050 article-title: Deterministic rendezvous, treasure hunts, and strongly universal exploration sequences publication-title: ACM Trans. Algorithms – volume: 55 start-page: 17:1 year: 2008 end-page: 17:24 ident: br0300 article-title: Undirected connectivity in log-space publication-title: J. ACM – volume: 48 start-page: 722 year: 2001 end-page: 731 ident: br0240 article-title: Rendezvous search when marks are left at the starting points publication-title: Nav. Res. Logist. – volume: 35 start-page: 235 year: 2022 end-page: 263 ident: br0260 article-title: Byzantine gathering in polynomial time publication-title: Distrib. Comput. – volume: 8 start-page: 37:1 year: 2012 end-page: 37:14 ident: br0220 article-title: How to meet asynchronously (almost) everywhere publication-title: ACM Trans. Algorithms – volume: 36 start-page: 1880 year: 1998 end-page: 1889 ident: br0140 article-title: Rendezvous on the line when the players' initial distance is given by an unknown probability distribution publication-title: SIAM J. Control Optim. – volume: 36 year: 2024 ident: br0020 article-title: Fast gathering despite a linear number of weakly byzantine agents publication-title: Concurr. Comput., Pract. Exp. – volume: 11 year: 2014 ident: br0070 article-title: Gathering despite mischief publication-title: ACM Trans. Algorithms – volume: vol. 55 year: 1960 ident: br0120 article-title: The Strategy of Conflict – start-page: 1181 year: 2003 end-page: 1196 ident: br0200 article-title: Solving the robots gathering problem publication-title: Automata, Languages and Programming – volume: 43 start-page: 637 year: 1992 end-page: 639 ident: br0170 article-title: Finding your kids when they are lost publication-title: J. Oper. Res. Soc. – volume: 34 start-page: 1516 year: 2005 end-page: 1528 ident: br0180 article-title: Convergence properties of the gravitational algorithm in asynchronous robot systems publication-title: SIAM J. Comput. – start-page: 140 year: 2020 ident: 10.1016/j.tcs.2024.114892_br0270 article-title: Fast byzantine gathering with visibility in graphs – volume: 399 start-page: 141 issue: 1 year: 2008 ident: 10.1016/j.tcs.2024.114892_br0040 article-title: How to meet in anonymous network publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2008.02.010 – start-page: 26 year: 2021 ident: 10.1016/j.tcs.2024.114892_br0010 article-title: Gathering with a strong team in weakly byzantine environments – volume: 10 year: 2014 ident: 10.1016/j.tcs.2024.114892_br0050 article-title: Deterministic rendezvous, treasure hunts, and strongly universal exploration sequences publication-title: ACM Trans. Algorithms doi: 10.1145/2601068 – volume: 11 year: 2014 ident: 10.1016/j.tcs.2024.114892_br0070 article-title: Gathering despite mischief publication-title: ACM Trans. Algorithms doi: 10.1145/2629656 – volume: 43 start-page: 637 year: 1992 ident: 10.1016/j.tcs.2024.114892_br0170 article-title: Finding your kids when they are lost publication-title: J. Oper. Res. Soc. doi: 10.1057/jors.1992.89 – volume: 55 start-page: 17:1 issue: 4 year: 2008 ident: 10.1016/j.tcs.2024.114892_br0300 article-title: Undirected connectivity in log-space publication-title: J. ACM doi: 10.1145/1391289.1391291 – volume: 59 start-page: 331 issue: 3 year: 2012 ident: 10.1016/j.tcs.2024.114892_br0100 article-title: Deterministic rendezvous in networks: a comprehensive survey publication-title: Networks doi: 10.1002/net.21453 – volume: 34 start-page: 1650 year: 1996 ident: 10.1016/j.tcs.2024.114892_br0160 article-title: Minimax rendezvous on the line publication-title: SIAM J. Control Optim. doi: 10.1137/S036301299427816X – volume: 35 start-page: 235 year: 2022 ident: 10.1016/j.tcs.2024.114892_br0260 article-title: Byzantine gathering in polynomial time publication-title: Distrib. Comput. doi: 10.1007/s00446-022-00419-9 – start-page: 85 year: 2019 ident: 10.1016/j.tcs.2024.114892_br0290 article-title: Gathering of mobile agents in asynchronous byzantine environments with authenticated whiteboards – volume: 355 start-page: 315 issue: 3 year: 2006 ident: 10.1016/j.tcs.2024.114892_br0230 article-title: Asynchronous deterministic rendezvous in graphs publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2005.12.016 – volume: 8 start-page: 37:1 issue: 4 year: 2012 ident: 10.1016/j.tcs.2024.114892_br0220 article-title: How to meet asynchronously (almost) everywhere publication-title: ACM Trans. Algorithms doi: 10.1145/2344422.2344427 – volume: 49 start-page: 107 year: 2001 ident: 10.1016/j.tcs.2024.114892_br0090 article-title: Two dimensional rendezvous search publication-title: Oper. Res. doi: 10.1287/opre.49.1.107.11191 – volume: 34 start-page: 1516 issue: 6 year: 2005 ident: 10.1016/j.tcs.2024.114892_br0180 article-title: Convergence properties of the gravitational algorithm in asynchronous robot systems publication-title: SIAM J. Comput. doi: 10.1137/S0097539704446475 – volume: 36 issue: 14 year: 2024 ident: 10.1016/j.tcs.2024.114892_br0020 article-title: Fast gathering despite a linear number of weakly byzantine agents† publication-title: Concurr. Comput., Pract. Exp. doi: 10.1002/cpe.8055 – volume: vol. 55 year: 1960 ident: 10.1016/j.tcs.2024.114892_br0120 – volume: 72 start-page: 182 issue: 2 year: 2018 ident: 10.1016/j.tcs.2024.114892_br0110 article-title: Deterministic gathering with crash faults publication-title: Networks doi: 10.1002/net.21810 – start-page: 365 year: 1998 ident: 10.1016/j.tcs.2024.114892_br0080 article-title: Asymmetric rendezvous on the plane – start-page: 1181 year: 2003 ident: 10.1016/j.tcs.2024.114892_br0200 article-title: Solving the robots gathering problem – volume: E101.D start-page: 602 issue: 3 year: 2018 ident: 10.1016/j.tcs.2024.114892_br0280 article-title: Byzantine-tolerant gathering of mobile agents in arbitrary networks with authenticated whiteboards publication-title: IEICE Trans. Inf. Syst. doi: 10.1587/transinf.2017FCP0008 – volume: vol. 55 year: 2003 ident: 10.1016/j.tcs.2024.114892_br0130 article-title: The Theory of Search Games and Rendezvous – volume: 29 start-page: 435 year: 2016 ident: 10.1016/j.tcs.2024.114892_br0250 article-title: Byzantine gathering in networks publication-title: Distrib. Comput. doi: 10.1007/s00446-016-0276-9 – start-page: 119 year: 1990 ident: 10.1016/j.tcs.2024.114892_br0150 article-title: Token management schemes and random walks yield self-stabilizing mutual exclusion – volume: 46 start-page: 69 issue: 1 year: 2006 ident: 10.1016/j.tcs.2024.114892_br0030 article-title: Deterministic rendezvous in graphs publication-title: Algorithmica doi: 10.1007/s00453-006-0074-2 – volume: 337 start-page: 147 issue: 1 year: 2005 ident: 10.1016/j.tcs.2024.114892_br0190 article-title: Gathering of asynchronous robots with limited visibility publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2005.01.001 – volume: 28 start-page: 839 year: 1990 ident: 10.1016/j.tcs.2024.114892_br0060 article-title: The rendezvous problem on discrete locations publication-title: J. Appl. Probab. doi: 10.2307/3214827 – volume: 48 start-page: 722 year: 2001 ident: 10.1016/j.tcs.2024.114892_br0240 article-title: Rendezvous search when marks are left at the starting points publication-title: Nav. Res. Logist. doi: 10.1002/nav.1044 – volume: 36 start-page: 1880 year: 1998 ident: 10.1016/j.tcs.2024.114892_br0140 article-title: Rendezvous on the line when the players' initial distance is given by an unknown probability distribution publication-title: SIAM J. Control Optim. doi: 10.1137/S0363012996314130 |
| SSID | ssj0000576 |
| Score | 2.4313986 |
| Snippet | The gathering of mobile agents in the presence of Byzantine faults is first studied by Dieudonné et al. Authors provide a polynomial time algorithm handling... |
| SourceID | crossref elsevier |
| SourceType | Index Database Publisher |
| StartPage | 114892 |
| SubjectTerms | Anonymous graphs Byzantine faults Deterministic algorithm Gathering Mobile agents |
| Title | A further study on weak Byzantine gathering of mobile agents |
| URI | https://dx.doi.org/10.1016/j.tcs.2024.114892 |
| Volume | 1022 |
| WOSCitedRecordID | wos001330826400001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: ScienceDirect Freedom Collection - Elsevier issn: 0304-3975 databaseCode: AIEXJ dateStart: 20211207 customDbUrl: isFulltext: true dateEnd: 99991231 titleUrlDefault: https://www.sciencedirect.com omitProxy: false ssIdentifier: ssj0000576 providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1LT-MwELZ4HeCwy1MUFuQDJ6Ig4iRNLHHJrkALAsShoN4i27F5ibRqUujy6xnHTlpgkeCAKkVVkjqRP3c8M_Z8H0I77ZhJn9DQDYin3ICLtkv1H095WRjTIPRVJQZzdRqdn8fdLr2wIohFJScQ5Xk8GtH-t0IN5wBsXTr7BbibRuEEfAfQ4Qiww_FTwCeOGg7KiqXZEEbnzpNk987vf89My0JI59pW_VXbnR96HAyDw65rUqfaVe1MlDgKq_3g2AmzycuwkTRFZUlxc1s0qWWwFBkzdT9sCFfuJ5MLpKIwtBkIW1SlF06oETdpDOa-KSW2Nk9HVEbP7p05NpmBu71SaGZ0EuyN731Nff1mSmo2CtZ70O5SaCLVTaSmiWk0S6KQgh2bTY4Puyfj2TeMzPq0ffF6Jbva0_fmPf7vi0z4F51F9MMGBjgxgC6hKZkvo5-16Aa2NngZLZw1RLvFCjpIsEUbV2jjXo412rhBGzdo457CBm1s0F5Fl0eHnT9_XSuI4QqIkkuXaQ4pwgPfD5TwYg6-MmlzwqNMKA8-SkhOmaf8fSWUykKPcwWWggg_YkEW-_4amsl7uVxHGPoDAstQME3IJnjGPAmRi1YyoxkTmWih3bpr0r7hPUk_BKOFgrrzUjsOjUOWwkD4-GcbX3nGJpofD9BfaKYcDOUWmhOP5W0x2Laj4AUA6GMz |
| linkProvider | Elsevier |
| 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=article&rft.atitle=A+further+study+on+weak+Byzantine+gathering+of+mobile+agents&rft.jtitle=Theoretical+computer+science&rft.au=Saxena%2C+Ashish&rft.au=Mondal%2C+Kaushik&rft.date=2024-12-29&rft.issn=0304-3975&rft.volume=1022&rft.spage=114892&rft_id=info:doi/10.1016%2Fj.tcs.2024.114892&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_tcs_2024_114892 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0304-3975&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0304-3975&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0304-3975&client=summon |