Bhateja, Puneet Determining asynchronous test equivalence for probabilistic processes. (English) Zbl 07537428 Inf. Process. Lett. 177, Article ID 106269, 8 p. (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{P. Bhateja}, Inf. Process. Lett. 177, Article ID 106269, 8 p. (2022; Zbl 07537428) Full Text: DOI
Castiglioni, Valentina; Tini, Simone Raiders of the lost equivalence: probabilistic branching bisimilarity. (English) Zbl 1441.68145 Inf. Process. Lett. 159-160, Article ID 105947, 9 p. (2020). MSC: 68Q85 68Q87 PDFBibTeX XMLCite \textit{V. Castiglioni} and \textit{S. Tini}, Inf. Process. Lett. 159--160, Article ID 105947, 9 p. (2020; Zbl 1441.68145) Full Text: DOI
Fernández-Campusano, Christian; Larrea, Mikel; Cortiñas, Roberto; Raynal, Michel A distributed leader election algorithm in crash-recovery and omissive systems. (English) Zbl 1392.68440 Inf. Process. Lett. 118, 100-104 (2017). MSC: 68W15 68M14 68M15 PDFBibTeX XMLCite \textit{C. Fernández-Campusano} et al., Inf. Process. Lett. 118, 100--104 (2017; Zbl 1392.68440) Full Text: DOI
Bouzid, Zohir; Imbs, Damien; Raynal, Michel A necessary condition for Byzantine \(k\)-set agreement. (English) Zbl 1371.68032 Inf. Process. Lett. 116, No. 12, 757-759 (2016). MSC: 68M14 PDFBibTeX XMLCite \textit{Z. Bouzid} et al., Inf. Process. Lett. 116, No. 12, 757--759 (2016; Zbl 1371.68032) Full Text: DOI arXiv
Tseng, Lewis; Vaidya, Nitin; Bhandari, Vartika Broadcast using certified propagation algorithm in presence of Byzantine faults. (English) Zbl 1312.68024 Inf. Process. Lett. 115, No. 4, 512-514 (2015). MSC: 68M14 68M10 68M15 PDFBibTeX XMLCite \textit{L. Tseng} et al., Inf. Process. Lett. 115, No. 4, 512--514 (2015; Zbl 1312.68024) Full Text: DOI arXiv
Agrawal, Shashank Verifiable secret sharing in a total of three rounds. (English) Zbl 1250.94053 Inf. Process. Lett. 112, No. 22, 856-859 (2012). MSC: 94A62 94A60 PDFBibTeX XMLCite \textit{S. Agrawal}, Inf. Process. Lett. 112, No. 22, 856--859 (2012; Zbl 1250.94053) Full Text: DOI
Dubslaff, Clemens; Baier, Christel; Berg, Manuela Model checking probabilistic systems against pushdown specifications. (English) Zbl 1243.68214 Inf. Process. Lett. 112, No. 8-9, 320-328 (2012). MSC: 68Q60 68Q87 68Q45 PDFBibTeX XMLCite \textit{C. Dubslaff} et al., Inf. Process. Lett. 112, No. 8--9, 320--328 (2012; Zbl 1243.68214) Full Text: DOI
Dolev, Shlomi; Dubois, Swan; Potop-Butucaru, Maria; Tixeuil, Sébastien Stabilizing data-link over non-FIFO channels with optimal fault-resilience. (English) Zbl 1260.68451 Inf. Process. Lett. 111, No. 18, 912-920 (2011). MSC: 68W15 68M15 94A40 PDFBibTeX XMLCite \textit{S. Dolev} et al., Inf. Process. Lett. 111, No. 18, 912--920 (2011; Zbl 1260.68451) Full Text: DOI arXiv
Bakhshi, Rena; Endrullis, Jörg; Fokkink, Wan; Pang, Jun Fast leader election in anonymous rings with bounded expected delay. (English) Zbl 1260.68029 Inf. Process. Lett. 111, No. 17, 864-870 (2011). MSC: 68M14 68M10 68W40 PDFBibTeX XMLCite \textit{R. Bakhshi} et al., Inf. Process. Lett. 111, No. 17, 864--870 (2011; Zbl 1260.68029) Full Text: DOI
Soraluze, Iratxe; Cortiñas, Roberto; Lafuente, Alberto; Larrea, Mikel; Freiling, Felix Communication-efficient failure detection and consensus in omission environments. (English) Zbl 1260.68025 Inf. Process. Lett. 111, No. 6, 262-268 (2011). MSC: 68M10 68M14 68M15 PDFBibTeX XMLCite \textit{I. Soraluze} et al., Inf. Process. Lett. 111, No. 6, 262--268 (2011; Zbl 1260.68025) Full Text: DOI
Aravind, Alex A. Highly-fair bakery algorithm using symmetric tokens. (English) Zbl 1379.68244 Inf. Process. Lett. 110, No. 23, 1055-1060 (2010). MSC: 68Q85 68W15 PDFBibTeX XMLCite \textit{A. A. Aravind}, Inf. Process. Lett. 110, No. 23, 1055--1060 (2010; Zbl 1379.68244) Full Text: DOI
Charron-Bost, Bernadette; Hutle, Martin; Widder, Josef In search of lost time. (English) Zbl 1379.68022 Inf. Process. Lett. 110, No. 21, 928-933 (2010). MSC: 68M14 68M15 PDFBibTeX XMLCite \textit{B. Charron-Bost} et al., Inf. Process. Lett. 110, No. 21, 928--933 (2010; Zbl 1379.68022) Full Text: DOI
Clement, Julien; Défago, Xavier; Potop-Butucaru, Maria Gradinariu; Izumi, Taisuke; Messika, Stephane The cost of probabilistic agreement in oblivious robot networks. (English) Zbl 1229.68006 Inf. Process. Lett. 110, No. 11, 431-438 (2010). MSC: 68M14 68W20 68W40 68W15 PDFBibTeX XMLCite \textit{J. Clement} et al., Inf. Process. Lett. 110, No. 11, 431--438 (2010; Zbl 1229.68006) Full Text: DOI
Bonnet, François; Raynal, Michel A simple proof of the necessity of the failure detector \(\Sigma \) to implement an atomic register in asynchronous message-passing systems. (English) Zbl 1206.68357 Inf. Process. Lett. 110, No. 4, 153-157 (2010). MSC: 68W15 68M15 PDFBibTeX XMLCite \textit{F. Bonnet} and \textit{M. Raynal}, Inf. Process. Lett. 110, No. 4, 153--157 (2010; Zbl 1206.68357) Full Text: DOI
Zhang, Jialin; Chen, Wei Implementing uniform reliable broadcast with binary consensus in systems with fair-lossy links. (English) Zbl 1206.68060 Inf. Process. Lett. 110, No. 1, 13-19 (2009). MSC: 68M15 68M14 PDFBibTeX XMLCite \textit{J. Zhang} and \textit{W. Chen}, Inf. Process. Lett. 110, No. 1, 13--19 (2009; Zbl 1206.68060) Full Text: DOI
Zhang, Jialin; Chen, Wei Bounded cost algorithms for multivalued consensus using binary consensus instances. (English) Zbl 1206.68059 Inf. Process. Lett. 109, No. 17, 1005-1009 (2009). MSC: 68M15 PDFBibTeX XMLCite \textit{J. Zhang} and \textit{W. Chen}, Inf. Process. Lett. 109, No. 17, 1005--1009 (2009; Zbl 1206.68059) Full Text: DOI
Cachin, Christian; Keidar, Idit; Shraer, Alexander Fork sequential consistency is blocking. (English) Zbl 1191.68080 Inf. Process. Lett. 109, No. 7, 360-364 (2009). MSC: 68M14 PDFBibTeX XMLCite \textit{C. Cachin} et al., Inf. Process. Lett. 109, No. 7, 360--364 (2009; Zbl 1191.68080) Full Text: DOI arXiv
Kowalski, Dariusz R.; Strojnowski, Michał Gossiping by processors prone to omission failures. (English) Zbl 1191.68089 Inf. Process. Lett. 109, No. 6, 308-314 (2009). MSC: 68M15 68M14 68W05 PDFBibTeX XMLCite \textit{D. R. Kowalski} and \textit{M. Strojnowski}, Inf. Process. Lett. 109, No. 6, 308--314 (2009; Zbl 1191.68089) Full Text: DOI
Boulinier, Christian; Datta, Ajoy K.; Larmore, Lawrence L.; Petit, Franck Space efficient and time optimal distributed BFS tree construction. (English) Zbl 1191.68847 Inf. Process. Lett. 108, No. 5, 273-278 (2008). MSC: 68W15 PDFBibTeX XMLCite \textit{C. Boulinier} et al., Inf. Process. Lett. 108, No. 5, 273--278 (2008; Zbl 1191.68847) Full Text: DOI
Rajsbaum, Sergio; Raynal, Michel; Travers, Corentin An impossibility about failure detectors in the iterated immediate snapshot model. (English) Zbl 1191.68130 Inf. Process. Lett. 108, No. 3, 160-164 (2008). MSC: 68M99 PDFBibTeX XMLCite \textit{S. Rajsbaum} et al., Inf. Process. Lett. 108, No. 3, 160--164 (2008; Zbl 1191.68130) Full Text: DOI
Engelhardt, Kai; Moses, Yoram Single-bit messages are insufficient for data link over duplicating channels. (English) Zbl 1191.68075 Inf. Process. Lett. 107, No. 6, 235-239 (2008). MSC: 68M12 68M14 PDFBibTeX XMLCite \textit{K. Engelhardt} and \textit{Y. Moses}, Inf. Process. Lett. 107, No. 6, 235--239 (2008; Zbl 1191.68075) Full Text: DOI
Vieira, Gustavo M. D.; Buzato, Luiz E. On the coordinator’s rule for Fast Paxos. (English) Zbl 1186.68047 Inf. Process. Lett. 107, No. 5, 183-187 (2008). MSC: 68M14 68W05 PDFBibTeX XMLCite \textit{G. M. D. Vieira} and \textit{L. E. Buzato}, Inf. Process. Lett. 107, No. 5, 183--187 (2008; Zbl 1186.68047) Full Text: DOI arXiv
Álvarez, A.; Arévalo, S.; Cholvi, V.; Fernández, A.; Jiménez, E. On the interconnection of message passing systems. (English) Zbl 1184.68176 Inf. Process. Lett. 105, No. 6, 249-254 (2008). MSC: 68N99 PDFBibTeX XMLCite \textit{A. Álvarez} et al., Inf. Process. Lett. 105, No. 6, 249--254 (2008; Zbl 1184.68176) Full Text: DOI
Laroussinie, François; Sproston, Jeremy State explosion in almost-sure probabilistic reachability. (English) Zbl 1184.68318 Inf. Process. Lett. 102, No. 6, 236-241 (2007). MSC: 68Q45 68Q60 68Q87 PDFBibTeX XMLCite \textit{F. Laroussinie} and \textit{J. Sproston}, Inf. Process. Lett. 102, No. 6, 236--241 (2007; Zbl 1184.68318) Full Text: DOI
Avoine, Gildas; Vaudenay, Serge How to safely close a discussion. (English) Zbl 1189.94042 Inf. Process. Lett. 102, No. 4, 138-142 (2007). MSC: 94A60 68M12 PDFBibTeX XMLCite \textit{G. Avoine} and \textit{S. Vaudenay}, Inf. Process. Lett. 102, No. 4, 138--142 (2007; Zbl 1189.94042) Full Text: DOI Link
Anceaume, Emmanuelle; Friedman, Roy; Gradinariu, Maria Managed agreement: generalizing two fundamental distributed agreement problems. (English) Zbl 1185.68615 Inf. Process. Lett. 101, No. 5, 190-198 (2007). MSC: 68T15 PDFBibTeX XMLCite \textit{E. Anceaume} et al., Inf. Process. Lett. 101, No. 5, 190--198 (2007; Zbl 1185.68615) Full Text: DOI
Kawabe, Yoshinobu; Mano, Ken; Sakurada, Hideki; Tsukada, Yasuyuki Theorem-proving anonymity of infinite-state systems. (English) Zbl 1185.68627 Inf. Process. Lett. 101, No. 1, 46-51 (2007). MSC: 68T15 PDFBibTeX XMLCite \textit{Y. Kawabe} et al., Inf. Process. Lett. 101, No. 1, 46--51 (2007; Zbl 1185.68627) Full Text: DOI
Izumi, Taisuke; Masuzawa, Toshimitsu A weakly-adaptive condition-based consensus algorithm in asynchronous distributed systems. (English) Zbl 1185.68077 Inf. Process. Lett. 100, No. 5, 199-205 (2006). MSC: 68M14 68M15 PDFBibTeX XMLCite \textit{T. Izumi} and \textit{T. Masuzawa}, Inf. Process. Lett. 100, No. 5, 199--205 (2006; Zbl 1185.68077) Full Text: DOI
Gronemeier, André A note on the decoding complexity of error-correcting codes. (English) Zbl 1189.94057 Inf. Process. Lett. 100, No. 3, 116-119 (2006). MSC: 94B35 94B50 68Q99 PDFBibTeX XMLCite \textit{A. Gronemeier}, Inf. Process. Lett. 100, No. 3, 116--119 (2006; Zbl 1189.94057) Full Text: DOI
Wang, Xianbing; Teo, Yong Meng; Cao, Jiannong A bivalency proof of the lower bound for uniform consensus. (English) Zbl 1184.68110 Inf. Process. Lett. 96, No. 5, 167-174 (2005). MSC: 68M14 PDFBibTeX XMLCite \textit{X. Wang} et al., Inf. Process. Lett. 96, No. 5, 167--174 (2005; Zbl 1184.68110) Full Text: DOI
ter Beek, Maurice H.; Kleijn, Jetty Modularity for teams of I/O automata. (English) Zbl 1185.68382 Inf. Process. Lett. 95, No. 5, 487-495 (2005). MSC: 68Q45 PDFBibTeX XMLCite \textit{M. H. ter Beek} and \textit{J. Kleijn}, Inf. Process. Lett. 95, No. 5, 487--495 (2005; Zbl 1185.68382) Full Text: DOI
Huang, Shing-Tsaan; Hung, Su-Shen; Tzeng, Chi-Hung Self-stabilizing coloration in anonymous planar networks. (English) Zbl 1185.68030 Inf. Process. Lett. 95, No. 1, 307-312 (2005). MSC: 68M10 68R10 05C85 PDFBibTeX XMLCite \textit{S.-T. Huang} et al., Inf. Process. Lett. 95, No. 1, 307--312 (2005; Zbl 1185.68030) Full Text: DOI
Dutta, Partha; Guerraoui, Rachid; Pochon, Bastian Fast non-blocking atomic commit: an inherent trade-off. (English) Zbl 1177.68250 Inf. Process. Lett. 91, No. 4, 195-200 (2004). MSC: 68W15 PDFBibTeX XMLCite \textit{P. Dutta} et al., Inf. Process. Lett. 91, No. 4, 195--200 (2004; Zbl 1177.68250) Full Text: DOI Link
Takamura, Masataka; Altman, Tom; Igarashi, Yoshihide Speedup of Vidyasankar’s algorithm for the group \(k\)-exclusion problem. (English) Zbl 1178.68082 Inf. Process. Lett. 91, No. 2, 85-91 (2004). MSC: 68M14 PDFBibTeX XMLCite \textit{M. Takamura} et al., Inf. Process. Lett. 91, No. 2, 85--91 (2004; Zbl 1178.68082) Full Text: DOI
Friedman, Roy; Mostefaoui, Achour; Raynal, Michel A weakest failure detector-based asynchronous consensus protocol for \(f<n\). (English) Zbl 1178.68075 Inf. Process. Lett. 90, No. 1, 39-46 (2004). MSC: 68M14 68W15 PDFBibTeX XMLCite \textit{R. Friedman} et al., Inf. Process. Lett. 90, No. 1, 39--46 (2004; Zbl 1178.68075) Full Text: DOI
Fredman, Michael L. The number of tests required to search an unordered table. (English) Zbl 1175.68575 Inf. Process. Lett. 87, No. 2, 85-88 (2003). MSC: 68W40 68P05 PDFBibTeX XMLCite \textit{M. L. Fredman}, Inf. Process. Lett. 87, No. 2, 85--88 (2003; Zbl 1175.68575) Full Text: DOI
Keidar, Idit; Rajsbaum, Sergio A simple proof of the uniform consensus synchronous lower bound. (English) Zbl 1042.68010 Inf. Process. Lett. 85, No. 1, 47-52 (2003). MSC: 68M14 PDFBibTeX XMLCite \textit{I. Keidar} and \textit{S. Rajsbaum}, Inf. Process. Lett. 85, No. 1, 47--52 (2003; Zbl 1042.68010) Full Text: DOI
Attie, Paul Wait-free Byzantine consensus. (English) Zbl 1044.68512 Inf. Process. Lett. 83, No. 4, 221-227 (2002). MSC: 68M14 PDFBibTeX XMLCite \textit{P. Attie}, Inf. Process. Lett. 83, No. 4, 221--227 (2002; Zbl 1044.68512) Full Text: DOI
Sasaki, Atsushi A time-optimal distributed sorting algorithm on a line network. (English) Zbl 1043.68026 Inf. Process. Lett. 83, No. 1, 21-26 (2002). MSC: 68M14 68P10 68W15 PDFBibTeX XMLCite \textit{A. Sasaki}, Inf. Process. Lett. 83, No. 1, 21--26 (2002; Zbl 1043.68026) Full Text: DOI
Radhakrishnan, Jaikumar; Raman, Venkatesh A tradeoff between search and update in dictionaries. (English) Zbl 1003.68034 Inf. Process. Lett. 80, No. 5, 243-247 (2001). MSC: 68P10 PDFBibTeX XMLCite \textit{J. Radhakrishnan} and \textit{V. Raman}, Inf. Process. Lett. 80, No. 5, 243--247 (2001; Zbl 1003.68034) Full Text: DOI
Cazorla, D.; Cuartero, F.; Valero, V.; Pelayo, F. L. A process algebra for probabilistic and nondeterministic processes. (English) Zbl 1003.68087 Inf. Process. Lett. 80, No. 1, 15-23 (2001). MSC: 68Q85 68Q60 68Q55 68Q65 PDFBibTeX XMLCite \textit{D. Cazorla} et al., Inf. Process. Lett. 80, No. 1, 15--23 (2001; Zbl 1003.68087) Full Text: DOI
Leal, William; Arora, Anish State-level and value-level simulations in data refinement. (English) Zbl 1003.68076 Inf. Process. Lett. 77, No. 2-4, 159-167 (2001). MSC: 68Q60 68N30 PDFBibTeX XMLCite \textit{W. Leal} and \textit{A. Arora}, Inf. Process. Lett. 77, No. 2--4, 159--167 (2001; Zbl 1003.68076) Full Text: DOI
Barbosa, V. C.; Benevides, M. R. F.; Oliveira Filho, A. L. A priority dynamics for generalized drinking philosophers. (English) Zbl 1032.68010 Inf. Process. Lett. 79, No. 4, 189-195 (2001). MSC: 68M14 68N25 PDFBibTeX XMLCite \textit{V. C. Barbosa} et al., Inf. Process. Lett. 79, No. 4, 189--195 (2001; Zbl 1032.68010) Full Text: DOI
Cholvi, V.; Boronat, P. A minimal property for characterizing deadlock-free programs. (English) Zbl 0996.68034 Inf. Process. Lett. 77, No. 5-6, 283-290 (2001). MSC: 68N19 PDFBibTeX XMLCite \textit{V. Cholvi} and \textit{P. Boronat}, Inf. Process. Lett. 77, No. 5--6, 283--290 (2001; Zbl 0996.68034) Full Text: DOI
Biaz, S.; Welch, J. L. Closed form bounds for clock synchronization under simple uncertainty assumptions. (English) Zbl 1032.68512 Inf. Process. Lett. 80, No. 3, 151-157 (2001). MSC: 68M14 PDFBibTeX XMLCite \textit{S. Biaz} and \textit{J. L. Welch}, Inf. Process. Lett. 80, No. 3, 151--157 (2001; Zbl 1032.68512) Full Text: DOI
Mostefaoui, Achour; Raynal, Michel; Tronel, Frédéric From binary consensus to multivalued consensus in asynchronous message-passing systems. (English) Zbl 1338.68026 Inf. Process. Lett. 73, No. 5-6, 207-212 (2000). MSC: 68M14 68M12 PDFBibTeX XMLCite \textit{A. Mostefaoui} et al., Inf. Process. Lett. 73, No. 5--6, 207--212 (2000; Zbl 1338.68026) Full Text: DOI Link
Raynal, Michel; Tronel, Frédéric Restricted failure detectors: Definition and reduction protocols. (English) Zbl 0999.68019 Inf. Process. Lett. 72, No. 3-4, 91-97 (1999). MSC: 68M14 PDFBibTeX XMLCite \textit{M. Raynal} and \textit{F. Tronel}, Inf. Process. Lett. 72, No. 3--4, 91--97 (1999; Zbl 0999.68019) Full Text: DOI
Dasgupta, Pallab Agreement under faulty interfaces. (English) Zbl 1338.68021 Inf. Process. Lett. 65, No. 3, 125-129 (1998). MSC: 68M14 PDFBibTeX XMLCite \textit{P. Dasgupta}, Inf. Process. Lett. 65, No. 3, 125--129 (1998; Zbl 1338.68021) Full Text: DOI Link
Israeli, Amos; Shirazi, Asaf The time complexity of updating snapshot memories. (English) Zbl 1339.68022 Inf. Process. Lett. 65, No. 1, 33-40 (1998). MSC: 68M14 68M15 68Q25 PDFBibTeX XMLCite \textit{A. Israeli} and \textit{A. Shirazi}, Inf. Process. Lett. 65, No. 1, 33--40 (1998; Zbl 1339.68022) Full Text: DOI Link
Chu, Francis Reducing \(\Omega\) to \(\lozenge\mathcal W\). (English) Zbl 0925.68163 Inf. Process. Lett. 67, No. 6, 289-293 (1998). MSC: 68Q10 68M15 PDFBibTeX XMLCite \textit{F. Chu}, Inf. Process. Lett. 67, No. 6, 289--293 (1998; Zbl 0925.68163) Full Text: DOI
Rhee, Injong; Welch, Jennifer L. Time bounds on synchronization in a periodic distributed system. (English) Zbl 1337.68108 Inf. Process. Lett. 64, No. 2, 87-93 (1997). MSC: 68Q10 PDFBibTeX XMLCite \textit{I. Rhee} and \textit{J. L. Welch}, Inf. Process. Lett. 64, No. 2, 87--93 (1997; Zbl 1337.68108) Full Text: DOI
Afek, Y.; Cohen, M.; Haalman, E. The bit complexity of the predecessor problem. (English) Zbl 1337.68121 Inf. Process. Lett. 63, No. 2, 109-112 (1997). MSC: 68Q25 68Q10 PDFBibTeX XMLCite \textit{Y. Afek} et al., Inf. Process. Lett. 63, No. 2, 109--112 (1997; Zbl 1337.68121) Full Text: DOI
Orda, Ariel; Merritt, Michael Efficient test & set constructions for faulty shared memory. (English) Zbl 1336.68017 Inf. Process. Lett. 62, No. 1, 41-46 (1997). MSC: 68M15 68M14 PDFBibTeX XMLCite \textit{A. Orda} and \textit{M. Merritt}, Inf. Process. Lett. 62, No. 1, 41--46 (1997; Zbl 1336.68017) Full Text: DOI
Romijn, Judi; Vaandrager, Frits A note on fairness in I/O automata. (English) Zbl 0875.68651 Inf. Process. Lett. 59, No. 5, 245-250 (1996). MSC: 68Q45 PDFBibTeX XMLCite \textit{J. Romijn} and \textit{F. Vaandrager}, Inf. Process. Lett. 59, No. 5, 245--250 (1996; Zbl 0875.68651) Full Text: DOI Link
Barbosa, Valmir C.; Porto, Stella C. S. An algorithm for FIFO message delivery among migrating tasks. (English) Zbl 0875.68138 Inf. Process. Lett. 53, No. 5, 261-267 (1995). MSC: 68M99 PDFBibTeX XMLCite \textit{V. C. Barbosa} and \textit{S. C. S. Porto}, Inf. Process. Lett. 53, No. 5, 261--267 (1995; Zbl 0875.68138) Full Text: DOI
Hemaspaandra, Edith Census techniques collapse space classes. (English) Zbl 0942.68570 Inf. Process. Lett. 51, No. 2, 79-84 (1994). MSC: 68Q15 03D15 PDFBibTeX XMLCite \textit{E. Hemaspaandra}, Inf. Process. Lett. 51, No. 2, 79--84 (1994; Zbl 0942.68570) Full Text: DOI
Neiger, Gil Distributed consensus revisited. (English) Zbl 0795.68082 Inf. Process. Lett. 49, No. 4, 195-201 (1994). MSC: 68W15 68M10 PDFBibTeX XMLCite \textit{G. Neiger}, Inf. Process. Lett. 49, No. 4, 195--201 (1994; Zbl 0795.68082) Full Text: DOI
Fischer, Michael J.; Moran, Shlomo; Taubenfeld, Gadi Space-efficient asynchronous consensus without shared memory initialization. (English) Zbl 0795.68007 Inf. Process. Lett. 45, No. 2, 101-105 (1993). MSC: 68M10 PDFBibTeX XMLCite \textit{M. J. Fischer} et al., Inf. Process. Lett. 45, No. 2, 101--105 (1993; Zbl 0795.68007) Full Text: DOI
Taubenfeld, Gadi On the nonexistence of resilient consensus protocols. (English) Zbl 0722.68013 Inf. Process. Lett. 37, No. 5, 285-289 (1991). MSC: 68M10 PDFBibTeX XMLCite \textit{G. Taubenfeld}, Inf. Process. Lett. 37, No. 5, 285--289 (1991; Zbl 0722.68013) Full Text: DOI
Chang, Chung-Kuo; Gouda, M. G. On the minimum requirements for independent recovery in distributed systems. (English) Zbl 0711.68006 Inf. Process. Lett. 37, No. 1, 1-7 (1991). MSC: 68M10 PDFBibTeX XMLCite \textit{C.-K. Chang} and \textit{M. G. Gouda}, Inf. Process. Lett. 37, No. 1, 1--7 (1991; Zbl 0711.68006) Full Text: DOI
Shvartsman, Alex A. Achieving optimal CRCW PRAM fault-tolerance. (English) Zbl 0735.68009 Inf. Process. Lett. 39, No. 2, 59-66 (1991). MSC: 68M15 68Q05 68M10 68W15 PDFBibTeX XMLCite \textit{A. A. Shvartsman}, Inf. Process. Lett. 39, No. 2, 59--66 (1991; Zbl 0735.68009) Full Text: DOI
Chen, Jianer; Cox, Jim; Mishra, Bud An NL hierarchy. (English) Zbl 0735.68030 Inf. Process. Lett. 39, No. 1, 21-26 (1991). MSC: 68Q15 PDFBibTeX XMLCite \textit{J. Chen} et al., Inf. Process. Lett. 39, No. 1, 21--26 (1991; Zbl 0735.68030) Full Text: DOI
Sanchis, Laura A. On the complexity of test case generation for NP-hard problems. (English) Zbl 0704.68058 Inf. Process. Lett. 36, No. 3, 135-140 (1990). MSC: 68Q25 PDFBibTeX XMLCite \textit{L. A. Sanchis}, Inf. Process. Lett. 36, No. 3, 135--140 (1990; Zbl 0704.68058) Full Text: DOI
Hellerstein, Lisa; Klein, Philip; Wilber, Robert On the time-space complexity of reachability queries for preprocessed graphs. (English) Zbl 0703.68061 Inf. Process. Lett. 35, No. 5, 261-267 (1990). MSC: 68Q25 68R10 PDFBibTeX XMLCite \textit{L. Hellerstein} et al., Inf. Process. Lett. 35, No. 5, 261--267 (1990; Zbl 0703.68061) Full Text: DOI
Goldreich, Oded; Petrank, Erez The best of both worlds: Guaranteeing termination in fast randomized Byzantine agreement protocols. (English) Zbl 0703.68020 Inf. Process. Lett. 36, No. 1, 45-49 (1990). MSC: 68M10 68W15 PDFBibTeX XMLCite \textit{O. Goldreich} and \textit{E. Petrank}, Inf. Process. Lett. 36, No. 1, 45--49 (1990; Zbl 0703.68020) Full Text: DOI
Bodlaender, Hans L.; Tel, Gerard Bit-optimal election in synchronous rings. (English) Zbl 0703.68016 Inf. Process. Lett. 36, No. 1, 53-56 (1990). MSC: 68M10 68Q25 PDFBibTeX XMLCite \textit{H. L. Bodlaender} and \textit{G. Tel}, Inf. Process. Lett. 36, No. 1, 53--56 (1990; Zbl 0703.68016) Full Text: DOI Link
Taubenfeld, Gadi Leader election in the presence of n-1 initial failures. (English) Zbl 0684.68023 Inf. Process. Lett. 33, No. 1, 25-28 (1989). MSC: 68N99 68N25 PDFBibTeX XMLCite \textit{G. Taubenfeld}, Inf. Process. Lett. 33, No. 1, 25--28 (1989; Zbl 0684.68023) Full Text: DOI
Misra, Jayadev A simple proof of a simple consensus algorithm. (English) Zbl 0684.68021 Inf. Process. Lett. 33, No. 1, 21-24 (1989). MSC: 68N99 68N25 68W99 PDFBibTeX XMLCite \textit{J. Misra}, Inf. Process. Lett. 33, No. 1, 21--24 (1989; Zbl 0684.68021) Full Text: DOI
Rolim, José D. P.; Greibach, Sheila A. A note on the best-case complexity. (English) Zbl 0672.68019 Inf. Process. Lett. 30, No. 3, 133-138 (1989). Reviewer: D.Lucanu MSC: 68Q25 03D15 PDFBibTeX XMLCite \textit{J. D. P. Rolim} and \textit{S. A. Greibach}, Inf. Process. Lett. 30, No. 3, 133--138 (1989; Zbl 0672.68019) Full Text: DOI
Bodlaender, Hans L. A better lower bound for distributed leader finding in bidirectional asynchronous rings of processors. (English) Zbl 0652.68052 Inf. Process. Lett. 27, No. 6, 287-290 (1988). MSC: 68Q25 68N25 PDFBibTeX XMLCite \textit{H. L. Bodlaender}, Inf. Process. Lett. 27, No. 6, 287--290 (1988; Zbl 0652.68052) Full Text: DOI Link
Kutten, Shay Optimal fault-tolerant distributed construction of a spanning forest. (English) Zbl 0648.94026 Inf. Process. Lett. 27, No. 6, 299-307 (1988). MSC: 94C15 68R10 PDFBibTeX XMLCite \textit{S. Kutten}, Inf. Process. Lett. 27, No. 6, 299--307 (1988; Zbl 0648.94026) Full Text: DOI
Huynh, Dung T. On solving hard problems by polynomial-size circuits. (English) Zbl 0632.68046 Inf. Process. Lett. 24, 171-176 (1987). MSC: 68Q25 94C10 PDFBibTeX XMLCite \textit{D. T. Huynh}, Inf. Process. Lett. 24, 171--176 (1987; Zbl 0632.68046) Full Text: DOI
Kirsig, Bernd; Lange, Klaus-Jörn Separation with the Ruzzo, Simon, and Tompa relativization implies DSPACE(log n)\(\neq NSPACE(\log \,n)\). (English) Zbl 0629.68050 Inf. Process. Lett. 25, 13-15 (1987). MSC: 68Q25 PDFBibTeX XMLCite \textit{B. Kirsig} and \textit{K.-J. Lange}, Inf. Process. Lett. 25, 13--15 (1987; Zbl 0629.68050) Full Text: DOI
Friedberg, Stuart A.; Peterson, Gary L. An efficient solution to the mutual exclusion problem using weak semaphores. (English) Zbl 0622.68029 Inf. Process. Lett. 25, 343-347 (1987). MSC: 68N25 PDFBibTeX XMLCite \textit{S. A. Friedberg} and \textit{G. L. Peterson}, Inf. Process. Lett. 25, 343--347 (1987; Zbl 0622.68029) Full Text: DOI
Ambos-Spies, Klaus A note on complete problems for complexity classes. (English) Zbl 0634.68036 Inf. Process. Lett. 23, 227-230 (1986). Reviewer: Ph.W.Grant MSC: 68Q25 03D60 03D15 PDFBibTeX XMLCite \textit{K. Ambos-Spies}, Inf. Process. Lett. 23, 227--230 (1986; Zbl 0634.68036) Full Text: DOI
Ambos-Spies, Klaus Inhomogeneities in the polynomial-time degrees: The degrees of super sparse sets. (English) Zbl 0592.03028 Inf. Process. Lett. 22, 113-117 (1986). MSC: 03D15 03D30 68Q25 PDFBibTeX XMLCite \textit{K. Ambos-Spies}, Inf. Process. Lett. 22, 113--117 (1986; Zbl 0592.03028) Full Text: DOI
Chrobak, M.; Chlebus, B. S. Probabilistic Turing machines and recursively enumerable Dedekind cuts. (English) Zbl 0559.03025 Inf. Process. Lett. 19, 167-171 (1984). Reviewer: Phan Dinh Dieu MSC: 03D10 03F60 PDFBibTeX XMLCite \textit{M. Chrobak} and \textit{B. S. Chlebus}, Inf. Process. Lett. 19, 167--171 (1984; Zbl 0559.03025) Full Text: DOI
Balcazar, J. L.; Diaz, J. A note on a theorem by Ladner. (English) Zbl 0515.03022 Inf. Process. Lett. 15, 84-86 (1982). MSC: 03D15 03D55 68Q25 PDFBibTeX XMLCite \textit{J. L. Balcazar} and \textit{J. Diaz}, Inf. Process. Lett. 15, 84--86 (1982; Zbl 0515.03022) Full Text: DOI
Fischer, Michael J.; Lynch, Nancy A. A lower bound for the time to assure interactive consistency. (English) Zbl 0493.68026 Inf. Process. Lett. 14, 183-186 (1982). MSC: 68N25 PDFBibTeX XMLCite \textit{M. J. Fischer} and \textit{N. A. Lynch}, Inf. Process. Lett. 14, 183--186 (1982; Zbl 0493.68026) Full Text: DOI
Goldschlager, Leslie M. A space efficient algorithm for the monotone planar circuit value problem. (English) Zbl 0422.68011 Inf. Process. Lett. 10, 25-27 (1980). MSC: 68Q25 94C10 PDFBibTeX XMLCite \textit{L. M. Goldschlager}, Inf. Process. Lett. 10, 25--27 (1980; Zbl 0422.68011) Full Text: DOI