Calculated based on number of publications stored in Pure and citations from Scopus
1986 …2024

Research activity per year

Filter
Conference contribution

Search results

  • 2023

    Approximating Connected Maximum Cuts via Local Search

    Schieber, B. & Vahidi, S., Sep 2023, 31st Annual European Symposium on Algorithms, ESA 2023. Li Gortz, I., Farach-Colton, M., Puglisi, S. J. & Herman, G. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 93. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 274).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • Interweaving Real-Time Jobs with Energy Harvesting to Maximize Throughput

    Schieber, B., Samineni, B. & Vahidi, S., 2023, WALCOM: Algorithms and Computation - 17th International Conference and Workshops, WALCOM 2023, Proceedings. Lin, C-C., Lin, B. M. & Liotta, G. (eds.). Springer Science and Business Media Deutschland GmbH, p. 305-316 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 13973 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Open Access
    3 Scopus citations
  • Parallel Longest Common SubSequence Analysis In Chapel

    Vahidi, S., Schieber, B., Du, Z. & Bader, D. A., 2023, 2023 IEEE High Performance Extreme Computing Conference, HPEC 2023. Institute of Electrical and Electronics Engineers Inc., (2023 IEEE High Performance Extreme Computing Conference, HPEC 2023).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Open Access
  • Quick Minimization of Tardy Processing Time on a Single Machine

    Schieber, B. & Sitaraman, P., 2023, Algorithms and Data Structures - 18th International Symposium, WADS 2023, Proceedings. Morin, P. & Suri, S. (eds.). Springer Science and Business Media Deutschland GmbH, p. 637-643 7 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 14079 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • 2022

    Rank Aggregation with Proportionate Fairness

    Wei, D., Islam, M. M., Schieber, B. & Basu Roy, S., Jun 10 2022, SIGMOD 2022 - Proceedings of the 2022 International Conference on Management of Data. Association for Computing Machinery, p. 262-275 14 p. (Proceedings of the ACM SIGMOD International Conference on Management of Data).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    5 Scopus citations
  • 2020

    Maximizing throughput in flow shop real-time scheduling

    Yamin, L. B., Li, J., Sarpatwar, K., Schieber, B. & Shachnai, H., Aug 1 2020, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020. Byrka, J. & Meka, R. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, APPROX48. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 176).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • 2019

    Generalized assignment via submodular optimization with reserved capacity

    Kulik, A., Sarpatwar, K., Schieber, B. & Shachnai, H., Sep 2019, 27th Annual European Symposium on Algorithms, ESA 2019. Bender, M. A., Svensson, O. & Herman, G. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 69. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 144).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • Scalable fair clustering

    Backurs, A., Indyk, P., Onak, K., Schieber, B., Vakilian, A. H. & Wagner, T., Jan 1 2019, 36th International Conference on Machine Learning, ICML 2019. International Machine Learning Society (IMLS), p. 623-634 12 p. (36th International Conference on Machine Learning, ICML 2019; vol. 2019-June).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    44 Scopus citations
  • The preemptive resource allocation problem

    Sarpatwar, K., Schieber, B. & Shachnai, H., Dec 2019, 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2019. Chattopadhyay, A. & Gastin, P. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 26. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 150).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • 2018

    Brief announcement: Approximation algorithms for preemptive resource allocation

    Sarpatwar, K., Schieber, B. & Shachnai, H., Jul 11 2018, SPAA 2018 - Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures. Association for Computing Machinery, p. 343-345 3 p. (Annual ACM Symposium on Parallelism in Algorithms and Architectures).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Open Access
    1 Scopus citations
  • Fully dynamic maximal independent set with sublinear update time

    Assadi, S., Schieber, B., Onak, K. & Solomon, S., Jun 20 2018, STOC 2018 - Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing. Henzinger, M., Kempe, D. & Diakonikolas, I. (eds.). Association for Computing Machinery, p. 431-444 14 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Open Access
    28 Scopus citations
  • Fully dynamic MIS in uniformly sparse graphs

    Onak, K., Schieber, B., Solomon, S. & Wein, N., Jul 1 2018, 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018. Kaklamanis, C., Marx, D., Chatzigiannakis, I. & Sannella, D. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 92. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 107).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    9 Scopus citations
  • Generalized assignment of time-sensitive item groups

    Sarpatwar, K., Schieber, B. & Shachnai, H., Aug 1 2018, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 21st International Workshop, APPROX 2018, and 22nd International Workshop, RANDOM 2018. Blais, E., Rolim, J. D. P., Steurer, D. & Jansen, K. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 24. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 116).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    1 Scopus citations
  • 2016

    Brief announcement: Flexible resource allocation for clouds and all-optical networks

    Katz, D., Schieber, B. & Shachnai, H., Jul 11 2016, SPAA 2016 - Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures. Association for Computing Machinery, p. 225-226 2 p. (Annual ACM Symposium on Parallelism in Algorithms and Architectures; vol. 11-13-July-2016).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Open Access
    4 Scopus citations
  • Subgraph Counting: Color Coding beyond Trees

    Chakaravarthy, V. T., Kapralov, M., Murali, P., Petrini, F., Que, X., Sabharwal, Y. & Schieber, B., Jul 18 2016, Proceedings - 2016 IEEE 30th International Parallel and Distributed Processing Symposium, IPDPS 2016. Institute of Electrical and Electronics Engineers Inc., p. 2-11 10 p. 7515996. (Proceedings - 2016 IEEE 30th International Parallel and Distributed Processing Symposium, IPDPS 2016).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Open Access
    18 Scopus citations
  • 2015

    The container selection problem

    Nagarajan, V., Sarpatwar, K. K., Schieber, B., Shachnai, H. & Wolf, J. L., Aug 1 2015, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 18th International Workshop, APPROX 2015, and 19th International Workshop, RANDOM 2015. Garg, N., Jansen, K., Rao, A. & Rolim, J. D. P. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 416-434 19 p. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 40).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • 2013

    All-or-nothing generalized assignment with application to scheduling advertising campaigns

    Adany, R., Feldman, M., Haramaty, E., Khandekar, R., Schieber, B., Schwartz, R., Shachnai, H. & Tamir, T., 2013, Integer Programming and Combinatorial Optimization - 16th International Conference, IPCO 2013, Proceedings. p. 13-24 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7801 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    7 Scopus citations
  • The approximability of the binary paintshop problem

    Gupta, A., Kale, S., Nagarajan, V., Saket, R. & Schieber, B., 2013, Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques - 16th International Workshop, APPROX 2013 and 17th International Workshop, RANDOM 2013, Proceedings. p. 205-217 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8096 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    5 Scopus citations
  • The Euclidean k-supplier problem

    Nagarajan, V., Schieber, B. & Shachnai, H., 2013, Integer Programming and Combinatorial Optimization - 16th International Conference, IPCO 2013, Proceedings. p. 290-301 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7801 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Open Access
    8 Scopus citations
  • 2010

    Minimizing busy time in multiple machine real-time scheduling

    Khandekar, R., Schieber, B., Shachnai, H. & Tamir, T., 2010, 30th International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010. p. 169-180 12 p. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 8).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    30 Scopus citations
  • 2007

    Dynamic pricing for impatient bidders

    Bansal, N., Chen, N., Cherniavsky, N., Rudra, A., Schieber, B. & Sviridenko, M., 2007, Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007. Association for Computing Machinery, p. 726-735 10 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 07-09-January-2007).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    4 Scopus citations
  • Non-preemptive min-sum scheduling with resource augmentation

    Bansal, N., Chan, H. L., Khandekar, R., Pruhs, K., Schieber, B. & Stein, C., 2007, Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2007. p. 614-624 11 p. 4389530. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    22 Scopus citations
  • 2006

    A quasi-PTAS for unsplittable flow on line graphs

    Bansal, N., Chakrabarti, A., Epstein, A. & Schieber, B., 2006, STOC'06: Proceedings of the 38th Annual ACM Symposium on Theory of Computing. Association for Computing Machinery (ACM), p. 721-729 9 p. (Proceedings of the Annual ACM Symposium on Theory of Computing; vol. 2006).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    91 Scopus citations
  • Minimizing setup and beam-on times in radiation therapy

    Bansal, N., Coppersmith, D. & Schieber, B., 2006, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 a. Springer Verlag, p. 27-38 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4110 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    19 Scopus citations
  • 2002

    Throughput maximization of real-time scheduling with batching

    Bar-Noy, A., Guha, S., Katz, Y., Naor, J., Schieber, B. & Shachnai, H., 2002, Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2002. Association for Computing Machinery, p. 742-751 10 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 06-08-January-2002).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    24 Scopus citations
  • 2000

    A unified approach to approximating resource allocation and scheduling

    Bar-Noy, A., Bar-Yehuda, R., Freund, A., Naor, J. & Schieber, B., 2000, Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, STOC 2000. p. 735-744 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Open Access
    55 Scopus citations
  • Improved approximations of crossings in graph drawings

    Even, G., Guha, S. & Schieber, B., 2000, Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, STOC 2000. p. 296-305 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    5 Scopus citations
  • Pushing dependent data in clients-providers-servers systems

    Bar-Noy, A., Naor, J. & Schieber, B., 2000, Proceedings of the Annual International Conference on Mobile Computing and Networking, MOBICOM. ACM, p. 222-230 9 p. (Proceedings of the Annual International Conference on Mobile Computing and Networking, MOBICOM).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    23 Scopus citations
  • 1997

    Improved approximations for shallow-light spanning trees

    Naor, J. & Schieber, B., 1997, Annual Symposium on Foundations of Computer Science - Proceedings. IEEE Comp Soc, p. 536-541 6 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    18 Scopus citations
  • 1995

    Approximating minimum feedback sets andmulti-cuts in directed graphs

    Even, G., Naor, J. S., Schieber, B. & Sudan, M., 1995, Integer Programming and Combinatorial Optimization - 4th International IPCO Conference, 1995, Proceedings. Balas, E. & Clausen, J. (eds.). Springer Verlag, p. 14-28 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 920).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    42 Scopus citations
  • Computing a minimum-weight κ-link path in graphs with the concave monge property

    Schieber, B., Jan 22 1995, Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1995. Association for Computing Machinery, p. 405-411 7 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    19 Scopus citations
  • Guaranteeing fair service to persistent dependent tasks

    Bar-Noy, A., Mayer, A., Schieber, B. & Sudan, M., Jan 22 1995, Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1995. Association for Computing Machinery, p. 243-252 10 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    8 Scopus citations
  • 1994

    Efficient routing and scheduling algorithms for optical networks

    Aggarwal, A., Bar-Noy, A., Coppersmith, D., Ramaswami, R., Schieber, B. & Sudan, M., 1994, Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms. Publ by ACM, p. 412-423 12 p. (Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    79 Scopus citations
  • 1993

    Computing global combine operations in the multi-port postal model

    Bar-Noy, A., Bruck, J., Ho, C. T., Kipnis, S. & Schieber, B., 1993, Proceedings of the 5th IEEE Symposium on Parallel and Distributed Processing. Anon (ed.). Publ by IEEE, p. 336-343 8 p. (Proceedings of the 5th IEEE Symposium on Parallel and Distributed Processing).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    6 Scopus citations
  • Fast deflection routing for packets and worms

    Bar-Noy, A., Raghavan, P., Schieber, B. & Tamaki, H., 1993, Proceedings of the Annual ACM Symposium on Principles of Distributed Computing. Publ by ACM, p. 75-86 12 p. (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Open Access
    40 Scopus citations
  • Finding a minimum weight K-link path in graphs with Monge property and applications

    Aggarwal, A., Schieber, B. & Tokuyama, T., 1993, Proceedings of the 9th Annual Symposium on Computational Geometry. Publ by ACM, p. 189-197 9 p. (Proceedings of the 9th Annual Symposium on Computational Geometry).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Open Access
    28 Scopus citations
  • How much can hardware help routing?

    Borodin, A., Raghavan, P., Schieber, B. & Upfal, E., Jun 1 1993, Proceedings of the 25th Annual ACM Symposium on Theory of Computing, STOC 1993. Association for Computing Machinery, p. 573-582 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing; vol. Part F129585).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Open Access
    20 Scopus citations
  • 1992

    A sublinear space, polynomial time algorithm for directed s-t connectivity

    Barnes, G., Buss, J. F., Ruzzo, W. L. & Schieber, B., 1992, Proceedings of the Seventh Annual Structure in Complexity Theory Conference. Publ by ERROR: no PUB record found for PX none CN nonpie IG 75516, p. 27-33 7 p. (Proceedings of the Seventh Annual Structure in Complexity Theory Conference).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    23 Scopus citations
  • Efficient minimum cost matching using quadrangle inequality

    Aggarwal, A., Bar-Noy, A., Khuller, S., Kravets, D. & Schieber, B., 1992, Proceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992. IEEE Computer Society, p. 583-592 10 p. 267793. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 1992-October).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    14 Scopus citations
  • Lower bounds on the depth of monotone arithmetic computations

    Coppersmith, D. & Schieber, B., 1992, Proceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992. IEEE Computer Society, p. 288-295 8 p. 267763. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 1992-October).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    3 Scopus citations
  • 1991

    Competitive paging with locality of reference

    Borodin, A., Irani, S., Raghavan, P. & Schieber, B., Jan 3 1991, Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, STOC 1991. Association for Computing Machinery, p. 249-259 11 p. (Proceedings of the Annual ACM Symposium on Theory of Computing; vol. Part F130073).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Open Access
    61 Scopus citations
  • Improved selection in totally monotone arrays

    Mansour, Y., Park, J. K., Schieber, B. & Sen, S., 1991, Foundations of Software Technology and Theoretical Computer Science - 11th Conference, Proceedings. Biswas, S. & Nori, K. V. (eds.). Springer Verlag, p. 347-359 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 560 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Open Access
  • Navigating in Unfamiliar Geometric Terrain

    Blum, A., Raghavan, P. & Schieber, B., Jan 3 1991, Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, STOC 1991. Association for Computing Machinery, p. 494-504 11 p. (Proceedings of the Annual ACM Symposium on Theory of Computing; vol. Part F130073).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Open Access
    68 Scopus citations
  • The Canadian Traveller Problem

    Bar-Noy, A. & Schieber, B., Mar 1 1991, Proceedings of the 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1991. Association for Computing Machinery, p. 261-270 10 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    89 Scopus citations
  • 1990

    On-line dynamic programming with applications to the prediction of RNA secondary structure

    Larmore, L. L. & Schieber, B., Jan 1 1990, Proceedings of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1990. Association for Computing Machinery, p. 503-512 10 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    13 Scopus citations
  • 1989

    Calling names on nameless networks

    Schieber, B. & Snir, M., 1989, Proc Eighth ACM Symp Princ Distrib Comput. Publ by ACM, p. 319-328 10 p. (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    16 Scopus citations
  • Complexity of approximating the square root

    Mansour, Y., Schieber, B. & Tiwari, P., 1989, Annual Symposium on Foundations of Computer Science (Proceedings). Publ by IEEE, p. 325-330 6 p. (Annual Symposium on Foundations of Computer Science (Proceedings)).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    10 Scopus citations
  • Efficient parallel algorithms for testing connectivity and finding disjoint s-t paths in graphs

    Khuller, S. & Schieber, B., 1989, Annual Symposium on Foundations of Computer Science (Proceedings). Publ by IEEE, p. 288-293 6 p. (Annual Symposium on Foundations of Computer Science (Proceedings)).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    17 Scopus citations
  • Highly parallelizable problems

    Berkman, O., Breslauer, D., Galil, Z., Schieber, B. & Vishkin, U., 1989, Proc Twenty First Annu ACM Symp Theory Comput. Publ by ACM, p. 309-319 11 p. (Proc Twenty First Annu ACM Symp Theory Comput).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Open Access
    83 Scopus citations
  • Intractability of bounded protocols for non-FIFO channels

    Mansour, Y. & Schieber, B., 1989, Proc Eighth ACM Symp Princ Distrib Comput. Publ by ACM, p. 59-72 14 p. (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Open Access
    5 Scopus citations