SERGIO RAJSBAUM GORODEZKY
| DATOS GENERALES | |||||||||
|
|||||||||
| NOMBRAMIENTOS | |||||||||
|
|||||||||
ESTIMULOS, PROGRAMAS, PREMIOS Y RECONOCIMIENTOS
|
|||||||||
| INFORMACIÓN DE PUBLICACIONES | |||||||||
| Firmas | |
| Rajsbaum S. Rajsbaum Sergio Rajsbaum, S Rajsbaum, S. Rajsbaum, Sergio | |
 ID's SCOPUS |
|
| 55989661500 | |
 ORCID's |
|
| 0000-0002-0009-5287 |
| Áreas de conocimiento | |
|
Computer science, hardware & architecture Computer science, hardware and architecture Computer science, information systems Computer science, software engineering Computer science, theory & methods Computer science, theory and methods Engineering, electrical & electronic Jcs 2008 Logic Mathematics Mathematics, applied Telecommunications Computational theory and mathematics Computer networks and communications Computer science (miscellaneous) Computer Science Applications Control and Systems Engineering Cultural studies Hardware and architecture Information systems Logic Mathematics (miscellaneous) Software |
Coautorías con entidades de la UNAM
|
Revistas en las que ha publicado (42):
|
Documentos indexados (WoS y Scopus)
| # | Título del documento | Autores | Año | Revista | Fuente | Citas WoS | Citas Scopus |
|---|---|---|---|---|---|---|---|
| 1 | Recent advances on principles of concurrent data structures | 2ᵒ autor y autor de correspondencia: Rajsbaum S., Castañeda A. | 2024 | COMMUNICATIONS OF THE ACM | WoS-id: 001293981400012 Scopus-id: 2-s2.0-85200489158 | 0 | 0 |
| 2 | Simplicial models for the epistemic logic of faulty agents | Coautor: Rajsbaum, S, Goubault, E, Kniazev, R, Ledent, J | 2024 | BOLETIN DE LA SOCIEDAD MATEMATICA MEXICANA | WoS-id: 001308529300001 Scopus-id: 2-s2.0-85203387818 | 0 | 0 |
| 3 | Non-negotiating Distributed Computing | Coautor: Rajsbaum S., Delporte-Gallet C., Fauconnier H., Fraigniaud P., et al. | 2024 | Lecture Notes in Computer Science | Scopus-id: 2-s2.0-85195514533 | 0 | 1 |
| 4 | Set-Linearizable Implementations from Read/Write Operations: Sets, Fetch &Increment, Stacks and Queues with Multiplicity | 2ᵒ autor: Rajsbaum S., Castañeda A., Raynal M. | 2023 | DISTRIBUTED COMPUTING | WoS-id: 000894973000001 Scopus-id: 2-s2.0-85143529672 | 4 | 6 |
| 5 | A Linearizabilitybased Hierarchy for Concurrent Specifications | 2ᵒ autor: Rajsbaum, Sergio, Castaneda, Armando, Raynal, Michel | 2023 | COMMUNICATIONS OF THE ACM | WoS-id: 000903559400021 Scopus-id: 2-s2.0-85143484731 | 5 | 6 |
| 6 | A distributed computing perspective of unconditionally secure information transmission in Russian cards problems | 1ᵉʳ autor y autor de correspondencia: Rajsbaum, Sergio | 2023 | THEORETICAL COMPUTER SCIENCE | WoS-id: 000961241400001 Scopus-id: 2-s2.0-85149717005 | 0 | 1 |
| 7 | Synchronous t-resilient consensus in arbitrary graphs | Coautor: Rajsbaum, Sergio, Castañeda A., Fraigniaud, Pierre, Paz, Ami, et al. | 2023 | INFORMATION AND COMPUTATION | WoS-id: 000990690100001 Scopus-id: 2-s2.0-85152592817 | 1 | 5 |
| 8 | Locally solvable tasks and the limitations of valency arguments * | Coautor y autor de correspondencia: Rajsbaum, Sergio, Attiya, Hagit, Castañeda A. | 2023 | JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING | WoS-id: 000990787400001 Scopus-id: 2-s2.0-85148690614 | 0 | 4 |
| 9 | The Solvability of Consensus in Iterated Models Extended with Safe-Consensus | 2ᵒ autor y autor de correspondencia: Rajsbaum S., Conde R. | 2023 | THEORY OF COMPUTING SYSTEMS | WoS-id: 001032522200001 Scopus-id: 2-s2.0-85164928239 | 0 | 0 |
| 10 | Semi-simplicial Set Models for Distributed Knowledge | Coautor: RAJSBAUM, SERGIO, Goubault, Eric, Kniazev, Roman, Ledent, Jeremy | 2023 | IEEE Symposium on Logic in Computer Science | WoS-id: 001036707700028 Scopus-id: 2-s2.0-85165987927 | 4 | 5 |
| 11 | Preface | 2ᵒ autor y autor de correspondencia: Rajsbaum S., Fernandes C.G. | 2023 | 5TH INTERNATIONAL CONFERENCE ON INDUSTRY 4.0 AND SMART MANUFACTURING, ISM 2023 | Scopus-id: 2-s2.0-85174424307 | 0 | 0 |
| 12 | One Step Forward, One Step Back: FLP-Style Proofs and the Round-Reduction Technique for Colorless Tasks | Coautor: Rajsbaum S., Attiya H., Fraigniaud P., Paz A. | 2023 | Leibniz International Proceedings in Informatics, LIPIcs | Scopus-id: 2-s2.0-85175342690 | 0 | 2 |
| 13 | Two-agent Approximate Agreement from an Epistemic Logic Perspective | Coautor y autor de correspondencia: RAJSBAUM, SERGIO, Armenta-Segura, Jorge, Ledent, Jeremy | 2022 | COMPUTACION Y SISTEMAS | WoS-id: 000822515500015 Scopus-id: 2-s2.0-85135759309 | 2 | 2 |
| 14 | Knowledge and Simplicial Complexes | Coautor: Rajsbaum, Sergio, Ditmarsch H., Goubault, Eric, Ledent, Jeremy | 2022 | Philosophical Studies Series | WoS-id: 000869127700001 Scopus-id: 2-s2.0-85126493381 | 8 | 9 |
| 15 | Decentralized Asynchronous Crash-resilient Runtime Verification | Coautor: Rajsbaum, Sergio, Bonakdarpour, Borzoo, Fraigniaud, Pierre, Rosenblueth, David, et al. | 2022 | JOURNAL OF THE ACM | WoS-id: 000885828900004 Scopus-id: 2-s2.0-85163974275 | 7 | 5 |
| 16 | Distributed computability: Relating k-immediate snapshot and x-set agreement | Coautor: Rajsbaum, Sergio, Delporte, Carole, Fauconnier, Hugues, Raynal, Michel | 2022 | INFORMATION AND COMPUTATION | WoS-id: 000886255300032 Scopus-id: 2-s2.0-85119442128 | 0 | 1 |
| 17 | A Snapshot-Based Introduction to the Linearizability Hierarchy | 2ᵒ autor: Rajsbaum, Sergio, Castañeda A., Raynal, Michel | 2022 | Lecture Notes in Computer Science | WoS-id: 000891776100001 Scopus-id: 2-s2.0-85140468346 | 0 | 0 |
| 18 | Continuous Tasks and the Asynchronous Computability Theorem | 2ᵒ autor: Rajsbaum S., Galeana H.R., Schmid U. | 2022 | Leibniz International Proceedings in Informatics, LIPIcs | Scopus-id: 2-s2.0-85123986384 | 0 | 5 |
| 19 | A Simplicial Model for KB4n: Epistemic Logic with Agents That May Die | Coautor y autor de correspondencia: Rajsbaum S., Goubault É., Ledent J. | 2022 | Leibniz International Proceedings in Informatics, LIPIcs | Scopus-id: 2-s2.0-85127196558 | 0 | 9 |
| 20 | Distributed Decision Problems: Concurrent Specifications Beyond Binary Relations | 1ᵉʳ autor y autor de correspondencia: Rajsbaum S. | 2022 | Leibniz International Proceedings in Informatics, LIPIcs | Scopus-id: 2-s2.0-85138693392 | 0 | 0 |
| 21 | A topological perspective on distributed network algorithms | Coautor: RAJSBAUM, SERGIO, Castaneda, Armando, Fraigniaud, Pierre, Paz, Ami, et al. | 2021 | THEORETICAL COMPUTER SCIENCE | WoS-id: 000595999200007 Scopus-id: 2-s2.0-85093698244 | 6 | 13 |
| 22 | A simplicial complex model for dynamic epistemic logic to study distributed task computability | Coautor y autor de correspondencia: Rajsbaum, Sergio, Goubault, Eric, Ledent, Jeremy | 2021 | INFORMATION AND COMPUTATION | WoS-id: 000648621000003 Scopus-id: 2-s2.0-85086516388 | 8 | 17 |
| 23 | A dynamic epistemic logic analysis of equality negation and other epistemic covering tasks | Coautor: RAJSBAUM, SERGIO, van Ditmarsch, Hans, Goubault, Eric, Lazic, Marijana, et al. | 2021 | JOURNAL OF LOGICAL AND ALGEBRAIC METHODS IN PROGRAMMING | WoS-id: 000653017200008 Scopus-id: 2-s2.0-85100731761 | 7 | 10 |
| 24 | Leader Election in Arbitrarily Connected Networks with Process Crashes and Weak Channel Reliability | 2ᵒ autor: Rajsbaum S., López C., Raynal M., Vargas K. | 2021 | Lecture Notes in Computer Science | WoS-id: 000891773700004 Scopus-id: 2-s2.0-85121880396 | 0 | 1 |
| 25 | A Distributed Computing Perspective of Unconditionally Secure Information Transmission in Russian Cards Problems | 1ᵉʳ autor y autor de correspondencia: Rajsbaum S. | 2021 | Lecture Notes in Computer Science | WoS-id: 001292788400016 Scopus-id: 2-s2.0-85111410270 | 2 | 1 |
| 26 | Information Exchange in the Russian Cards Problem | Coautor y autor de correspondencia: Rajsbaum S., Leyva-Acosta Z., Pascual-Aseff E. | 2021 | Lecture Notes in Computer Science | WoS-id: 001432415300025 Scopus-id: 2-s2.0-85119870287 | 0 | 1 |
| 27 | Relaxed Queues and Stacks from Read/Write Operations | 2ᵒ autor: Rajsbaum S., Castañeda A., Raynal M. | 2021 | Leibniz International Proceedings in Informatics, LIPIcs | Scopus-id: 2-s2.0-85101702111 | 0 | 6 |
| 28 | Locally Solvable Tasks and the Limitations of Valency Arguments | Coautor y autor de correspondencia: Rajsbaum S., Attiya H., Castañeda A. | 2021 | Leibniz International Proceedings in Informatics, LIPIcs | Scopus-id: 2-s2.0-85101713244 | 0 | 5 |
| 29 | Mastering concurrent computing through sequential thinking | 1ᵉʳ autor: Rajsbaum, Sergio, Raynal, Michel | 2020 | COMMUNICATIONS OF THE ACM | WoS-id: 000504424200019 Scopus-id: 2-s2.0-85077445082 | 8 | 8 |
| 30 | An Eventually Perfect Failure Detector for Networks of Arbitrary Topology Connected with ADD Channels Using Time-To-Live Values | 2ᵒ autor: Rajsbaum, Sergio, Vargas, Karla, Raynal, Michel | 2020 | Parallel Processing Letters | WoS-id: 000551536300001 Scopus-id: 2-s2.0-85091916057 | 0 | 1 |
| 31 | Indistinguishability | 2ᵒ autor y autor de correspondencia: RAJSBAUM, SERGIO, Attiya, Hagit | 2020 | COMMUNICATIONS OF THE ACM | WoS-id: 000582584700023 Scopus-id: 2-s2.0-85097502171 | 9 | 11 |
| 32 | Welcome | Coautor y autor de correspondencia: Rajsbaum S., Almeida V., Navarro G. | 2020 | COMMUNICATIONS OF THE ACM | WoS-id: 000585011100020 Scopus-id: 2-s2.0-85094928420 | 0 | 0 |
| 33 | A tour of dependable computing research in Latin America | Coautor: Rajsbaum S., Duarte E.P., Jr., MacÊdo R.J.A., et al. | 2020 | COMMUNICATIONS OF THE ACM | WoS-id: 000585011100034 Scopus-id: 2-s2.0-85094925451 | 0 | 0 |
| 34 | A perspective on theoretical computer science in Latin America | Coautor: Rajsbaum S., Kiwi M., Kohayakawa Y., Rodríguez-Henríquez F., et al. | 2020 | COMMUNICATIONS OF THE ACM | WoS-id: 000585011100035 Scopus-id: 2-s2.0-85094873393 | 0 | 0 |
| 35 | Perfect failure detection with very few bits | 2ᵒ autor: Rajsbaum S., Fraigniaud P., Travers C., Kuznetsov P., et al. | 2020 | INFORMATION AND COMPUTATION | WoS-id: 000595367200028 Scopus-id: 2-s2.0-85089667859 | 0 | 0 |
| 36 | A Dynamic Epistemic Logic Analysis of the Equality Negation Task | Coautor: Rajsbaum, Sergio, Goubault, Eric, Lazic, Marijana, Ledent, Jeremy | 2020 | Lecture Notes in Computer Science | WoS-id: 000654898800004 Scopus-id: 2-s2.0-85079087053 | 0 | 4 |
| 37 | Communication complexity of wait-free computability in dynamic networks | Coautor y autor de correspondencia: Rajsbaum S., Delporte-Gallet C., Fauconnier H. | 2020 | Lecture Notes in Computer Science | WoS-id: 001292786600017 Scopus-id: 2-s2.0-85089427032 | 7 | 5 |
| 38 | k-Immediate Snapshot and x-Set Agreement: How Are They Related? | Coautor: Rajsbaum S., Delporte C., Fauconnier H., Raynal M. | 2020 | Lecture Notes in Computer Science | WoS-id: 001432435500008 Scopus-id: 2-s2.0-85097641024 | 1 | 1 |
| 39 | Brief Announcements: Leader Election in the ADD Communication Model | 1ᵉʳ autor: Rajsbaum S., Raynal M., Vargas K. | 2020 | Lecture Notes in Computer Science | WoS-id: 001432435500018 Scopus-id: 2-s2.0-85097644051 | 1 | 0 |
| 40 | A lower bound on the number of opinions needed for fault-tolerant decentralized run-time monitoring | 2ᵒ autor: Rajsbaum S., Fraigniaud P., Travers C. | 2020 | Journal Of Applied And Computational Topology | Scopus-id: 2-s2.0-85113513719 | 0 | 7 |
| 41 | Geometric and Topological Methods in Computer Science (special 10th anniversary GETCO conference, 2018) | 1ᵉʳ autor: Rajsbaum S., Weinberger S. | 2020 | Journal Of Applied And Computational Topology | Scopus-id: 2-s2.0-85126336758 | 0 | 0 |
| 42 | Making Local Algorithms Wait-Free: the Case of Ring Coloring | Coautor: Rajsbaum S., Castañeda A., Delporte-Gallet C., Fauconnier H., et al. | 2019 | THEORY OF COMPUTING SYSTEMS | WoS-id: 000462524100009 Scopus-id: 2-s2.0-85019004769 | 4 | 6 |
| 43 | The topology of look-compute-move robot wait-free algorithms with hard termination | Coautor: Rajsbaum S., Alcántara M., Castañeda A., Flores-Peñaloza D. | 2019 | DISTRIBUTED COMPUTING | WoS-id: 000466887000004 Scopus-id: 2-s2.0-85058658712 | 7 | 13 |
| 44 | Synchronous t-Resilient Consensus in Arbitrary Graphs | Coautor: Rajsbaum, Sergio, Castañeda A., Fraigniaud, Pierre, Paz, Ami, et al. | 2019 | Lecture Notes in Computer Science | WoS-id: 000611526200003 Scopus-id: 2-s2.0-85076683335 | 3 | 3 |
| 45 | A Topological View of Partitioning Arguments: Reducing k-Set Agreement to Consensus | Coautor: Rajsbaum, Sergio, Rincon Galeana H., Winkler, Kyrill, Schmid, Ulrich | 2019 | Lecture Notes in Computer Science | WoS-id: 000611526200023 Scopus-id: 2-s2.0-85076707807 | 2 | 3 |
| 46 | A topological perspective on distributed network algorithms | Coautor: Rajsbaum S., Castañeda A., Fraigniaud P., Paz A., et al. | 2019 | Lecture Notes in Computer Science | WoS-id: 001292784100001 Scopus-id: 2-s2.0-85069831235 | 4 | 9 |
| 47 | An anonymous wait-free weak-set object implementation | Coautor: Rajsbaum S., Delporte-Gallet C., Fauconnier H., Yanagisawa N. | 2019 | Lecture Notes in Computer Science | Scopus-id: 2-s2.0-85059937359 | 0 | 0 |
| 48 | Wait-free solvability of equality negation tasks | Coautor: Rajsbaum S., Goubault É., Lazic M., Ledent J. | 2019 | Leibniz International Proceedings in Informatics, LIPIcs | Scopus-id: 2-s2.0-85074574794 | 0 | 8 |
| 49 | Implementing Snapshot Objects on Top of Crash-Prone Asynchronous Message-Passing Systems | Coautor: Rajsbaum, Sergio, Delporte-Gallet, Carole, Fauconnier, Hugues, Raynal, Michel | 2018 | IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS | WoS-id: 000441445500009 Scopus-id: 2-s2.0-85042718615 | 8 | 10 |
| 50 | Unifying concurrent objects and distributed tasks: Interval-linearizability | 2ᵒ autor: Rajsbaum S., Castañeda A., Raynal M. | 2018 | JOURNAL OF THE ACM | WoS-id: 000452840200011 Scopus-id: 2-s2.0-85057192587 | 21 | 29 |
| 51 | A Simplicial Complex Model for Dynamic Epistemic Logic to study Distributed Task Computability | Coautor y autor de correspondencia: Rajsbaum, Sergio, Goubault, Eric, Ledent, Jeremy | 2018 | ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE | WoS-id: 000465427100007 Scopus-id: 2-s2.0-85056285935 | 13 | 11 |
| 52 | Convergence and covering on graphs for wait-free robots | 2ᵒ autor: Rajsbaum S., Castañeda A., Roy M. | 2018 | Journal of the Brazilian Computer Society | Scopus-id: 2-s2.0-85041447390 | 0 | 10 |
| 53 | Collapsibility of read/write models using discrete morse theory | 2ᵒ autor y autor de correspondencia: Rajsbaum S., Benavides F. | 2018 | Journal Of Applied And Computational Topology | Scopus-id: 2-s2.0-85056268908 | 0 | 5 |
| 54 | A characterization of t-resilient colorless task anonymous solvability | Coautor: Rajsbaum S., Delporte-Gallet C., Fauconnier H., Yanagisawa N. | 2018 | Lecture Notes in Computer Science | Scopus-id: 2-s2.0-85061136237 | 0 | 3 |
| 55 | From wait-free to arbitrary concurrent solo executions in colorless distributed computing | 2ᵒ autor: Rajsbaum S., Herlihy M., Raynal M., Stainer J. | 2017 | THEORETICAL COMPUTER SCIENCE | WoS-id: 000403999800001 Scopus-id: 2-s2.0-85019113483 | 14 | 20 |
| 56 | Preface | 2ᵒ autor y autor de correspondencia: Rajsbaum, S., Kothapalli, K. | 2017 | THEORETICAL COMPUTER SCIENCE | WoS-id: 000405042500001 Scopus-id: 2-s2.0-85020734814 | 0 | 0 |
| 57 | Long-lived tasks | 2ᵒ autor: Rajsbaum S., Castañeda A., Raynal M. | 2017 | Lecture Notes in Computer Science | Scopus-id: 2-s2.0-85019675125 | 0 | 3 |
| 58 | Neighbor discovery in a sensor network with directional antennae | Coautor: Rajsbaum, Sergio, Du, Jingzhe, Kranakis, Evangelos, Ponce, Oscar Morales | 2016 | AD HOC & SENSOR WIRELESS NETWORKS | WoS-id: 000369882300006 Scopus-id: 2-s2.0-85000613740 | 4 | 6 |
| 59 | Generalized symmetry breaking tasks and nondeterminism in concurrent objects | Coautor: Rajsbaum, Sergio, Castaneda, Armando, Imbs, Damien, Raynal, Michel | 2016 | SIAM JOURNAL ON COMPUTING | WoS-id: 000375554000006 Scopus-id: 2-s2.0-84964852597 | 4 | 11 |
| 60 | Read/write shared memory abstraction on top of asynchronous Byzantine message-passing systems | 2ᵒ autor: Rajsbaum, Sergio, Imbs, Damien, Raynal, Michel, Stainer, Julien | 2016 | JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING | WoS-id: 000378759400001 Scopus-id: 2-s2.0-84964452130 | 5 | 11 |
| 61 | Asynchronous coordination under preferences and constraints | Coautor: Rajsbaum, Sergio, Castaneda, Armando, Fraigniaud, Pierre, Gafni, Eli, et al. | 2016 | Lecture Notes in Computer Science | WoS-id: 000389509800008 Scopus-id: 2-s2.0-84996605857 | 2 | 2 |
| 62 | t-resilient immediate snapshot is impossible | Coautor: Rajsbaum, Sergio, Delporte, Carole, Fauconnier, Hugues, Raynal, Michel | 2016 | Lecture Notes in Computer Science | WoS-id: 000389509800012 Scopus-id: 2-s2.0-84996606881 | 4 | 5 |
| 63 | Making local algorithms wait-free: The case of ring coloring | Coautor: Rajsbaum, Sergio, Castaneda, Armando, Delporte, Carole, Fauconnier, Hugues, et al. | 2016 | Lecture Notes in Computer Science | WoS-id: 000389510100009 Scopus-id: 2-s2.0-84995546009 | 0 | 0 |
| 64 | Perfect failure detection with very few bits | 2ᵒ autor: Rajsbaum, Sergio, Fraigniaud, Pierre, Travers, Corentin, Kuznetsov, Petr, et al. | 2016 | Lecture Notes in Computer Science | WoS-id: 000389510100013 Scopus-id: 2-s2.0-84995555585 | 2 | 4 |
| 65 | Implementing snapshot objects on top of crash-prone asynchronous message-passing systems | Coautor: Rajsbaum, Sergio, Delporte-Gallet, Carole, Fauconnier, Hugues, Raynal, Michel | 2016 | Lecture Notes in Computer Science | WoS-id: 000389797300026 Scopus-id: 2-s2.0-85007202893 | 2 | 3 |
| 66 | Challenges in fault-tolerant distributed runtime verification | Coautor: Rajsbaum, Sergio, Bonakdarpour, Borzoo, Fraigniaud, Pierre, Travers, Corentin | 2016 | Lecture Notes in Computer Science | WoS-id: 000389942800027 Scopus-id: 2-s2.0-84993929558 | 10 | 14 |
| 67 | Two Convergence Problems for Robots on Graphs | 2ᵒ autor: Rajsbaum, Sergio, Castaneda, Armando, Roy, Matthieu | 2016 | Latin-American Symposium On Dependable Computing Ladc | WoS-id: 000391209800010 Scopus-id: 2-s2.0-85013194839 | 1 | 3 |
| 68 | The read/write protocol complex is collapsible | 2ᵒ autor y autor de correspondencia: Rajsbaum S., Benavides F. | 2016 | Lecture Notes in Computer Science | Scopus-id: 2-s2.0-84961689603 | 0 | 3 |
| 69 | Minimizing the number of opinions for fault-tolerant distributed decision using well-quasi orderings | 2ᵒ autor: Rajsbaum S., Fraigniaud P., Travers C. | 2016 | Lecture Notes in Computer Science | Scopus-id: 2-s2.0-84961727482 | 0 | 6 |
| 70 | Decentralized asynchronous crash-resilient Runtime Verification | Coautor: Rajsbaum, S., Bonakdarpour, B., Fraigniaud, P., Rosenblueth, D.A., et al. | 2016 | Leibniz International Proceedings in Informatics, LIPIcs | Scopus-id: 2-s2.0-85012929020 | 0 | 21 |
| 71 | Linear space bootstrap communication schemes | Coautor: Rajsbaum S., Delporte-Gallet C., Fauconnier H., Gafni E. | 2015 | THEORETICAL COMPUTER SCIENCE | WoS-id: 000347601700005 Scopus-id: 2-s2.0-84927942616 | 4 | 8 |
| 72 | Specifying concurrent problems: Beyond linearizability and up to tasks: (Extended Abstract) | 2ᵒ autor: Rajsbaum S., Castañeda A., Raynal M. | 2015 | Lecture Notes in Computer Science | WoS-id: 000373818200028 Scopus-id: 2-s2.0-84946091533 | 17 | 27 |
| 73 | Untangling partial agreement: Iterated x-consensus simulations | 2ᵒ autor: Rajsbaum S., Imbs D., Valle A. | 2015 | Lecture Notes in Computer Science | Scopus-id: 2-s2.0-84943650412 | 0 | 4 |
| 74 | Distributed runtime verification: Where combinatorics, fault-tolerance and formal methods meet | 1ᵉʳ autor y autor de correspondencia: Rajsbaum S. | 2015 | Lecture Notes in Computer Science | Scopus-id: 2-s2.0-84943651839 | 0 | 0 |
| 75 | An Equivariance Theorem with Applications to Renaming | Coautor y autor de correspondencia: Rajsbaum S., Castañeda A., Herlihy M. | 2014 | Algorithmica | WoS-id: 000339935200003 Scopus-id: 2-s2.0-84905594767 | 1 | 2 |
| 76 | Computing in the Presence of Concurrent Solo Executions | 2ᵒ autor: Rajsbaum S., Herlihy M., Raynal M., Stainer J. | 2014 | Lecture Notes in Computer Science | WoS-id: 000342804300019 Scopus-id: 2-s2.0-84899958853 | 7 | 9 |
| 77 | Reliable Shared Memory Abstraction on Top of Asynchronous Byzantine Message-Passing Systems | 2ᵒ autor: Rajsbaum S., Imbs D., Raynal M., Stainer J. | 2014 | Lecture Notes in Computer Science | WoS-id: 000345594800007 Scopus-id: 2-s2.0-84958543983 | 1 | 4 |
| 78 | The Complexity Gap between Consensus and Safe-Consensus | 2ᵒ autor y autor de correspondencia: Rajsbaum, Sergio, Conde, Rodolfo | 2014 | Lecture Notes in Computer Science | WoS-id: 000345594800009 Scopus-id: 2-s2.0-84958532214 | 5 | 5 |
| 79 | Automatically Adjusting Concurrency to the Level of Synchrony | Coautor: Rajsbaum S., Fraigniaud P., Gafni E., Roy M. | 2014 | Lecture Notes in Computer Science | WoS-id: 000354534900001 Scopus-id: 2-s2.0-84910614900 | 3 | 5 |
| 80 | The Opinion Number of Set-Agreement | 2ᵒ autor: Rajsbaum S., Fraigniaud P., Roy M., Travers C. | 2014 | Lecture Notes in Computer Science | WoS-id: 000354774800011 Scopus-id: 2-s2.0-84917707400 | 6 | 10 |
| 81 | On the Number of Opinions Needed for Fault-Tolerant Run-Time Monitoring in Distributed Systems | 2ᵒ autor: Rajsbaum S., Fraigniaud P., Travers C. | 2014 | Lecture Notes in Computer Science | WoS-id: 000358524900009 Scopus-id: 2-s2.0-84921684341 | 20 | 30 |
| 82 | Message from the technical program chairs | Coautor: Rajsbaum S., Chatterjee M., Cao J., Kothapalli K. | 2014 | Lecture Notes in Computer Science | Scopus-id: 2-s2.0-84893088761 | 0 | 0 |
| 83 | The topology of distributed adversaries | 2ᵒ autor y autor de correspondencia: Rajsbaum, S, Herlihy, M | 2013 | DISTRIBUTED COMPUTING | WoS-id: 000320061500004 Scopus-id: 2-s2.0-84878997044 | 11 | 19 |
| 84 | Locality and checkability in wait-free computing | 2ᵒ autor: Rajsbaum S., Fraigniaud P., Travers C. | 2013 | DISTRIBUTED COMPUTING | WoS-id: 000322027500004 Scopus-id: 2-s2.0-84880922077 | 22 | 31 |
| 85 | Power and limits of distributed computing shared memory models | 2ᵒ autor: Rajsbaum S., Herlihy M., Raynal M. | 2013 | THEORETICAL COMPUTER SCIENCE | WoS-id: 000327806300002 Scopus-id: 2-s2.0-84887319968 | 24 | 26 |
| 86 | Agreement via Symmetry Breaking: On the Structure of Weak Subconsensus Tasks | 2ᵒ autor: Rajsbaum S., Castañeda A., Raynal M. | 2013 | Proceedings - Ieee 27th International Parallel And Distributed Processing Symposium, Ipdps 2013 | WoS-id: 000332828000098 Scopus-id: 2-s2.0-84884894405 | 1 | 2 |
| 87 | Brief announcement: Computing in the presence of concurrent solo executions | 1ᵉʳ autor: Rajsbaum S., Raynal M., Stainer J. | 2013 | Lecture Notes in Computer Science | WoS-id: 000337592900043 Scopus-id: 2-s2.0-84893727832 | 0 | 0 |
| 88 | Linear space bootstrap communication schemes | Coautor: Rajsbaum S., Delporte-Gallet C., Fauconnier H., Gafni E. | 2013 | Lecture Notes in Computer Science | Scopus-id: 2-s2.0-84883172237 | 0 | 3 |
| 89 | Black art: Obstruction-free k-set agreement with |MWMR registers| < |proccesses| | Coautor: Rajsbaum S., Delporte-Gallet C., Fauconnier H., Gafni E. | 2013 | Lecture Notes in Computer Science | Scopus-id: 2-s2.0-84883190613 | 0 | 11 |
| 90 | The 2013 Edsger W. Dijkstra prize in distributed computing | Coautor: Rajsbaum S., Afek Y., Ellen F., Patt-Shamir B., et al. | 2013 | Lecture Notes in Computer Science | Scopus-id: 2-s2.0-84893760722 | 0 | 0 |
| 91 | New Combinatorial Topology Bounds for Renaming: The Upper Bound | 2ᵒ autor y autor de correspondencia: Rajsbaum, S, Castaneda, A | 2012 | JOURNAL OF THE ACM | WoS-id: 000300902200003 Scopus-id: 2-s2.0-84859051444 | 28 | 43 |
| 92 | Neighbor discovery in a sensor network with directional antennae | Coautor: Rajsbaum S., Du J., Kranakis E., Ponce O.M. | 2012 | Lecture Notes in Computer Science | Scopus-id: 2-s2.0-84857347161 | 0 | 39 |
| 93 | Renaming is weaker than set agreement but for perfect renaming: A map of sub-consensus tasks | Coautor: Rajsbaum S., Castañeda A., Imbs D., Raynal M. | 2012 | Lecture Notes in Computer Science | Scopus-id: 2-s2.0-84860804970 | 0 | 12 |
| 94 | An equivariance theorem with applications to renaming | Coautor y autor de correspondencia: Rajsbaum S., Castañeda A., Herlihy M. | 2012 | Lecture Notes in Computer Science | Scopus-id: 2-s2.0-84860814667 | 0 | 7 |
| 95 | An introduction to the topological theory of distributed computing with safe-consensus | 2ᵒ autor y autor de correspondencia: Rajsbaum S., Conde R. | 2012 | Electronic Notes in Theoretical Computer Science | Scopus-id: 2-s2.0-84862004151 | 0 | 9 |
| 96 | An inductive-style procedure for counting monochromatic simplexes of symmetric subdivisions with applications to distributed computing | 2ᵒ autor y autor de correspondencia: Rajsbaum S., Castañeda A. | 2012 | Electronic Notes in Theoretical Computer Science | Scopus-id: 2-s2.0-84862025771 | 0 | 1 |
| 97 | The impossibility of boosting distributed service resilience | Coautor: Rajsbaum S., Attie P., Guerraoui R., Kuznetsov P., et al. | 2011 | INFORMATION AND COMPUTATION | WoS-id: 000291293800003 Scopus-id: 2-s2.0-79952603732 | 0 | 0 |
| 98 | Some problems in distributed computational geometry | 1ᵉʳ autor: Rajsbaum, S, Urrutia, J | 2011 | THEORETICAL COMPUTER SCIENCE | WoS-id: 000295498100011 Scopus-id: 2-s2.0-80052259473 | 4 | 5 |
| 99 | A theory-oriented introduction to wait-free synchronization based on the adaptive renaming problem | 1ᵉʳ autor: Rajsbaum S., Raynal M. | 2011 | Proceedings - International Conference on Advanced Information Networking and Applications, AINA | WoS-id: 000299083800047 Scopus-id: 2-s2.0-79957731177 | 2 | 3 |
| 100 | The renaming problem in shared memory systems: An introduction | 2ᵒ autor: Rajsbaum S., Castañeda A., Raynal M. | 2011 | Computer Science Review | Scopus-id: 2-s2.0-79957944774 | 0 | 50 |
| 101 | A survey on some recent advances in shared memory models | 1ᵉʳ autor: Rajsbaum S., Raynal M. | 2011 | Lecture Notes in Computer Science | Scopus-id: 2-s2.0-79961140401 | 0 | 1 |
| 102 | The universe of symmetry breaking tasks | 2ᵒ autor: Rajsbaum S., Imbs D., Raynal M. | 2011 | Lecture Notes in Computer Science | Scopus-id: 2-s2.0-79961151951 | 0 | 16 |
| 103 | Locality and checkability in wait-free computing | 2ᵒ autor: Rajsbaum S., Fraigniaud P., Travers C. | 2011 | Lecture Notes in Computer Science | Scopus-id: 2-s2.0-80055044950 | 0 | 17 |
| 104 | The k-simultaneous consensus problem | Coautor: Rajsbaum S., Afek Y., Gafni E., Raynal M., et al. | 2010 | DISTRIBUTED COMPUTING | WoS-id: 000275146300004 Scopus-id: 2-s2.0-77649271848 | 19 | 24 |
| 105 | Average long-lived binary consensus: Quantifying the stabilizing role played by memory | 2ᵒ autor: Rajsbaum S., Becker F., Rapaport I., Rémila E. | 2010 | THEORETICAL COMPUTER SCIENCE | WoS-id: 000275934200003 Scopus-id: 2-s2.0-76849088178 | 1 | 3 |
| 106 | New combinatorial topology bounds for renaming: the lower bound | 2ᵒ autor y autor de correspondencia: Rajsbaum, S, Castaneda, A | 2010 | DISTRIBUTED COMPUTING | WoS-id: 000280553200002 Scopus-id: 2-s2.0-79957953985 | 30 | 48 |
| 107 | Iterated shared memory models (invited talk) | 1ᵉʳ autor y autor de correspondencia: Rajsbaum S. | 2010 | Lecture Notes in Computer Science | Scopus-id: 2-s2.0-77953501725 | 0 | 23 |
| 108 | Recursion in distributed computing | 2ᵒ autor y autor de correspondencia: Rajsbaum S., Gafni E. | 2010 | Lecture Notes in Computer Science | Scopus-id: 2-s2.0-78249287260 | 0 | 25 |
| 109 | Concurrent computing and shellable complexes | 2ᵒ autor y autor de correspondencia: Rajsbaum S., Herlihy M. | 2010 | Lecture Notes in Computer Science | Scopus-id: 2-s2.0-78649855158 | 0 | 9 |
| 110 | Distributed programming with tasks | 2ᵒ autor y autor de correspondencia: Rajsbaum S., Gafni E. | 2010 | Lecture Notes in Computer Science | Scopus-id: 2-s2.0-78650873500 | 0 | 37 |
| 111 | An Axiomatic Approach to Computing the Connectivity of Synchronous and Asynchronous Systems | 2ᵒ autor: Rajsbaum S., Herlihy M., Tuttle M. | 2009 | Electronic Notes in Theoretical Computer Science | Scopus-id: 2-s2.0-62649105311 | 0 | 15 |
| 112 | Stability of Multi-Valued Continuous Consensus | Coautor y autor de correspondencia: Rajsbaum S., Davidovitch L., Dolev S. | 2009 | Electronic Notes in Theoretical Computer Science | Scopus-id: 2-s2.0-62649158422 | 0 | 0 |
| 113 | Bit complexity of breaking and achieving symmetry in chains and rings | Coautor y autor de correspondencia: Rajsbaum S., Dinitz Y., Moran S. | 2008 | JOURNAL OF THE ACM | WoS-id: 000253939800003 Scopus-id: 2-s2.0-40549087910 | 17 | 18 |
| 114 | On the computability power and the robustness of set agreement-oriented failure detector classes | 2ᵒ autor: Rajsbaum, S, Mostefaoui, A, Raynal, M, Travers, C | 2008 | DISTRIBUTED COMPUTING | WoS-id: 000258243400003 Scopus-id: 2-s2.0-49149095043 | 16 | 15 |
| 115 | An impossibility about failure detectors in the iterated immediate snapshot model | 1ᵉʳ autor: Rajsbaum S., Raynal M., Travers C. | 2008 | INFORMATION PROCESSING LETTERS | WoS-id: 000259955300016 Scopus-id: 2-s2.0-51249088380 | 9 | 13 |
| 116 | THE COMBINED POWER OF CONDITIONS AND INFORMATION ON FAILURES TO SOLVE ASYNCHRONOUS SET AGREEMENT | 2ᵒ autor: Rajsbaum, S, Mostefaoui, A, Raynal, M, Travers, C | 2008 | SIAM JOURNAL ON COMPUTING | WoS-id: 000261891600016 | 12 | 0 |
| 117 | The iterated restricted immediate snapshot model | 1ᵉʳ autor: Rajsbaum S., Raynal M., Travers C. | 2008 | Lecture Notes in Computer Science | Scopus-id: 2-s2.0-48249096679 | 0 | 31 |
| 118 | Average binary long-lived consensus: Quantifying the stabilizing role played by memory | 2ᵒ autor: Rajsbaum S., Becker F., Rapaport I., Rémila É. | 2008 | Lecture Notes in Computer Science | Scopus-id: 2-s2.0-48349136557 | 0 | 2 |
| 119 | The 2008 Edsger W. Dijkstra prize in distributed computing | Coautor: Rajsbaum S., Afek Y., Ellen F., Kutten S., et al. | 2008 | Lecture Notes in Computer Science | Scopus-id: 2-s2.0-56449100044 | 0 | 0 |
| 120 | From {white diamond suit} W to O: A simple bounded quiescent reliable broadcast-based transformation | 2ᵒ autor: Rajsbaum S., Mostefaoui A., Raynal M., Travers C. | 2007 | JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING | WoS-id: 000243614700009 Scopus-id: 2-s2.0-37849188430 | 7 | 7 |
| 121 | Asynchronous agreement and its relation with error-correcting codes | Coautor: Rajsbaum S., Friedman R., Mostefaoui A., Raynal M. | 2007 | IEEE T COMPUT | WoS-id: 000246651400001 Scopus-id: 2-s2.0-34547868820 | 26 | 32 |
| 122 | Stability of multivalued continuous consensus | Coautor y autor de correspondencia: Rajsbaum S., Davidovitch L., Dolev S. | 2007 | SIAM JOURNAL ON COMPUTING | WoS-id: 000252844100005 Scopus-id: 2-s2.0-49449109462 | 6 | 8 |
| 123 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics: Foreword | 1ᵉʳ autor y autor de correspondencia: Rajsbaum S. | 2007 | Lecture Notes in Computer Science | Scopus-id: 2-s2.0-38149055781 | 0 | 0 |
| 124 | The committee decision problem | 2ᵒ autor: Rajsbaum S., Gafni E., Raynal M., Travers C. | 2006 | Lecture Notes in Computer Science | WoS-id: 000236886100047 Scopus-id: 2-s2.0-33745633339 | 11 | 11 |
| 125 | Synchronous condition-based consensus | 2ᵒ autor: Rajsbaum S., Mostefaoui A., Raynal M. | 2006 | DISTRIBUTED COMPUTING | WoS-id: 000237023500001 Scopus-id: 2-s2.0-33646496815 | 13 | 16 |
| 126 | Algorithmic problems in distributed systems | 2ᵒ autor y autor de correspondencia: Rajsbaum S., De Prisco R. | 2006 | COMPUTER NETWORKS | WoS-id: 000237993700011 Scopus-id: 2-s2.0-33646358926 | 0 | 0 |
| 127 | Cyclic storage for fault-tolerant distributed executions | 2ᵒ autor: Rajsbaum S., Marcelín-Jiménez R., Stevens B. | 2006 | IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS | WoS-id: 000239249800012 Scopus-id: 2-s2.0-33747600124 | 7 | 6 |
| 128 | Mobile agent rendezvous: A survey | Coautor y autor de correspondencia: Rajsbaum S., Kranakis E., Krizanc D. | 2006 | Lecture Notes in Computer Science | Scopus-id: 2-s2.0-33746324581 | 0 | 67 |
| 129 | From failure detectors with limited scope accuracy to system-wide leadership | 2ᵒ autor: Rajsbaum S., Mostefaoui A., Raynal M., Travers C. | 2006 | Proceedings - International Conference on Advanced Information Networking and Applications, AINA | Scopus-id: 2-s2.0-33751078867 | 0 | 0 |
| 130 | Subconsensus tasks: Renaming is weaker than set agreement | 2ᵒ autor: Rajsbaum S., Gafni E., Herlihy M. | 2006 | Lecture Notes in Computer Science | Scopus-id: 2-s2.0-33845228641 | 0 | 60 |
| 131 | 2006 Seventh Mexican International Conference on Computer Science, ENC 2006: Preface | 1ᵉʳ autor y autor de correspondencia: Rajsbaum S. | 2006 | Proceedings of the Mexican Conference on Computer Science | Scopus-id: 2-s2.0-34547422277 | 0 | 0 |
| 132 | The reduced automata technique for graph exploration space lower bounds | Coautor: Rajsbaum S., Fraigniaud P., Ilcinkas D., Tixeuil S. | 2006 | Lecture Notes in Computer Science | Scopus-id: 2-s2.0-37149000541 | 0 | 10 |
| 133 | Simultaneous consensus tasks: A tighter characterization of set-consensus | Coautor: Rajsbaum S., Afek Y., Gafni E., Raynal M., et al. | 2006 | Lecture Notes in Computer Science | Scopus-id: 2-s2.0-84885192779 | 0 | 13 |
| 134 | Object-oriented algorithm analysis and design with Java | 1ᵉʳ autor: Rajsbaum S., Viso E. | 2005 | SCIENCE OF COMPUTER PROGRAMMING | WoS-id: 000225138500003 Scopus-id: 2-s2.0-7544250806 | 1 | 3 |
| 135 | PODC 2003 Special Issue | 1ᵉʳ autor y autor de correspondencia: Rajsbaum S. | 2005 | DISTRIBUTED COMPUTING | WoS-id: 000229022200001 Scopus-id: 2-s2.0-18744409800 | 0 | 0 |
| 136 | Space lower bounds for graph exploration via reduced automata | Coautor: Rajsbaum S., Fraigniaud P., Ilcinkas D., Tixeuil S. | 2005 | Lecture Notes in Computer Science | Scopus-id: 2-s2.0-24944488808 | 0 | 11 |
| 137 | The impossibility of boosting distributed service resilience | Coautor: Rajsbaum S., Attie P., Guerraoui R., Kouznetsov P., et al. | 2005 | Proceedings - International Conference on Distributed Computing Systems | Scopus-id: 2-s2.0-27944465381 | 0 | 9 |
| 138 | The combined power of conditions and failure detectors to solve asynchronous set agreement | 2ᵒ autor: Rajsbaum S., Mostefaoui A., Raynal M. | 2005 | Proceedings Of The Annual Acm Symposium On Principles Of Distributed Computing | Scopus-id: 2-s2.0-32344433874 | 0 | 13 |
| 139 | Musical benches | 2ᵒ autor y autor de correspondencia: Rajsbaum S., Gafni E. | 2005 | Lecture Notes in Computer Science | Scopus-id: 2-s2.0-33646396743 | 0 | 12 |
| 140 | Condition-based consensus solvability: A hierarchy of conditions and efficient protocols | 2ᵒ autor: Rajsbaum S., Mostéfaoui A., Raynal M., Roy M. | 2004 | DISTRIBUTED COMPUTING | WoS-id: 000189199100001 Scopus-id: 2-s2.0-12144287021 | 16 | 20 |
| 141 | The synchronous condition-based consensus hierarchy | 2ᵒ autor: Rajsbaum S., Mostefaoui A., Raynal M. | 2004 | Lecture Notes in Computer Science | Scopus-id: 2-s2.0-35048887207 | 0 | 7 |
| 142 | A simple proof of the uniform consensus synchronous lower bound | 2ᵒ autor y autor de correspondencia: Rajsbaum S., Keidar I. | 2003 | INFORMATION PROCESSING LETTERS | WoS-id: 000180370700008 Scopus-id: 2-s2.0-0037448292 | 32 | 48 |
| 143 | A classification of wait-free loop agreement tasks | 2ᵒ autor y autor de correspondencia: Rajsbaum S., Herlihy M. | 2003 | THEORETICAL COMPUTER SCIENCE | WoS-id: 000180738300004 Scopus-id: 2-s2.0-0037417716 | 28 | 39 |
| 144 | Stability of long-lived consensus | 2ᵒ autor y autor de correspondencia: Rajsbaum S., Dolev S. | 2003 | J COMPUT SYST SCI | WoS-id: 000184240900002 Scopus-id: 2-s2.0-0043021909 | 14 | 16 |
| 145 | Distributed Computing: Introduction | 2ᵒ autor y autor de correspondencia: Rajsbaum S., Attiya H. | 2003 | DISTRIBUTED COMPUTING | WoS-id: 000185598300001 Scopus-id: 2-s2.0-0141498459 | 0 | 0 |
| 146 | VHDLA flexible simulator for distributed algorithms | Coautor y autor de correspondencia: Rajsbaum S., Marcelín-Jiménez R., Esquivel-Villafaña R. | 2003 | Proceedings of the Mexican Conference on Computer Science | WoS-id: 000185894500030 Scopus-id: 2-s2.0-84942881450 | 4 | 6 |
| 147 | Conditions on input vectors for consensus solvability in asynchronous distributed systems | 2ᵒ autor: Rajsbaum S., Mostefaoui A., Raynal M. | 2003 | JOURNAL OF THE ACM | WoS-id: 000186728500004 Scopus-id: 2-s2.0-4243070797 | 53 | 64 |
| 148 | Cyclic strategies for balanced and fault-tolerant distributed storage | 2ᵒ autor y autor de correspondencia: Rajsbaum S., Marcelín-Jiménez R. | 2003 | Lecture Notes in Computer Science | Scopus-id: 2-s2.0-0142156607 | 0 | 3 |
| 149 | On the cost of fault-tolerant consensus when there are no faults - A tutorial | 2ᵒ autor y autor de correspondencia: Rajsbaum S., Keidar I. | 2003 | Lecture Notes in Computer Science | Scopus-id: 2-s2.0-0142187698 | 0 | 5 |
| 150 | Exact communication costs for consensus and leader in a tree | Coautor y autor de correspondencia: Rajsbaum S., Dinitz Y., Moran S. | 2003 | Journal of Discrete Algorithms | Scopus-id: 2-s2.0-24944571286 | 0 | 7 |
| 151 | Open questions on consensus performance in well-behaved runs | 2ᵒ autor y autor de correspondencia: Rajsbaum S., Keidar I. | 2003 | Lecture Notes in Computer Science | Scopus-id: 2-s2.0-35248832655 | 0 | 8 |
| 152 | A hierarchy of conditions for asynchronous interactive consistency | 2ᵒ autor: Rajsbaum S., Mostefaoui A., Raynal M., Roy M. | 2003 | Lecture Notes in Computer Science | Scopus-id: 2-s2.0-35248836615 | 0 | 1 |
| 153 | Using conditions to expedite consensus in synchronous distributed systems | 2ᵒ autor: Rajsbaum S., Mostefaoui A., Raynal M. | 2003 | Lecture Notes in Computer Science | Scopus-id: 2-s2.0-35248869308 | 0 | 13 |
| 154 | Using error-correcting codes to solve distributed agreement problems: A future direction in distributed computing? | Coautor: Rajsbaum S., Friedman R., Mostéfaoui A., Raynal M. | 2003 | Lecture Notes in Computer Science | Scopus-id: 2-s2.0-35248898101 | 0 | 0 |
| 155 | A layered analysis of consensus | 2ᵒ autor y autor de correspondencia: Rajsbaum S., Moses Y. | 2002 | SIAM JOURNAL ON COMPUTING | WoS-id: 000175899100001 Scopus-id: 2-s2.0-0036520617 | 73 | 87 |
| 156 | The combinatorial structure of wait-free solvable tasks | 2ᵒ autor y autor de correspondencia: Rajsbaum S., Attiya H. | 2002 | SIAM JOURNAL ON COMPUTING | WoS-id: 000175899100013 Scopus-id: 2-s2.0-0036520251 | 39 | 50 |
| 157 | A versatile and modular consensus protocol | 2ᵒ autor: Rajsbaum S., Mostefaoui A., Raynal M. | 2002 | Proceedings Of The 2002 International Conference On Dependable Systems And Networks | WoS-id: 000177134700039 Scopus-id: 2-s2.0-0036927272 | 8 | 12 |
| 158 | Brief announcement: Asynchronous interactive consistency and its relation with error-correcting codes | 2ᵒ autor: Rajsbaum S., Mostefaoui A., Raynal M. | 2002 | Proceedings Of The Annual Acm Symposium On Principles Of Distributed Computing | Scopus-id: 2-s2.0-0036949081 | 0 | 1 |
| 159 | Distributed agreement and its relation with error-correcting codes | Coautor: Rajsbaum S., Friedman R., Mostéfaoui A., Raynal M. | 2002 | Lecture Notes in Computer Science | Scopus-id: 2-s2.0-56249087010 | 0 | 17 |
| 160 | Condition-based protocols for set agreement problems | 2ᵒ autor: Rajsbaum S., Mostéfaoui A., Raynal M., Roy M. | 2002 | Lecture Notes in Computer Science | Scopus-id: 2-s2.0-84947225880 | 0 | 14 |
| 161 | The BG distributed simulation algorithm | Coautor: Rajsbaum S., Borowsky E., Gafni E., Lynch N. | 2001 | DISTRIBUTED COMPUTING | WoS-id: 000170335900001 Scopus-id: 2-s2.0-0035390412 | 71 | 100 |
| 162 | A hierarchy of conditions for consensus solvability | 2ᵒ autor: Rajsbaum S., Mostefaoui A., Raynal M., Roy M. | 2001 | Proceedings Of The Annual Acm Symposium On Principles Of Distributed Computing | Scopus-id: 2-s2.0-0034782130 | 0 | 14 |
| 163 | Conditions on input vectors for consensus solvability in asynchronous distributed systems | 2ᵒ autor: Rajsbaum S., Mostefaoui A., Raynal M. | 2001 | Conference Proceedings of the Annual ACM Symposium on Theory of Computing | Scopus-id: 2-s2.0-0034833012 | 0 | 31 |
| 164 | A new synchronous lower bound for set agreement | 2ᵒ autor: Rajsbaum S., Herlihy M., Tuttle M. | 2001 | Lecture Notes in Computer Science | Scopus-id: 2-s2.0-84956994752 | 0 | 2 |
| 165 | Stability of long-lived consensus | 2ᵒ autor y autor de correspondencia: Rajsbaum Sergio, Dolev Shlomi | 2000 | Proceedings Of The Annual Acm Symposium On Principles Of Distributed Computing | Scopus-id: 2-s2.0-0034515950 | 0 | 5 |
| 166 | Bit complexity of breaking and achieving symmetry in chains and rings | Coautor y autor de correspondencia: Rajsbaum Sergio, Dinitz Yefim, Moran Shlomo | 1999 | Conference Proceedings of the Annual ACM Symposium on Theory of Computing | Scopus-id: 2-s2.0-0032654632 | 0 | 4 |
| 167 | On mixed connectivity certificates | Coautor y autor de correspondencia: Rajsbaum S., Even S., Itkis G. | 1998 | THEORETICAL COMPUTER SCIENCE | WoS-id: 000074672600005 Scopus-id: 2-s2.0-0347810444 | 6 | 5 |
| 168 | Unified structure of consensus: A layered analysis approach | 2ᵒ autor y autor de correspondencia: Rajsbaum Sergio, Moses Yoram | 1998 | Proceedings Of The Annual Acm Symposium On Principles Of Distributed Computing | Scopus-id: 2-s2.0-0031624073 | 0 | 19 |
| 169 | Unifying synchronous and asynchronous message-passing models | 2ᵒ autor: Rajsbaum Sergio, Herlihy Maurice, Tuttle Mark R. | 1998 | Proceedings Of The Annual Acm Symposium On Principles Of Distributed Computing | Scopus-id: 2-s2.0-0031636410 | 0 | 56 |
| 170 | A wait-free classification of loop agreement tasks | 2ᵒ autor y autor de correspondencia: Rajsbaum S., Herlihy M. | 1998 | Lecture Notes in Computer Science | Scopus-id: 2-s2.0-84947921483 | 0 | 4 |
| 171 | Decidability of distributed decision tasks | 2ᵒ autor y autor de correspondencia: Rajsbaum Sergio, Herlihy Maurice | 1997 | Conference Proceedings of the Annual ACM Symposium on Theory of Computing | Scopus-id: 2-s2.0-0030713848 | 0 | 68 |
| 172 | The use of a synchronizer yields the maximum computation rate in distributed networks | 2ᵒ autor y autor de correspondencia: Rajsbaum S., Even S. | 1997 | THEORY OF COMPUTING SYSTEMS | Scopus-id: 2-s2.0-0031215285 | 0 | 5 |
| 173 | Cycle-pancyclism in tournaments III | 2ᵒ autor y autor de correspondencia: Rajsbaum S., Galeana-Sánchez H. | 1997 | GRAPHS AND COMBINATORICS | WoS-id: A1997WK77000005 Scopus-id: 2-s2.0-27144448142 | 1 | 0 |
| 174 | On the Borowsky-Gafni simulation algorithm | 2ᵒ autor y autor de correspondencia: Rajsbaum Sergio, Lynch Nancy | 1996 | Proceedings Of The Annual Acm Symposium On Principles Of Distributed Computing | Scopus-id: 2-s2.0-0029702988 | 0 | 2 |
| 175 | On the decidability of distributed decision tasks | 2ᵒ autor y autor de correspondencia: Rajsbaum Sergio, Herlihy Maurice | 1996 | Proceedings Of The Annual Acm Symposium On Principles Of Distributed Computing | Scopus-id: 2-s2.0-0029714902 | 0 | 2 |
| 176 | Optimal clock synchronization under different delay assumptions | Coautor y autor de correspondencia: Rajsbaum S., Attiya H., Herzberg A. | 1996 | SIAM JOURNAL ON COMPUTING | WoS-id: A1996UC92600009 Scopus-id: 2-s2.0-0030126543 | 15 | 22 |
| 177 | Cycle-pancyclism in tournaments II | 2ᵒ autor y autor de correspondencia: Rajsbaum S., Galeana-Sánchez H. | 1996 | GRAPHS AND COMBINATORICS | WoS-id: A1996UA25100002 Scopus-id: 2-s2.0-25644445272 | 2 | 0 |
| 178 | The combinatorial structure of wait-free solvable tasks | 2ᵒ autor y autor de correspondencia: Rajsbaum S., Attiya H. | 1996 | Lecture Notes in Computer Science | Scopus-id: 2-s2.0-84955609444 | 0 | 8 |
| 179 | Unison, canon, and sluggish clocks in networks controlled by a synchronizer | 2ᵒ autor y autor de correspondencia: Rajsbaum S., Even S. | 1995 | MATH SYST THEORY | WoS-id: A1995RM02100003 Scopus-id: 2-s2.0-0000341601 | 9 | 12 |
| 180 | Algebraic spans | 2ᵒ autor y autor de correspondencia: Rajsbaum Sergio, Herlihy Maurice | 1995 | Proceedings Of The Annual Acm Symposium On Principles Of Distributed Computing | Scopus-id: 2-s2.0-0029201526 | 0 | 15 |
| 181 | Cycle-pancyclism in tournaments I | 2ᵒ autor y autor de correspondencia: Rajsbaum S., Galeana-Sánchez H. | 1995 | GRAPHS AND COMBINATORICS | WoS-id: A1995RX60500004 Scopus-id: 2-s2.0-27144539061 | 2 | 1 |
| 182 | On mixed connectivity certificates | Coautor y autor de correspondencia: Rajsbaum S., Even S., Itkis G. | 1995 | Lecture Notes in Computer Science | Scopus-id: 2-s2.0-84947755298 | 0 | 3 |
| 183 | Theory of clock synchronization | 2ᵒ autor y autor de correspondencia: Rajsbaum Sergio, Patt-Shamir Boaz | 1994 | Conference Proceedings of the Annual ACM Symposium on Theory of Computing | Scopus-id: 2-s2.0-0028013946 | 0 | 55 |
| 184 | Upper and lower bounds for stochastic marked graphs | 1ᵉʳ autor y autor de correspondencia: Rajsbaum S. | 1994 | INFORMATION PROCESSING LETTERS | WoS-id: A1994ND86300005 Scopus-id: 2-s2.0-0028386586 | 7 | 10 |
| 185 | On the Performance of Synchronized Programs in Distributed Networks with Random Processing Times and Transmission Delays | 1ᵉʳ autor: Rajsbaum S., Sidi M. | 1994 | IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS | WoS-id: A1994PC99200004 Scopus-id: 2-s2.0-0028497069 | 11 | 19 |
| 186 | Tentative and definite distributed computations: an optimistic approach to network synchronization | Coautor: Rajsbaum S., Garofalakis J., Spirakis P., Tampakas B. | 1994 | THEORETICAL COMPUTER SCIENCE | WoS-id: A1994NT95700004 Scopus-id: 2-s2.0-0028766469 | 3 | 4 |
| 187 | Optimal clock synchronization under different delay assumptions | Coautor y autor de correspondencia: Rajsbaum Sergio, Attiya Hagit, Herzberg Amir | 1993 | Proceedings Of The Annual Acm Symposium On Principles Of Distributed Computing | Scopus-id: 2-s2.0-0027802102 | 0 | 12 |
| 188 | Use of a synchronizer yields maximum computation rate in distributed networks. | 2ᵒ autor y autor de correspondencia: Rajsbaum Sergio, Even Shimon | 1990 | American Society Of Mechanical Engineers (paper) | WoS-id: A1990BS25Y00011 Scopus-id: 2-s2.0-0025135706 | 1 | 13 |
Capítulos de libros (WoS y Scopus)
| # | Título del capítulo | Título del libro | Autores | Alcance | Año | ISBN | Fuente |
|---|---|---|---|---|---|---|---|
| 1 | Invited Paper: The Smart Contract Model | Rajsbaum S., Amoussou-Guenou Y., Herlihy M., et al. | Conference Paper | 2025 | 9783031744976 | WoS-id: 001423071500004 Scopus-id: 2-s2.0-85207838257 | |
| 2 | The Computational Power of Distributed Shared-Memory Models with Bounded-Size Registers | Proceedings Of The Annual Acm Symposium On Principles Of Distributed Computing | Rajsbaum S., Delporte-Gallet C., Fauconnier H., et al. | Conference Paper | 2024 | 9798400706684 | Scopus-id: 2-s2.0-85199088204 |
| 3 | Brief Announcement: Solvability of Three-Process General Tasks | Rajsbaum S., Attiya H., Fraigniaud P., et al. | Conference Paper | 2024 | 9783959773522 | Scopus-id: 2-s2.0-85208413730 | |
| 4 | Invited Paper: Further Decentralizing Decentralized Finance: Loss vs Rebalancing Without a Shared Reference Market | 2024 6th Conference On Blockchain Research And Applications For Innovative Networks And Services, Brains 2024 | Rajsbaum S., Herlihy M., Salhab N., | Conference Paper | 2024 | 9798350367843 | WoS-id: 001424424300029 Scopus-id: 2-s2.0-85212435376 |
| 5 | A Distributed Combinatorial Topology Approach to Arrow's Impossibility Theorem | Proceedings Of The Annual Acm Symposium On Principles Of Distributed Computing | Rajsbaum, Sergio, Raventos-Pujol, Armajac, | Conference Paper | 2022 | 9781450392624 | WoS-id: 001031439100059 Scopus-id: 2-s2.0-85135347574 |
| 6 | A Speedup Theorem for Asynchronous Computation with Applications to Consensus and Approximate Agreement | Proceedings Of The Annual Acm Symposium On Principles Of Distributed Computing | Rajsbaum, Sergio, Fraigniaud, Pierre, Paz, Ami, | Conference Paper | 2022 | 9781450392624 | WoS-id: 001031439100058 Scopus-id: 2-s2.0-85135315708 |
| 7 | An Eventually Perfect Failure Detector for Networks of Arbitrary Topology Connected with ADD Channels Using Time-To-Live Values | International Conference on Dependable Systems and Networks | Vargas K., Rajsbaum S., | Conference Paper | 2019 | 9781728100562 | WoS-id: 000568615000023 Scopus-id: 2-s2.0-85072107723 |
| 8 | Fault-Tolerant Robot Gathering Problems on Graphs with Arbitrary Appearing Times | Fault-Tolerant Robot Gathering Problems On Graphs With Arbitrary Appearing Times | Rajsbaum, S., Castaneda, A., Penaloza, D.F., et al. | Conference Paper | 2017 | 9781538639146 | WoS-id: 000427044800052 Scopus-id: 2-s2.0-85027693222 |
| 9 | Brief Announcement: Asynchronous Coordination with Constraints and Preferences | Proceedings Of The 2016 Acm Symposium On Principles Of Distributed Computing (podc'16) | Castaneda, Armando, Rajsbaum, Sergio, Fraigniaud, Pierre, et al. | Proceedings Paper | 2016 | 9781450339643 | WoS-id: 000383741300040 Scopus-id: 2-s2.0-84984674685 |
| 10 | Simulations and reductions for colorless tasks | Proceedings Of The Annual Acm Symposium On Principles Of Distributed Computing | Rajsbaum S., Herlihy M., | Conference Paper | 2012 | 9781450314503 | Scopus-id: 2-s2.0-84865027709 |
| 11 | Brief announcement: There are plenty of tasks weaker than perfect renaming and stronger than set agreement | Proceedings Of The Annual Acm Symposium On Principles Of Distributed Computing | Rajsbaum S., Castãeda A., Raynal M., | Conference Paper | 2012 | 9781450314503 | Scopus-id: 2-s2.0-84864970293 |
| 12 | The universe of symmetry breaking tasks | Proceedings Of The Annual Acm Symposium On Principles Of Distributed Computing | Rajsbaum S., Imbs D., Raynal M., | Conference Paper | 2011 | 9781450307192 | Scopus-id: 2-s2.0-79959906468 |
| 13 | The topology of shared-memory adversaries | Proceedings Of The Annual Acm Symposium On Principles Of Distributed Computing | Rajsbaum S., Herlihy M., | Conference Paper | 2010 | 9781605588889 | Scopus-id: 2-s2.0-77956244348 |
| 14 | Brief announcement: Weakest failure detectors via an egg-laying simulation | Proceedings Of The Annual Acm Symposium On Principles Of Distributed Computing | Rajsbaum S., Anta A.F., Travers C., | Conference Paper | 2009 | 9781605583969 | Scopus-id: 2-s2.0-70350686445 |
| 15 | New combinatorial topology upper and lower bounds for renaming | Proceedings Of The Annual Acm Symposium On Principles Of Distributed Computing | Rajsbaum S., Castañeda A., | Conference Paper | 2008 | 9781595939890 | Scopus-id: 2-s2.0-57549094660 |
| 16 | Brief announcement: Failure detectors are schedulers | Proceedings Of The Annual Acm Symposium On Principles Of Distributed Computing | Rajsbaum S., Cornejo A., Raynal M., et al. | Conference Paper | 2007 | 1595936165 | Scopus-id: 2-s2.0-36849003959 |
| 17 | Irreducibility and additivity of set agreement-oriented failure detector classes | Proceedings Of The Annual Acm Symposium On Principles Of Distributed Computing | Rajsbaum S., Mostefaoui A., Raynal M., et al. | Conference Paper | 2006 | 1595933840 | Scopus-id: 2-s2.0-33748687372 |
Obras con ISBN (Indautor)
| # | Título del documento | Autores | Alcance | Año | ISBN | Fuente |
|---|---|---|---|---|---|---|
| 1 | Estándares De Matemáticas Para El Bachillerato De La Unam | Abreu León, José Luis, Apodaca Alvarez, Norma Patricia, Bracho Carpizo, Javier, et al. | Libro Completo | 2016 | 9786070280092 | INDAUTOR |
| 2 | Conocimientos Fundamentales De Computacio´n | Rajsbaum Gorodezky Sergio, | Libro Completo | 2010 | 9786070209895 | INDAUTORCIC |
Proyectos
| # | Nombre | Participantes | Convocatoria | Fecha Inicio | Fecha Fin |
|---|---|---|---|---|---|
| 1 | Técnicas de chequeo distribuido. CONACyT M12-M01 | SERGIO RAJSBAUM GORODEZKY, | Recursos CONACYT | 01-01-2013 | 31-12-2019 |
| 2 | Nuevas direcciones en cómputo distribuido | SERGIO RAJSBAUM GORODEZKY, | Recursos PAPIIT | 01-01-2017 | 31-12-2019 |
| 3 | Foundations of Network Distributed Systems. | ARMANDO CASTAEDA ROJANO, SERGIO RAJSBAUM GORODEZKY, | Presupuesto de la UNAM asignado a la Dependencia | 01-01-2020 | 30-12-2022 |
| 4 | Principios de cómputo distribuido bajo un enfoque interdisciplinario. | SERGIO RAJSBAUM GORODEZKY, | Recursos PAPIIT | 01-01-2020 | 31-12-2022 |
| 5 | Computación distribuida: un enfoque interdisciplinario (II) | SERGIO RAJSBAUM GORODEZKY, | Presupuesto de la UNAM asignado a la Dependencia | 01-01-2023 | 31-12-2025 |
Participación en Comités de Tesis
Docencia Impartida
| # | Entidad | Nivel | Asignatura | Año | Semestre | Alumnos |
|---|---|---|---|---|---|---|
| 1 | Instituto de Investigaciones en Matemáticas Aplicadas y en Sistemas | Maestría | SEMINARIO DE INVESTIGACIÓN I | 2024 | 2024-2 | 1 |
| 2 | Instituto de Investigaciones en Matemáticas Aplicadas y en Sistemas | Maestría | SEMINARIO DE INVESTIGACIÓN II | 2022 | 2023-1 | 3 |
| 3 | Instituto de Investigaciones en Matemáticas Aplicadas y en Sistemas | Maestría | TEMAS SELECTOS DE TEORÍA DE LA COMPUTACIÓN | 2022 | 2022-2 | 1 |
| 4 | Instituto de Investigaciones en Matemáticas Aplicadas y en Sistemas | Maestría | TEMAS SELECTOS DE TEORÍA DE LA COMPUTACIÓN | 2022 | 2022-2 | 5 |
| 5 | Instituto de Investigaciones en Matemáticas Aplicadas y en Sistemas | Maestría | SEMINARIO DE INVESTIGACIÓN I | 2022 | 2022-2 | 2 |
| 6 | Instituto de Investigaciones en Matemáticas Aplicadas y en Sistemas | Maestría | SEMINARIO DE INVESTIGACIÓN II | 2021 | 2022-1 | 1 |
| 7 | Instituto de Investigaciones en Matemáticas Aplicadas y en Sistemas | Maestría | TEMAS SELECTOS DE TEORÍA DE LA COMPUTACIÓN (ALICE Y BOB TEMAS SELECTOS DE COMPUTABILIDAD, COMPLEJIDAD Y PRIVACIDAD) | 2021 | 2021-2 | 5 |
| 8 | Instituto de Investigaciones en Matemáticas Aplicadas y en Sistemas | Maestría | SEMINARIO DE INVESTIGACIÓN I | 2021 | 2021-2 | 2 |
| 9 | Instituto de Investigaciones en Matemáticas Aplicadas y en Sistemas | Maestría | SEMINARIO DE INVESTIGACIÓN II | 2020 | 2021-1 | 4 |
| 10 | Instituto de Investigaciones en Matemáticas Aplicadas y en Sistemas | Maestría | DISEÑO Y ANÁLISIS DE ALGORITMOS | 2020 | 2021-1 | 17 |
| 11 | Instituto de Investigaciones en Matemáticas Aplicadas y en Sistemas | Maestría | SEMINARIO DE INVESTIGACIÓN I | 2020 | 2020-2 | 4 |
| 12 | Facultad de Ciencias | Licenciatura | COMPUTACION CONCURRENTE | 2020 | 2020-2 | 27 |
| 13 | Instituto de Investigaciones en Matemáticas Aplicadas y en Sistemas | Maestría | DISEÑO Y ANÁLISIS DE ALGORITMOS | 2019 | 2020-1 | 36 |
| 14 | Instituto de Investigaciones en Matemáticas Aplicadas y en Sistemas | Maestría | SEMINARIO DE INVESTIGACIÓN II | 2019 | 2020-1 | 1 |
| 15 | Instituto de Investigaciones en Matemáticas Aplicadas y en Sistemas | Maestría | SEMINARIO DE INVESTIGACIÓN I | 2019 | 2019-2 | 1 |
| 16 | Instituto de Investigaciones en Matemáticas Aplicadas y en Sistemas | Maestría | TEMAS SELECTOS DE REDES Y SEGURIDAD EN COMPUTO SISTEMAS DISTRIBUIDOS | 2018 | 2019-1 | 2 |
| 17 | Facultad de Ciencias | Licenciatura | COMPUTACION DISTRIBUIDA | 2018 | 2019-1 | 40 |
| 18 | Instituto de Investigaciones en Matemáticas Aplicadas y en Sistemas | Maestría | SEMINARIO DE INVESTIGACION I | 2018 | 2018-2 | 1 |
| 19 | Instituto de Investigaciones en Matemáticas Aplicadas y en Sistemas | Maestría | SEMINARIO DE INVESTIGACION II | 2017 | 2018-1 | 1 |
| 20 | Instituto de Investigaciones en Matemáticas Aplicadas y en Sistemas | Maestría | DISEÑO Y ANALISIS DE ALGORITMOS | 2017 | 2018-1 | 24 |
| 21 | Instituto de Investigaciones en Matemáticas Aplicadas y en Sistemas | Maestría | SEMINARIO DE INVESTIGACIÓN I | 2017 | 2017-2 | 1 |
| 22 | Instituto de Investigaciones en Matemáticas Aplicadas y en Sistemas | Maestría | TEMAS SELECTOS DE TEORIA DE LA COMPUTACION | 2015 | 2016-1 | 5 |
| 23 | Facultad de Ciencias | Licenciatura | COMPLEJIDAD COMPUTACIONAL | 2015 | 2016-1 | 20 |
| 24 | Instituto de Investigaciones en Matemáticas Aplicadas y en Sistemas | Maestría | TEMAS SELECTOS DE TEORIA DE LA COMPUTACION | 2015 | 2015-2 | 4 |
| 25 | Instituto de Investigaciones en Matemáticas Aplicadas y en Sistemas | Maestría | SEMINARIO DE INVESTIGACION III | 2015 | 2015-2 | 3 |
| 26 | Facultad de Ciencias | Licenciatura | COMPUTACION CONCURRENTE | 2015 | 2015-2 | 6 |
| 27 | Facultad de Ingeniería | Licenciatura | ALGORITMOS Y ESTRUCTURAS DE DATOS | 2014 | 2015-1 | 6 |
| 28 | Facultad de Ciencias | Licenciatura | SEMINARIO DE COMPUTACION TEORICA II | 2014 | 2015-1 | 1 |
| 29 | Facultad de Ciencias | Licenciatura | SEM.D CIENCIAS DE LA COMPUTACION A | 2014 | 2015-1 | 2 |
| 30 | Instituto de Investigaciones en Matemáticas Aplicadas y en Sistemas | Maestría | ESTRUCTURA DE DATOS Y TEORIA DE ALGORITMOS | 2014 | 2015-1 | 1 |
| 31 | Instituto de Investigaciones en Matemáticas Aplicadas y en Sistemas | Maestría | DISEÑO Y ANALISIS DE ALGORITMOS | 2014 | 2015-1 | 23 |
| 32 | Instituto de Investigaciones en Matemáticas Aplicadas y en Sistemas | Maestría | TEMAS SELECTOS DE PROCESAMIENTO DISTRIBUIDO | 2014 | 2015-1 | 1 |
| 33 | Instituto de Investigaciones en Matemáticas Aplicadas y en Sistemas | Maestría | SEMINARIO DE INVESTIGACION II | 2014 | 2015-1 | 3 |
| 34 | Instituto de Investigaciones en Matemáticas Aplicadas y en Sistemas | Maestría | SEMINARIO DE INVESTIGACION III | 2014 | 2014-2 | 1 |
| 35 | Instituto de Investigaciones en Matemáticas Aplicadas y en Sistemas | Maestría | SISTEMAS DISTRIBUIDOS Y VERIFICACION | 2014 | 2014-2 | 7 |
| 36 | Instituto de Investigaciones en Matemáticas Aplicadas y en Sistemas | Maestría | SEMINARIO DE INVESTIGACION I | 2014 | 2014-2 | 3 |
| 37 | Facultad de Ciencias | Licenciatura | COMPUTACION CONCURRENTE | 2014 | 2014-2 | 1 |
| 38 | Facultad de Ciencias | Licenciatura | PRINCIPIOS DE COMPUTACION DISTRIB. | 2014 | 2014-2 | 7 |
| 39 | Instituto de Investigaciones en Matemáticas Aplicadas y en Sistemas | Maestría | ESTRUCTURA DE DATOS Y TEORIA DE ALGORITMOS | 2013 | 2014-1 | 21 |
| 40 | Instituto de Investigaciones en Matemáticas Aplicadas y en Sistemas | Maestría | SEMINARIO DE INVESTIGACION II | 2013 | 2014-1 | 1 |
| 41 | Instituto de Investigaciones en Matemáticas Aplicadas y en Sistemas | Maestría | SEMINARIO DE INVESTIGACION III | 2013 | 2013-2 | 7 |
| 42 | Instituto de Investigaciones en Matemáticas Aplicadas y en Sistemas | Maestría | SEMINARIO DE INVESTIGACION I | 2013 | 2013-2 | 1 |
| 43 | Instituto de Investigaciones en Matemáticas Aplicadas y en Sistemas | Maestría | TEORIA DE LA COMPLEJIDAD | 2012 | 2013-1 | 14 |
| 44 | Instituto de Investigaciones en Matemáticas Aplicadas y en Sistemas | Maestría | ESTRUCTURA DE DATOS Y TEORIA DE ALGORITMOS | 2012 | 2013-1 | 23 |
| 45 | Instituto de Investigaciones en Matemáticas Aplicadas y en Sistemas | Maestría | SEMINARIO DE INVESTIGACION II | 2012 | 2013-1 | 8 |
| 46 | Facultad de Ciencias | Licenciatura | SEMINARIO DE COMPUTACION TEORICA II | 2012 | 2012-2 | 8 |
| 47 | Instituto de Investigaciones en Matemáticas Aplicadas y en Sistemas | Maestría | SISTEMAS DISTRIBUIDOS Y VERIFICACION | 2012 | 2012-2 | 18 |
| 48 | Instituto de Investigaciones en Matemáticas Aplicadas y en Sistemas | Maestría | SEMINARIO DE INVESTIGACION I | 2012 | 2012-2 | 8 |
| 49 | Instituto de Investigaciones en Matemáticas Aplicadas y en Sistemas | Maestría | ESTRUCTURA DE DATOS Y TEORIA DE ALGORITMOS | 2011 | 2012-1 | 21 |
| 50 | Facultad de Ciencias | Licenciatura | COMPLEJIDAD COMPUTACIONAL | 2011 | 2011-2 | 17 |
| 51 | Instituto de Investigaciones en Matemáticas Aplicadas y en Sistemas | Maestría | TEORIA DE LA COMPLEJIDAD | 2011 | 2011-2 | 6 |
| 52 | Instituto de Investigaciones en Matemáticas Aplicadas y en Sistemas | Maestría | SEMINARIO DE INVESTIGACION III | 2011 | 2011-2 | 1 |
| 53 | Instituto de Matemáticas | Maestría | CURSO AVANZADO DE MATEMATICAS DISCRETAS | 2011 | 2011-2 | 2 |
| 54 | Instituto de Investigaciones en Matemáticas Aplicadas y en Sistemas | Maestría | SEMINARIO DE INVESTIGACION II | 2010 | 2011-1 | 1 |
| 55 | Instituto de Investigaciones en Matemáticas Aplicadas y en Sistemas | Maestría | ESTRUCTURA DE DATOS Y TEORIA DE ALGORITMOS | 2010 | 2011-1 | 19 |
| 56 | Instituto de Investigaciones en Matemáticas Aplicadas y en Sistemas | Maestría | SEMINARIO DE INVESTIGACION I | 2010 | 2010-2 | 1 |
| 57 | Instituto de Investigaciones en Matemáticas Aplicadas y en Sistemas | Maestría | TEMAS SELECTOS DE LA TEORIA DE LA COMPUTACION | 2010 | 2010-2 | 2 |
| 58 | Instituto de Investigaciones en Matemáticas Aplicadas y en Sistemas | Maestría | SEMINARIO DE INVESTIGACION III | 2010 | 2010-2 | 2 |
| 59 | Instituto de Investigaciones en Matemáticas Aplicadas y en Sistemas | Maestría | SEMINARIO DE INVESTIGACION II | 2009 | 2010-1 | 3 |
| 60 | Instituto de Investigaciones en Matemáticas Aplicadas y en Sistemas | Maestría | SISTEMAS DISTRIBUIDOS Y VERIFICACION | 2009 | 2010-1 | 3 |
| 61 | Instituto de Investigaciones en Matemáticas Aplicadas y en Sistemas | Maestría | ESTRUCTURA DE DATOS Y TEORIA DE ALGORITMOS | 2009 | 2010-1 | 23 |
| 62 | Facultad de Ciencias | Licenciatura | COMPLEJIDAD COMPUTACIONAL | 2009 | 2009-2 | 10 |
| 63 | Instituto de Investigaciones en Matemáticas Aplicadas y en Sistemas | Maestría | TEORIA DE LA COMPLEJIDAD | 2009 | 2009-2 | 7 |
| 64 | Instituto de Investigaciones en Matemáticas Aplicadas y en Sistemas | Maestría | SEMINARIO DE INVESTIGACION I | 2009 | 2009-2 | 3 |
| 65 | Instituto de Investigaciones en Matemáticas Aplicadas y en Sistemas | Maestría | SEMINARIO DE INVESTIGACION III | 2009 | 2009-2 | 2 |
| 66 | Instituto de Investigaciones en Matemáticas Aplicadas y en Sistemas | Maestría | SEMINARIO DE INVESTIGACION II | 2008 | 2009-1 | 1 |
| 67 | Facultad de Ciencias | Licenciatura | PROCESOS PARALELOSDISTRIB. | 2008 | 2009-1 | 12 |
| 68 | Instituto de Investigaciones en Matemáticas Aplicadas y en Sistemas | Maestría | ESTRUCTURA DE DATOS Y TEORIA DE ALGORITMOS | 2008 | 2009-1 | 22 |
| 69 | Instituto de Investigaciones en Matemáticas Aplicadas y en Sistemas | Maestría | SEMINARIO DE INVESTIGACION I | 2008 | 2008-2 | 1 |
| 70 | Instituto de Investigaciones en Matemáticas Aplicadas y en Sistemas | Maestría | SEMINARIO DE INVESTIGACION III | 2008 | 2008-2 | 2 |
| 71 | Instituto de Investigaciones en Matemáticas Aplicadas y en Sistemas | Maestría | TEMAS SELECTOS DE LA TEORIA DE LA COMPUTACION | 2008 | 2008-2 | 7 |
| 72 | Instituto de Investigaciones en Matemáticas Aplicadas y en Sistemas | Maestría | SEMINARIO DE INVESTIGACION II | 2007 | 2008-1 | 2 |
| 73 | Instituto de Investigaciones en Matemáticas Aplicadas y en Sistemas | Maestría | ESTRUCTURA DE DATOS Y TEORIA DE ALGORITMOS | 2007 | 2008-1 | 21 |
No se encuentran registros en la base de datos de patentes.
No se encuentran registros en la base de datos de libros completos (Humanindex).
Capítulos de libros (Humanindex)
| # | Título del libro | Título del capítulo | ISBN | Editorial | Año | Fuente |
|---|