Nakai, Takeshi; Shinagawa, Kazumasa Constant-round linear-broadcast secure computation with penalties. (English) Zbl 07685358 Theor. Comput. Sci. 959, Article ID 113874, 20 p. (2023). MSC: 68Qxx PDFBibTeX XMLCite \textit{T. Nakai} and \textit{K. Shinagawa}, Theor. Comput. Sci. 959, Article ID 113874, 20 p. (2023; Zbl 07685358) Full Text: DOI arXiv
Istrate, Gabriel; Bonchiş, Cosmin A parametric worst-case approach to fairness in cooperative games with transferable utility. (English) Zbl 07676479 Theor. Comput. Sci. 940, 189-205 (2023). MSC: 68Qxx PDFBibTeX XMLCite \textit{G. Istrate} and \textit{C. Bonchiş}, Theor. Comput. Sci. 940, 189--205 (2023; Zbl 07676479) Full Text: DOI
Haitner, Iftach; Makriyannis, Nikolaos; Omri, Eran On the complexity of fair coin flipping. (English) Zbl 07509395 Theor. Comput. Sci. 914, 23-38 (2022). MSC: 94A60 68Q11 PDFBibTeX XMLCite \textit{I. Haitner} et al., Theor. Comput. Sci. 914, 23--38 (2022; Zbl 07509395) Full Text: DOI arXiv
Kerkmann, Anna Maria; Nguyen, Nhan-Tam; Rothe, Jörg Local fairness in hedonic games via individual threshold coalitions. (English) Zbl 1507.91012 Theor. Comput. Sci. 877, 1-17 (2021). MSC: 91A12 PDFBibTeX XMLCite \textit{A. M. Kerkmann} et al., Theor. Comput. Sci. 877, 1--17 (2021; Zbl 1507.91012) Full Text: DOI
Durand, Martin; Pascual, Fanny Efficiency and equity in the multi organization scheduling problem. (English) Zbl 1501.90026 Theor. Comput. Sci. 864, 103-117 (2021). MSC: 90B35 PDFBibTeX XMLCite \textit{M. Durand} and \textit{F. Pascual}, Theor. Comput. Sci. 864, 103--117 (2021; Zbl 1501.90026) Full Text: DOI HAL
Liu, Wenjing; Ding, Yuan; Chen, Xin; Fang, Qizhi; Nong, Qingqin Multiple facility location games with envy ratio. (English) Zbl 1482.91059 Theor. Comput. Sci. 864, 1-9 (2021). MSC: 91B03 91A80 90B80 PDFBibTeX XMLCite \textit{W. Liu} et al., Theor. Comput. Sci. 864, 1--9 (2021; Zbl 1482.91059) Full Text: DOI
Kyropoulou, Maria; Suksompong, Warut; Voudouris, Alexandros A. Almost envy-freeness in group resource allocation. (English) Zbl 1458.91109 Theor. Comput. Sci. 841, 110-123 (2020). MSC: 91B32 PDFBibTeX XMLCite \textit{M. Kyropoulou} et al., Theor. Comput. Sci. 841, 110--123 (2020; Zbl 1458.91109) Full Text: DOI arXiv Link
Amanatidis, Georgios; Markakis, Evangelos; Ntokos, Apostolos Multiple birds with one stone: beating 1/2 for EFX and GMMS via envy cycle elimination. (English) Zbl 1458.91107 Theor. Comput. Sci. 841, 94-109 (2020). MSC: 91B32 PDFBibTeX XMLCite \textit{G. Amanatidis} et al., Theor. Comput. Sci. 841, 94--109 (2020; Zbl 1458.91107) Full Text: DOI arXiv
Bolotov, Alexander; Hermo, Montserrat; Lucio, Paqui Branching-time logic \(\mathsf{ECTL}^{\#}\) and its tree-style one-pass tableau: extending fairness expressibility of \(\mathsf{ECTL}^+\). (English) Zbl 1433.03049 Theor. Comput. Sci. 813, 428-451 (2020). MSC: 03B44 68Q60 PDFBibTeX XMLCite \textit{A. Bolotov} et al., Theor. Comput. Sci. 813, 428--451 (2020; Zbl 1433.03049) Full Text: DOI
Xu, Jian; Banerjee, Soumya; Rao, Wenjing The existence of universally agreed fairest semi-matchings in any given bipartite graph. (English) Zbl 1433.68311 Theor. Comput. Sci. 818, 83-91 (2020). MSC: 68R10 05C70 91B32 PDFBibTeX XMLCite \textit{J. Xu} et al., Theor. Comput. Sci. 818, 83--91 (2020; Zbl 1433.68311) Full Text: DOI
Heydrich, Sandy; van Stee, Rob Dividing connected chores fairly. (English) Zbl 1331.91107 Theor. Comput. Sci. 593, 51-61 (2015). MSC: 91B32 PDFBibTeX XMLCite \textit{S. Heydrich} and \textit{R. van Stee}, Theor. Comput. Sci. 593, 51--61 (2015; Zbl 1331.91107) Full Text: DOI
Edmonds, Jeff On the competitiveness of AIMD-TCP within a general network. (English) Zbl 1252.68046 Theor. Comput. Sci. 462, 12-22 (2012). MSC: 68M20 68W15 68W27 68W40 PDFBibTeX XMLCite \textit{J. Edmonds}, Theor. Comput. Sci. 462, 12--22 (2012; Zbl 1252.68046) Full Text: DOI
Bianco, Alessandro; Faella, Marco; Mogavero, Fabio; Murano, Aniello Quantitatively fair scheduling. (English) Zbl 1243.68099 Theor. Comput. Sci. 413, No. 1, 160-175 (2012). Reviewer: Jacek Błazewicz (Poznań) MSC: 68M20 68Q85 68R10 PDFBibTeX XMLCite \textit{A. Bianco} et al., Theor. Comput. Sci. 413, No. 1, 160--175 (2012; Zbl 1243.68099) Full Text: DOI
Cobb, Jorge A.; Gouda, Mohamed G. Stabilization of max-min fair networks without per-flow state. (English) Zbl 1222.68042 Theor. Comput. Sci. 412, No. 40, 5562-5579 (2011). MSC: 68M14 PDFBibTeX XMLCite \textit{J. A. Cobb} and \textit{M. G. Gouda}, Theor. Comput. Sci. 412, No. 40, 5562--5579 (2011; Zbl 1222.68042) Full Text: DOI
Friedrich, Tobias; Horoba, Christian; Neumann, Frank Illustration of fairness in evolutionary multi-objective optimization. (English) Zbl 1211.90209 Theor. Comput. Sci. 412, No. 17, 1546-1556 (2011). MSC: 90C29 68T20 PDFBibTeX XMLCite \textit{T. Friedrich} et al., Theor. Comput. Sci. 412, No. 17, 1546--1556 (2011; Zbl 1211.90209) Full Text: DOI
Bidinger, Philippe; Compagnoni, Adriana Pict correctness revisited. (English) Zbl 1169.68029 Theor. Comput. Sci. 410, No. 2-3, 114-127 (2009). MSC: 68Q85 68N30 68Q60 PDFBibTeX XMLCite \textit{P. Bidinger} and \textit{A. Compagnoni}, Theor. Comput. Sci. 410, No. 2--3, 114--127 (2009; Zbl 1169.68029) Full Text: DOI
ter Beek, Maurice H.; Kleijn, Jetty Infinite unfair shuffles and associativity. (English) Zbl 1118.68112 Theor. Comput. Sci. 380, No. 3, 401-410 (2007). MSC: 68R15 PDFBibTeX XMLCite \textit{M. H. ter Beek} and \textit{J. Kleijn}, Theor. Comput. Sci. 380, No. 3, 401--410 (2007; Zbl 1118.68112) Full Text: DOI
Corradini, F.; Di Berardini, M. R.; Vogler, W. Fairness of components in system computations. (English) Zbl 1092.68065 Theor. Comput. Sci. 356, No. 3, 291-324 (2006). MSC: 68Q85 PDFBibTeX XMLCite \textit{F. Corradini} et al., Theor. Comput. Sci. 356, No. 3, 291--324 (2006; Zbl 1092.68065) Full Text: DOI
Yeh, Hong-Gwa; Zhu, Xuding Resource-sharing system scheduling and circular chromatic number. (English) Zbl 1088.68144 Theor. Comput. Sci. 332, No. 1-3, 447-460 (2005). MSC: 68R10 05C15 68M20 90B35 PDFBibTeX XMLCite \textit{H.-G. Yeh} and \textit{X. Zhu}, Theor. Comput. Sci. 332, No. 1--3, 447--460 (2005; Zbl 1088.68144) Full Text: DOI
Carayol, Arnaud; Hirschkoff, Daniel; Sangiorgi, Davide On the representation of McCarthy’s \(amb\) in the \(\pi\)-calculus. (English) Zbl 1078.68106 Theor. Comput. Sci. 330, No. 3, 439-473 (2005). MSC: 68Q85 68N18 PDFBibTeX XMLCite \textit{A. Carayol} et al., Theor. Comput. Sci. 330, No. 3, 439--473 (2005; Zbl 1078.68106) Full Text: DOI
Hildebrandt, Thomas T. Towards categorical models for fairness: Fully abstract presheaf semantics of SCCS with finite delay. (English) Zbl 1028.68085 Theor. Comput. Sci. 294, No. 1-2, 151-181 (2003). MSC: 68Q55 68Q85 PDFBibTeX XMLCite \textit{T. T. Hildebrandt}, Theor. Comput. Sci. 294, No. 1--2, 151--181 (2003; Zbl 1028.68085) Full Text: DOI
Vogler, Walter Efficiency of asynchronous systems, read arcs, and the MUTEX-problem. (English) Zbl 1026.68099 Theor. Comput. Sci. 275, No. 1-2, 589-631 (2002). MSC: 68Q85 PDFBibTeX XMLCite \textit{W. Vogler}, Theor. Comput. Sci. 275, No. 1--2, 589--631 (2002; Zbl 1026.68099) Full Text: DOI
Joung, Y.-J. Two decentralized algorithms for strong interaction fairness for systems with unbounded speed variability. (English) Zbl 0944.68195 Theor. Comput. Sci. 243, No. 1-2, 307-338 (2000). MSC: 68W05 68N01 PDFBibTeX XMLCite \textit{Y. J. Joung}, Theor. Comput. Sci. 243, No. 1--2, 307--338 (2000; Zbl 0944.68195) Full Text: DOI
Hartonas, Chrysafis A fixpoint approach to finite delay and fairness. (English) Zbl 0911.68101 Theor. Comput. Sci. 198, No. 1-2, 131-158 (1998). MSC: 68Q45 PDFBibTeX XMLCite \textit{C. Hartonas}, Theor. Comput. Sci. 198, No. 1--2, 131--158 (1998; Zbl 0911.68101) Full Text: DOI
Nolte, Doris; Priese, Lutz Abstract fairness and semantics. (English) Zbl 0901.68106 Theor. Comput. Sci. 177, No. 1, 139-153 (1997). MSC: 68Q55 PDFBibTeX XMLCite \textit{D. Nolte} and \textit{L. Priese}, Theor. Comput. Sci. 177, No. 1, 139--153 (1997; Zbl 0901.68106) Full Text: DOI
Main, Michael G. Complete proof rules for strong fairness and strong extreme fairness. (English) Zbl 0785.68058 Theor. Comput. Sci. 111, No. 1-2, 125-143 (1993). Reviewer: N.Francez (Haifa) MSC: 68Q55 68Q60 PDFBibTeX XMLCite \textit{M. G. Main}, Theor. Comput. Sci. 111, No. 1--2, 125--143 (1993; Zbl 0785.68058) Full Text: DOI
Hamaguchi, Kiyoharu; Hiraishi, Hiromi; Yajima, Shuzo \(\infty\)-regular temporal logic and its model checking problem. (English) Zbl 0762.03011 Theor. Comput. Sci. 103, No. 2, 191-204 (1992). MSC: 03B45 68Q45 94C10 03B80 PDFBibTeX XMLCite \textit{K. Hamaguchi} et al., Theor. Comput. Sci. 103, No. 2, 191--204 (1992; Zbl 0762.03011) Full Text: DOI
Priese, Lutz; Nolte, Doris Strong fairness and ultra metrics. (English) Zbl 0769.68105 Theor. Comput. Sci. 99, No. 1, 121-140 (1992). MSC: 68Q85 03D20 PDFBibTeX XMLCite \textit{L. Priese} and \textit{D. Nolte}, Theor. Comput. Sci. 99, No. 1, 121--140 (1992; Zbl 0769.68105) Full Text: DOI
Darondeau, Philippe; Nolte, Doris; Priese, Lutz; Yoccoz, Serge Fairness, distances and degrees. (English) Zbl 0769.68103 Theor. Comput. Sci. 97, No. 1, 131-142 (1992). MSC: 68Q85 68Q10 03D20 PDFBibTeX XMLCite \textit{P. Darondeau} et al., Theor. Comput. Sci. 97, No. 1, 131--142 (1992; Zbl 0769.68103) Full Text: DOI Link
Howell, Rodney R.; Rosier, Louis E.; Yen, Hsu-Chun A taxonomy of fairness and temporal logic problems for Petri nets. (English) Zbl 0728.68090 Theor. Comput. Sci. 82, No. 2, 341-372 (1991). Reviewer: K.Atanassov (Sofia) MSC: 68Q85 PDFBibTeX XMLCite \textit{R. R. Howell} et al., Theor. Comput. Sci. 82, No. 2, 341--372 (1991; Zbl 0728.68090) Full Text: DOI
Howell, Rodney R.; Rosier, Louis E.; Yen, Hsu-Chun Global and local views of state fairness. (English) Zbl 0727.68078 Theor. Comput. Sci. 80, No. 1, 77-104 (1991). Reviewer: K.Atanassov (Sofia) MSC: 68Q85 68Q25 68Q10 PDFBibTeX XMLCite \textit{R. R. Howell} et al., Theor. Comput. Sci. 80, No. 1, 77--104 (1991; Zbl 0727.68078) Full Text: DOI
Jančar, Petr Decidability of a temporal logic problem for Petri nets. (English) Zbl 0701.68081 Theor. Comput. Sci. 74, No. 1, 71-93 (1990). MSC: 68Q85 03B25 03B45 PDFBibTeX XMLCite \textit{P. Jančar}, Theor. Comput. Sci. 74, No. 1, 71--93 (1990; Zbl 0701.68081) Full Text: DOI
Tiomkin, Michael Probabilistic termination versus fair termination. (English) Zbl 0679.68028 Theor. Comput. Sci. 66, No. 3, 333-340 (1989). Reviewer: L.Brim MSC: 68Q60 68N25 03B70 68Q65 PDFBibTeX XMLCite \textit{M. Tiomkin}, Theor. Comput. Sci. 66, No. 3, 333--340 (1989; Zbl 0679.68028) Full Text: DOI
Howell, Rodney R.; Rosier, Louis E. Problems concerning fairness and temporal logic for conflict-free Petri nets. (English) Zbl 0673.68040 Theor. Comput. Sci. 64, No. 3, 305-329 (1989). Reviewer: M.Jantzen MSC: 68Q85 03B60 68Q25 PDFBibTeX XMLCite \textit{R. R. Howell} and \textit{L. E. Rosier}, Theor. Comput. Sci. 64, No. 3, 305--329 (1989; Zbl 0673.68040) Full Text: DOI
Rosier, Louis E.; Yen, Hsu-Chun On the complexity of deciding fair termination of probabilistic concurrent finite-state programs. (English) Zbl 0658.68054 Theor. Comput. Sci. 58, No. 1-3, 263-324 (1988). Reviewer: W.Zielonka MSC: 68Q25 68Q45 68Q60 PDFBibTeX XMLCite \textit{L. E. Rosier} and \textit{H.-C. Yen}, Theor. Comput. Sci. 58, No. 1--3, 263--324 (1988; Zbl 0658.68054) Full Text: DOI
Hesselink, Wim H. Deadlock and fairness in morphisms of transition systems. (English) Zbl 0648.68070 Theor. Comput. Sci. 59, No. 3, 235-257 (1988). MSC: 68Q85 68N25 PDFBibTeX XMLCite \textit{W. H. Hesselink}, Theor. Comput. Sci. 59, No. 3, 235--257 (1988; Zbl 0648.68070) Full Text: DOI Link
Priese, Lutz; Rehrmann, Ralf; Willecke-Klemme, Uwe An introduction to the regular theory of fairness. (English) Zbl 0643.68025 Theor. Comput. Sci. 54, 139-163 (1987). MSC: 68N25 68Q45 PDFBibTeX XMLCite \textit{L. Priese} et al., Theor. Comput. Sci. 54, 139--163 (1987; Zbl 0643.68025) Full Text: DOI
Fauconnier, H. Sémantique asynchrone et comportements infinis en CPS. (French) Zbl 0627.68023 Theor. Comput. Sci. 54, 277-298 (1987). MSC: 68N25 PDFBibTeX XMLCite \textit{H. Fauconnier}, Theor. Comput. Sci. 54, 277--298 (1987; Zbl 0627.68023) Full Text: DOI
Meyer, J.-J. Ch. Merging regular processes by means of fixed-point theory. (English) Zbl 0602.68025 Theor. Comput. Sci. 45, 193-260 (1986). MSC: 68N25 68N01 PDFBibTeX XMLCite \textit{J. J. Ch. Meyer}, Theor. Comput. Sci. 45, 193--260 (1986; Zbl 0602.68025) Full Text: DOI
Darondeau, Philippe About fair asynchrony. (English) Zbl 0607.68016 Theor. Comput. Sci. 37, 305-336 (1985). MSC: 68N25 68Q65 PDFBibTeX XMLCite \textit{P. Darondeau}, Theor. Comput. Sci. 37, 305--336 (1985; Zbl 0607.68016) Full Text: DOI
Burkhard, H. D. An investigation of controls for concurrent systems based on abstract control languages. (English) Zbl 0567.68021 Theor. Comput. Sci. 38, 193-222 (1985). MSC: 68N25 PDFBibTeX XMLCite \textit{H. D. Burkhard}, Theor. Comput. Sci. 38, 193--222 (1985; Zbl 0567.68021) Full Text: DOI Link
Apt, Krzysztof R. Ten years of Hoare’s logic: A survey. II: Nondeterminism. (English) Zbl 0523.68015 Theor. Comput. Sci. 28, 83-109 (1984). MSC: 68Q60 68N01 PDFBibTeX XMLCite \textit{K. R. Apt}, Theor. Comput. Sci. 28, 83--109 (1984; Zbl 0523.68015) Full Text: DOI
Valk, Rüdiger Infinite behaviour of Petri nets. (English) Zbl 0559.68057 Theor. Comput. Sci. 25, 311-341 (1983). Reviewer: H.Müller MSC: 68Q85 68Q45 68Q05 PDFBibTeX XMLCite \textit{R. Valk}, Theor. Comput. Sci. 25, 311--341 (1983; Zbl 0559.68057) Full Text: DOI