| Finite automata and their decision problems MO Rabin, D Scott IBM journal of research and development 3 (2), 114-125, 1959 | 3033 | 1959 |
| How to exchange secrets with oblivious transfer MO Rabin Cryptology ePrint Archive, 2005 | 2502 | 2005 |
| Efficient dispersal of information for security, load balancing, and fault tolerance MO Rabin Journal of the ACM (JACM) 36 (2), 335-348, 1989 | 2184 | 1989 |
| Efficient randomized pattern-matching algorithms RM Karp, MO Rabin IBM journal of research and development 31 (2), 249-260, 1987 | 2128 | 1987 |
| Decidability of second-order theories and automata on infinite trees. MO Rabin Transactions of the american Mathematical Society 141, 1-35, 1969 | 2025 | 1969 |
| Digitalized signatures and public-key functions as intractable as factorization MO Rabin | 1683 | 1979 |
| Scheme for information dispersal and reconstruction MO Rabin US Patent 5,485,474, 1996 | 1543 | 1996 |
| Probabilistic algorithm for testing primality MO Rabin Journal of number theory 12 (1), 128-138, 1980 | 1498 | 1980 |
| Verifiable random functions S Micali, M Rabin, S Vadhan 40th annual symposium on foundations of computer science (cat. No. 99CB37039 …, 1999 | 1364 | 1999 |
| Fingerprinting by random polynomials MO Rabin Technical report, 1981 | 1351 | 1981 |
| Probabilistic automata MO Rabin Information and control 6 (3), 230-245, 1963 | 1265 | 1963 |
| Randomized byzantine generals MO Rabin 24th annual symposium on foundations of computer science (sfcs 1983), 403-409, 1983 | 885 | 1983 |
| Simplified VSS and fast-track multiparty computations with applications to threshold cryptography R Gennaro, MO Rabin, T Rabin Proceedings of the seventeenth annual ACM symposium on Principles of …, 1998 | 740 | 1998 |
| Probabilistic algorithms. MO Rabin | 727 | 1976 |
| Super-exponential complexity of Presburger arithmetic MJ Fischer, MO Rabin Quantifier Elimination and Cylindrical Algebraic Decomposition, 122-135, 1998 | 599 | 1998 |
| Computable algebra, general theory and theory of computable fields MO Rabin Transactions of the American Mathematical Society 95 (2), 341-360, 1960 | 520 | 1960 |
| Probabilistic algorithms in finite fields MO Rabin SIAM Journal on computing 9 (2), 273-280, 1980 | 517 | 1980 |
| Digitalized signatures MO Rabin Foundations of secure computation, 155-168, 1978 | 453 | 1978 |
| Automata on infinite objects and Church's problem MO Rabin American Mathematical Soc., 1972 | 449 | 1972 |
| Recursive unsolvability of group theoretic problems MO Rabin Princeton University, 1956 | 392 | 1956 |
| On the advantages of free choice: A symmetric and fully distributed solution to the dining philosophers problem D Lehmann, MO Rabin Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of …, 1981 | 382 | 1981 |
| Methods and apparatus for protecting information MO Rabin, DE Shasha US Patent 6,697,948, 2004 | 347 | 2004 |
| Digital signatures and public-key functions as intractable as factorization MO Rabin MIT Laboratory for Computer Science Technical Report, 1979 | 346* | 1979 |
| Transaction protection by beacons MO Rabin Journal of Computer and System Sciences 27 (2), 256-267, 1983 | 342 | 1983 |
| Weakly definable relations and special automata MO Rabin Studies in Logic and the Foundations of Mathematics 59, 1-23, 1970 | 294 | 1970 |
| Decidable theories MO Rabin Studies in Logic and the Foundations of Mathematics 90, 595-629, 1977 | 277 | 1977 |
| Zero-knowledge sets S Micali, M Rabin, J Kilian 44th Annual IEEE Symposium on Foundations of Computer Science, 2003 …, 2003 | 274 | 2003 |
| The theory of definite automata M Perles, MO Rabin, E Shamir IEEE Transactions on Electronic Computers, 233-243, 2006 | 223 | 2006 |
| Decidability and undecidability of extensions of second (first) order theory of (generalized) successor1 CC Elgot, MO Rabin The Journal of Symbolic Logic 31 (2), 169-181, 1966 | 220 | 1966 |
| A characterization of the power of vector machines VR Pratt, MO Rabin, LJ Stockmeyer Proceedings of the sixth annual ACM symposium on Theory of computing, 122-134, 1974 | 218 | 1974 |
| An algorithm for a minimum cover of a graph RZ Norman, MO Rabin Proceedings of the American Mathematical Society 10 (2), 315-319, 1959 | 203 | 1959 |
| Maximum matchings in general graphs through randomization MO Rabin, VV Vazirani Journal of algorithms 10 (4), 557-567, 1989 | 178 | 1989 |
| Real time computation MO Rabin Israel Journal of Mathematics 1 (4), 203-211, 1963 | 178 | 1963 |
| Everlasting security in the bounded storage model Y Aumann, YZ Ding, MO Rabin IEEE Transactions on Information Theory 48 (6), 1668-1680, 2002 | 176 | 2002 |
| A simple method for undecidability proofs and some applications MO Rabin Logic, Methodology and Philosophy of Sciences 1, 58-68, 1965 | 175 | 1965 |
| Randomized algorithms in number theory MO Rabin, JO Shallit Communications on Pure and Applied Mathematics 39 (S1), S239-S256, 1986 | 164 | 1986 |
| Degree of difficulty of computing a function and a partial ordering of recursive sets MO Rabin Technical Report 2, 1960 | 154 | 1960 |
| Practical secrecy-preserving, verifiably correct and trustworthy auctions DC Parkes, MO Rabin, SM Shieber, CA Thorpe Proceedings of the 8th international conference on Electronic commerce: The …, 2006 | 148 | 2006 |
| Effective computability of winning strategies MO Rabin Journal of Symbolic Logic 23 (2), 1958 | 147 | 1958 |
| The choice coordination problem MO Rabin Acta Informatica 17 (2), 121-134, 1982 | 144 | 1982 |
| A logic to reason about likelihood JY Halpern, MO Rabin Artificial Intelligence 32 (3), 379-405, 1987 | 120 | 1987 |
| Hyper-encryption and everlasting security YZ Ding, MO Rabin Annual Symposium on Theoretical Aspects of Computer Science, 1-26, 2002 | 114 | 2002 |
| Proving simultaneous positivity of linear forms MO Rabin Journal of Computer and System Sciences 6 (6), 639-650, 1972 | 111 | 1972 |
| Information theoretically secure communication in the limited storage space model Y Aumann, MO Rabin Annual International Cryptology Conference, 65-79, 1999 | 104 | 1999 |
| Digitalized signatures and public key functions as intractable as factoring MO Rabin MIT/LCS/TR-212, 1979 | 102 | 1979 |
| Authentication, enhanced security and error correcting codes Y Aumann, MO Rabin Annual International Cryptology Conference, 299-303, 1998 | 100 | 1998 |
| The magazine archive includes every article published in Communications of the ACM for over the past 50 years. PG Neumann Communications of the ACM 65 (6), 32-35, 2022 | 93* | 2022 |
| Probabilistic Algorithms Algorithms and Complexity: New Directions and Recent Results MO Rabin Academic Press, 1976 | 93 | 1976 |
| Method and apparatus for time-lapse cryptography MO Rabin, CA Thorpe US Patent 8,526,621, 2013 | 89 | 2013 |
| Efficient program transformations for resilient parallel computation via randomization (preliminary version) ZM Kedem, KV Palem, MO Rabin, A Raghunathan Proceedings of the twenty-fourth annual ACM symposium on Theory of Computing …, 1992 | 85 | 1992 |
| n-process mutual exclusion with bounded waiting by 4· log2 N-valued shared variable MO Rabin Journal of Computer and System Sciences 25 (1), 66-75, 1982 | 85 | 1982 |
| Methods and apparatus for protecting information M Rabin, D Shasha US Patent App. 10/737,077, 2004 | 84 | 2004 |
| Online scheduling of parallel programs on heterogeneous systems with applications to cilk MA Bender, MO Rabin Theory of Computing Systems 35 (3), 289-304, 2002 | 78 | 2002 |
| Probabolistic algorithm for primality testing MO Rabin Journal of number theory 12, 128-138, 1980 | 78 | 1980 |
| The information dispersal algorithm and its applications MO Rabin Sequences: Combinatorics, Compression, Security, and Transmission, 406-419, 1990 | 74 | 1990 |
| Parallel processing on networks of workstations: A fault-tolerant, high performance approach P Dasgupta, ZM Kedem, MO Rabin Proceedings of 15th International Conference on Distributed Computing …, 1995 | 73 | 1995 |
| Mathematical theory of automata MO Rabin Proceedings of the 19th ACM Symposium in Applied Mathematics, 153-175, 1966 | 73 | 1966 |
| Clock construction in fully asynchronous parallel systems and PRAM simulation Y Aumann, MO Rabin Theoretical Computer Science 128 (1-2), 3-30, 1994 | 69 | 1994 |
| Digitalized signatures. Foundations of Secure Communication MO Rabin Academic Press, 1978 | 67 | 1978 |
| Decidability of second-order theories and automata on infinite trees MO Rabin | 66 | 1968 |
| On codes for checking logical operations WW Peterson, MO Rabin IBM Journal of Research and Development 3 (2), 163-168, 1959 | 62 | 1959 |
| Complexity of computations MO Rabin Communications of the ACM 20 (9), 625-633, 1977 | 60 | 1977 |
| Maze threading automata MO Rabin An unpublished lecture presented at MIT and UC Berkeley, 1967 | 60 | 1967 |
| Highly efficient asynchronous execution of large-grained parallel programs Y Aumann, ZM Kedum, KV Palem, MO Rabin Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science, 271-280, 1993 | 57 | 1993 |
| Achieving independence in logarithmic number of rounds B Chor, MO Rabin Proceedings of the sixth annual ACM Symposium on Principles of distributed …, 1987 | 56 | 1987 |
| Method and apparatus for protecting information and privacy MO Rabin, DE Shasha, Y Beinart, R Caceres, T Karia, D Molnar, ... US Patent 7,991,995, 2011 | 55 | 2011 |
| Theoretical Impediments to Artificial Intelligence. MO Rabin IFIP Congress 1974, 615-619, 1974 | 53 | 1974 |
| Scheduling Cilk multithreaded parallel programs on processors of different speeds MA Bender, MO Rabin Proceedings of the twelfth annual ACM symposium on Parallel algorithms and …, 2000 | 52 | 2000 |
| Finite automata and their decision problems MO Rabin, D Scott Sequential Machines: Selected Papers, 63-91, 1964 | 51 | 1964 |
| Fast evaluation of polynomials by rational preparation MO Rabin, S Winograd Communications on Pure and Applied Mathematics 25 (4), 433-458, 1972 | 49 | 1972 |
| A logic to reason about likelihood JY Halpern, MO Rabin Proceedings of the fifteenth annual ACM symposium on Theory of computing …, 1983 | 48 | 1983 |
| Practical secrecy-preserving, verifiably correct and trustworthy auctions DC Parkes, MO Rabin, SM Shieber, CA Thorpe US Patent 8,024,274, 2011 | 47 | 2011 |
| Time-lapse cryptography M Rabin, CA Thorpe | 46 | 2006 |
| Methods and apparatus for protecting information MO Rabin, DE Shasha US Patent 7,073,197, 2006 | 45 | 2006 |
| N-process synchronization by 4. log2N-valued shared variable MO Rabin 21st Annual Symposium on Foundations of Computer Science (sfcs 1980), 407-410, 1980 | 45 | 1980 |
| Randomized mutual exclusion algorithms revisited E Kushilevitz, MO Rabin Proceedings of the eleventh annual ACM symposium on Principles of …, 1992 | 44 | 1992 |
| Auction verification S Muthukrishnan, M Rabin, MMM Yung US Patent 8,239,331, 2012 | 42 | 2012 |
| Method and apparatus for protecting information and privacy MO Rabin, DE Shasha US Patent 6,889,209, 2005 | 42 | 2005 |
| Digital signatures and public key functions as intractable as factoring MO Rabin Technical Memo TM-212, Lab. for Computer Science, MIT, 1979 | 40 | 1979 |
| Discovering repetitions in strings MO Rabin Combinatorial Algorithms on Words, 279-288, 1985 | 37 | 1985 |
| How to exchange secrets with oblivious transfer, 2005 MO Rabin URL http://eprint. iacr. org/2005/187. Harvard University Technical Report …, 2005 | 36 | 2005 |
| Non-standard models and independence of the induction axiom MO Rabin | 35 | 1961 |
| Highly efficient secrecy-preserving proofs of correctness of computation MO Rabin, RA Servedio, C Thorpe US Patent App. 12/105,508, 2009 | 34 | 2009 |
| Digital Signatures and Public-Key Encryptions as Intractable as Factorization, MIT MO Rabin Technical Report, 1979 | 34 | 1979 |
| Speed of computation and classification of recursive sets MO Rabin Third Convention Science Society, 1-2, 1959 | 33 | 1959 |
| technical report tr-81 MO Rabin Aiken Computation Lab, Harvard University, 1981 | 31 | 1981 |
| Diophantine equations and non-standard models of arithmetic M Rabin Studies in Logic and the Foundations of Mathematics 44, 151-158, 1966 | 29 | 1966 |
| Arithmetical extensions with prescribed cardinality MO Rabin | 29 | 1960 |
| Strictly-black-box zero-knowledge and efficient validation of financial transactions MO Rabin, Y Mansour, S Muthukrishnan, M Yung International Colloquium on Automata, Languages, and Programming, 738-749, 2012 | 28 | 2012 |
| Cryptography miracles, secure auctions, matching problem verification S Micali, MO Rabin Communications of the ACM 57 (2), 85-93, 2014 | 26 | 2014 |
| Highly efficient secrecy-preserving proofs of correctness of computations and applications MO Rabin, RA Servedio, C Thorpe 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007), 63-76, 2007 | 26 | 2007 |
| BLASED COINS AND RANDONIZED ALGORITHMS N Alon, MO Rabin | 26 | 1989 |
| Method and apparatus for protecting information and privacy MO Rabin, DE Shasha US Patent 7,747,873, 2010 | 25 | 2010 |
| Cryptographic combinatorial clock-proxy auctions D Parkes, M Rabin, CA Thorpe Springer Verlag, 2009 | 25 | 2009 |
| Digitalized signatures and public-key cryptosystems M Rabin MIT/LCS/TR 212, 1979 | 25* | 1979 |
| On recursively enumerable and arithmetic models of set theory MO Rabin the Journal of symbolic logic 23 (4), 408-416, 1958 | 25 | 1958 |
| Classes of models and sets of sentences with the intersection property MO Rabin Annales de la faculté des sciences de l'université de Clermont …, 1962 | 24 | 1962 |
| Provably unbreakable hyper-encryption in the limited access model MO Rabin IEEE Information Theory Workshop on Theory and Practice in Information …, 2005 | 23 | 2005 |
| How to exchange secrets by oblivious transfer OR Michael, M Rabin tech. rep., Technical report, Aiken Computation Laboratory. Harvard University, 1981 | 23 | 1981 |
| Method and apparatus for protecting information and privacy M Rabin, D Shasha, Y Beinart, R Caceres, T Karia, D Molnar, S Rolinson US Patent App. 10/429,218, 2003 | 22 | 2003 |
| An integrated toolkit for operating system security MO Rabin, JD Tygar Harvard University, Center for Research in Computing Technology, Aiken …, 1987 | 20 | 1987 |
| Lectures on classical and probabilistic automata M Rabin Automata Theory. Academic Press, London 3, 1966 | 20 | 1966 |
| Two-way finite automata MO Rabin Proceedings of the Summer Institute of Symbolic Logic, 366-369, 1957 | 20 | 1957 |
| Algorithms and Complexity MO Rabin Chapter Probabilistic Algorithms, 21-40, 1976 | 19 | 1976 |
| On the development of courseware C PAPADIMITRIOU, MO RABIN Proceedings of SIGCOMM, 1967 | 19 | 1967 |
| On non-standard models for number theory E Mendelson | 19 | 1961 |
| Maximum matchings in general graphs through randomization MO Rabin, VV Vazirani Center for Research in Computing Techn., Aiken Computation Laboratory, Univ., 1984 | 17 | 1984 |
| Axiomatic method and intuitionism A Heyting, Y Bar-Hillel, EIJ Poznanski, MO Rabin, A Robinson | 17 | 1971 |
| Words in the History of a Turing Machine with a Fixed Input MO Rabin, H Wang Journal of the ACM (JACM) 10 (4), 526-527, 1963 | 17 | 1963 |
| Digitalized signatures and public key functions as intractable as factorization, 1979 MO Rabin Massachusetts Institute of Technology, Laboratory for Computer Science …, 2023 | 16 | 2023 |
| Detection and identification methods for software MO Rabin, DE Shasha, CJ Bosley, R Caceres, A Ingram, T Karia, ... US Patent 7,287,159, 2007 | 16 | 2007 |
| Set systems with no union of cardinality 0 modulom N Alon, D Kleitman, R Lipton, R Meshulam, M Rabin, J Spencer Graphs and Combinatorics 7 (2), 97-99, 1991 | 16 | 1991 |
| Technical Report LCS MO Rabin TR-212, MIT Laboratory for Computer Science, 1979 | 16 | 1979 |
| Automata on infinite trees and the synthesis problem MO Rabin Hebrew University of Jerusalem. Department of Mathematics, 1969 | 16 | 1969 |
| Efficient end to end verifiable electronic voting employing split value representations MO Rabin, RL Rivest EVOTE 2014, 2014 | 14 | 2014 |
| Linear-consistency testing Y Aumann, J Håstad, MO Rabin, M Sudan Journal of Computer and System Sciences 62 (4), 589-607, 2001 | 14 | 2001 |
| Decidable theories, Handbook of Mathematical Logic (J. Barwise, ed.) M Rabin North-Holland 629, 595, 1977 | 14 | 1977 |
| Probabilistic algorithms, Algorithms and complexity (Proc. Sympos., Carnegie-Mellon Univ., Pittsburgh, PA, 1976) MO Rabin, JF Traub Academic Press, New York, 1975 | 14 | 1975 |
| The undecidability of some simple theories MO Rabin, D Scott preprint, 1962 | 14 | 1962 |
| Universal groups of automorphisms of models MO Rabin The Theory of Models, 274-284, 2014 | 13 | 2014 |
| Identity-based zero-knowledge J Katz, R Ostrovsky, MO Rabin International Conference on Security in Communication Networks, 180-192, 2004 | 13 | 2004 |
| Handbook of Mathematical Logic, chapter Decidable theories MO Rabin North Holland, 1977 | 13 | 1977 |
| Digitalized signatures and public-key functions as intractable as factorization (No. MIT/LCS/TR-212) MO Rabin Massachusetts Inst of Tech Cambridge Lab for Computer Science, 1979 | 12 | 1979 |
| Solving linear equations by means of scalar products MO Rabin Complexity of Computer Computations: Proceedings of a symposium on the …, 1972 | 12 | 1972 |
| Practical secrecy-preserving, verifiably correct and trustworthy auctions DC Parkes, MO Rabin, SM Shieber, CA Thorpe US Patent App. 13/207,245, 2011 | 11 | 2011 |
| Digitalizedsignaturesandpublic-keyfunctionsasintractableasfactorization MO Rabin Technicalreport, Cambridge, MA, USA, 1979 | 11 | 1979 |
| Weakly definable relations and special automata, in" Mathematical Logic and Foundations of Set Theory"(Y. Bar-Hillel, Ed.) MO Rabin North-Holland, Amsterdam/London, 1970 | 11 | 1970 |
| Howtoexchangesecretsbyoblivioustransfer MO Rabin harvard Center for Re-Searchin Computer Technology, Cambridge, MaSS, 1981 | 10 | 1981 |
| Mail certification by randomization M Blum, MO Rabin to appear, 0 | 10 | |
| Random number generation M Rabin, W Yang, H Rao US Patent App. 10/887,713, 2006 | 9 | 2006 |
| How to exchange secrets with oblivious transfer, IACR Cryptol. ePrint Arch MO Rabin | 9 | 2005 |
| Lower bounds for randomized mutual exclusion E Kushilevitz, Y Mansour, MO Rabin, D Zuckerman Proceedings of the twenty-fifth annual ACM symposium on Theory of Computing …, 1993 | 9 | 1993 |
| Digitalized signatures and public key functions as intractable as factorization. Massachusetts Institute of Technology M Rabin Reading, MA, USA, 1979 | 9 | 1979 |
| Decidability and definability in second-order theories MO Rabin | 9 | 1975 |
| Automata on Infinite Objects and Church’s Problem. Number 13 in Conference Series in Mathematics MO Rabin American Mathematical Society, 1969 | 9 | 1969 |
| Grundgedanken einer typenfreien Logik W Ackermann, Y Bar-Hillel, EIJ Poznanski, MO Rabin, A Robinson | 9 | 1967 |
| Basic verifiability in the combinatory theory of restricted generality HB Curry, Y Bar-Hillel, EIJ Poznanski, MO Rabin, A Robinson | 8 | 1970 |
| How to exchange secrets by oblivious transfer (Tech. Rep. No. TR-81) M Rabin Boston, MA: Harvard University, 2009 | 7 | 2009 |
| Hyper encryption and everlasting secrets: A survey MO Rabin Italian Conference on Algorithms and Complexity, 7-10, 2003 | 7 | 2003 |
| Linear consistency testing Y Aumann, J Håstad, MO Rabin, M Sudan International Workshop on Randomization and Approximation Techniques in …, 1999 | 7 | 1999 |
| Cryogenic fault or error-detecting and correcting system having spare channel substitution LH Haibt, MO Rabin US Patent 3,364,468, 1968 | 7 | 1968 |
| An Interview with Michael Rabin D Shasha Communications of the ACM 53 (2), 37-42, 2010 | 6 | 2010 |
| Hyper-encryption by virtual satellite MO Rabin Science Center Research Lecture Series, 2003 | 6 | 2003 |
| How to exchange secrets by oblivious transfer. Harvard Aiken Comp. Lab M Rabin TR-81, 1981 | 6 | 1981 |
| Applications of the oblivious transfer M Blum, M Rabin CRYPT081 workshop in Santa Barbara, 1981 | 6 | 1981 |
| Super-exponential complexity of presburger arithmetic. Project MAC Tech. Memorandum 43 MJ Fischer, MO Rabin MIT, Cambridge, 1974 | 6 | 1974 |
| Automata on Infinite Objects and Church's Problem. 1972 MO Rabin CBMS Reg. Conf. Ser. Math, 1972 | 6 | 1972 |
| Degree of difficulty of computing a function and hierarchy of recursive sets MO Rabin Tech. Rep. 2, Hebrew University, Jerusalem, 1960 | 6 | 1960 |
| Characterization of convex systems of axioms M Rabin Notices of the American Mathematical Society 7, 503, 1960 | 6 | 1960 |
| Digitized signatures MO Rabin Foundations of Secure Computation (New York, 1978) RA DeMillo, DP Dobkin, AK …, 0 | 6 | |
| Turing, Church, Gödel, Computability MO Rabin Complexity and Randomization: A Personal View, 2012 | 5 | 2012 |
| How To Exchange Secrets with Oblivious Transfer. IACR Cryptol. ePrint Arch.(2005), 187 MO Rabin | 5 | 2005 |
| Provably secure and non-malleable encryption YZ Ding, MO Rabin To appear, 2001 | 5 | 2001 |
| Information theoretically secure communication in the limited storage space mode A Yonatan, MO Rabin Proc. Int. Cryptology Conf., Santa Barbara, California, USA, 65-79, 1999 | 5 | 1999 |
| Challenges for theory of computing A Condon, H Edelsbrunner, EA Emerson, L Fortnow, R Karp, D Leivant, ... Report of an NSF-Sponsored Workshop on Research in Theoretical Computer Science, 1999 | 5 | 1999 |
| Transaction protection by beacons. Aiken Computation Lab. Harverd University Cambridge M Rabin MA, Tech. Rep, 1981 | 5 | 1981 |
| Computable algebraic systems MO Rabin, MO Rabin | 5 | 1967 |
| Probabilistic Automata, Sequential Machines MO Rabin Addison-Wesley, Reading, MA, 1964 | 5 | 1964 |
| Probabilistic automata. Information and Control. 6 (3), 230-245 (1963).(русский перевод: Рабин МО Вероятностные автоматы MO Rabin Кибернетический сборник.-Вып. 9, 123, 1964 | 5 | 1964 |
| Remarks on finite automata MO Rabin, D Scott Proceedings of the Summer Institute of Symbolic Logic, 106-112, 1957 | 5 | 1957 |
| A note on Helly’s theorem M Rabin Pacific Journal of Mathematics 5 (3), 363-366, 1955 | 5 | 1955 |
| Implementation of A Time-Lapse Cryptography Service CA Thorpe, M Barrientos, MO Rabin IEEE Symposium on Security and Privacy, Oakland, 2009 | 4 | 2009 |
| Lower bounds for randomized mutual exclusion E Kushilevitz, Y Mansour, MO Rabin, D Zuckerman SIAM Journal on Computing 27 (6), 1550-1563, 1998 | 4 | 1998 |
| Technical Report MIT/LCS/TR212 M Rabin MIT Laboratory for Computer Science) Digitalized signature as intractable as …, 1978 | 4 | 1978 |
| O.(1978). Digitalized Signatures and Public-Key Functions as Intractable as Factorization M Rabin Foundations of Secure Computations, 155-68, 0 | 4 | |
| On the random properties of a weakly random source N Alon, MO Rabin to appear, 0 | 4 | |
| Practical end-to-end verifiable voting via split-value representations and randomized partial checking MO Rabin, RL Rivest Cal Tech/MIT Voting Technology Project Working, 2014 | 3 | 2014 |
| Hashing on strings, cryptography, and protection of privacy MO Rabin Proceedings. Compression and Complexity of SEQUENCES 1997 (Cat. No …, 1997 | 3 | 1997 |
| DNA based computers III RJ Lipton, LF Landweber, MO Rabin, H Rubin, DH Wood DIMACS Workshop, University of Pennsylvania, June, 23-27, 1997 | 3 | 1997 |
| On lotteries with unique winners E Kushilevitz, Y Mansour, MO Rabin SIAM Journal on Discrete Mathematics 8 (1), 93-98, 1995 | 3 | 1995 |
| Optimal parallel pattern matching through randomization MO Rabin Sequences II: Methods in Communication, Security, and Computer Science, 292-299, 1993 | 3 | 1993 |
| Linear disjointness and algebraic complexity W Baur, MO Rabin Logic and Algorithmic, L'Enseignement Mathématique, 35-46, 1982 | 3 | 1982 |
| Aiken Computation Laboratory MO Rabin Harvard University, Boston, 1981 | 3 | 1981 |
| Essays on the Foundations of Mathematics P Bernays, Y Bar-Hillel, EIJ Poznanski, A Robinson, MO Rabin ‘Zur Frage der Unendlichkeitsschemata in der axiomatischen Mengenlehre’, 3-49, 1961 | 3 | 1961 |
| Hyper-encryption and Provably Everlasting Secrets MO Rabin | 2 | 2003 |
| JL Britton. The word problem for groups. Proceedings of the London Mathematical Society, third series, vol. 8 (1958), pp. 493–506.-John L. Britton. The word problem. Annals of … MO Rabin The Journal of Symbolic Logic 29 (4), 205-206, 1964 | 2 | 1964 |
| Practical Provably Correct Voter Privacy Protecting End-to-End Voting Employing Multiparty Computations and Split Value Representations of Votes RL Rivest, MO Rabin Caltech/MIT Voting Technology Project, 2014 | 1 | 2014 |
| Practical End-to-End Verifiable Voting via Split-Value Representations and Randomized Partial Checking RL Rivest, MO Rabin Caltech/MIT Voting Technology Project, 2014 | 1 | 2014 |
| Auction verification S Muthukrishnan, M Rabin, MMM Yung US Patent App. 12/644,778, 2011 | 1 | 2011 |
| Provably unbreakable hyper-encryption using distributed systems MO Rabin International Symposium on Distributed Computing, 575-577, 2006 | 1 | 2006 |
| Computationally hard algebraic problems MO Rabin Proceedings of 37th Conference on Foundations of Computer Science, 284-289, 1996 | 1 | 1996 |
| ITOSS: An integrated toolkit for operating system security M Rabin, JD Tygar International Conference on Foundations of Data Organization and Algorithms …, 1989 | 1 | 1989 |
| Michael Rabin M Rabin, L Pommers EMI classics, 1989 | 1 | 1989 |
| Series A G Andrews, A Barlotti, F Buekenhout, P Cameron, P Erd6s, P Frankl, ... CBMS Regional Conference Series in Math., 1986 | 1 | 1986 |
| Efficient signature generation by smart cards MO Rabin Foundations of Secure Computation, 155-168, 1978 | 1 | 1978 |
| Information and Control ER Berlekamp, RL Graham, A Salomaa, SA Cook, R Karp, RI Soare, ... Coding theory and the Mathieu groups 18, 40-64, 1971 | 1 | 1971 |
| mathematical log" IC MO RABIN, JH ROGERS Jr | 1 | 1970 |
| Technology of heat treatment by induction heating MO Rabin, AG Orlovskii Metal Science and Heat Treatment 5 (6), 330-333, 1963 | 1 | 1963 |
| Essays on the foundations of mathematics. Dedicated to AA Fraenkel on his seventieth anniversary Y Bar-Hillel, EIJ Poznanski, MO Rabin, A Robinson North-Holland, 1962 | 1 | 1962 |
| Caprices, op. 1 N Paganini, G Poulet (No Title), 1950 | 1 | 1950 |
| Jouruai! of COMPLEXITY YS Abu-Mostafa, K Arrow, G Debreu, Z Galil, L Hurwicz, J Kadane, R Karp, ... | 1 | |
| The Information Dispersal Algorithm MO Rabin Sequences: Combinatorics, Compression, Security, and Transmission, 406, 2012 | | 2012 |
| Method and apparatus for protecting information and privacy MO Rabin, DE Shasha, Y Beinart, R Caceres, T Karia, D Molnar, ... US Patent 8,327,453, 2012 | | 2012 |
| Never too early to begin: computer science for high-school students MO Rabin Proceedings of the 17th ACM annual conference on Innovation and technology …, 2012 | | 2012 |
| Innovations in Theoretical Computer Science (ITCS) S Arora, M Blum, B Chazelle, O Goldreich, S Goldwasser, R Karp, ... | | 2012 |
| Cryptographic Combinatorial Clock Proxy Auctions C Thorpe, DC Parkes, MO Rabin | | 2008 |
| DISC 20th Anniversary: Invited Talk Provably Unbreakable Hyper-Encryption Using Distributed Systems MO Rabin International Symposium on Distributed Computing, 506-508, 2007 | | 2007 |
| Provably Unbreakable Hyper-Encryption Using Distributed Systems (DISC 20th Anniversary: Invited Talk) MO Rabin LECTURE NOTES IN COMPUTER SCIENCE 4731, 506, 2007 | | 2007 |
| The Hilton New York Hotel New York, NY December 27–29, 2005 S Artemov, P Koellner, M Rabin, J Avigad, W Sieg, W Tait, H Gaifman, ... The Bulletin of Symbolic Logic 12 (3), 2006 | | 2006 |
| Preventing Piracy While Preserving Privacy MO Rabin, DE Shasha Dr. Dobb's Journal 30 (10), 16-18, 2005 | | 2005 |
| Preventing Piracy While Preserving Privacy-The security approach presented here is a privacy-preserving, flexible, andpiracy solution that does not suffer from" Break Once, Run … MO Rabin, DE Shasba Dr Dobb's Journal-Software Tools for the Professional Programmer, 16-25, 2005 | | 2005 |
| Identity-Based Zero-Knowledge J Katz¹¹, R Ostrovsky, MO Rabin Security in Communication Networks:... International Conference, SCN …, 2004 | | 2004 |
| Session VII. A new paradigm for the social sciences? Introductory remarks: Liah Greenfeld moderator: Jonathan Eastwood participants: Ali banuazizi C Casanova, J Friedman, G Hill, N Press, G Prevelakis, MO Rabin, ... | | 2004 |
| Hyperencryption and Provably Everlasting Secrecy by Virtual Satellite MO Rabin ITG FACHBERICHT, 109-110, 2004 | | 2004 |
| Journal of Computer and System Sciences EK Blum, AV Balakrishnan, CC Elgot, PC Fischer, MA Harrison, ... | | 2002 |
| ITR: Information Theoretic Secure Hyper-Encryption and Protocols MO Rabin NSF Award Number 0205423. Directorate for Computer and Information Science …, 2002 | | 2002 |
| doi: 10.1006 Âjcss. 2001.1771, available online at http: ÂÂwww. idealibrary. com on E Allender, Y Aumann, B Awerbuch, Y Azar, VD Blondel, O Bournez, ... Journal of Computer and System Sciences 62, 692, 2001 | | 2001 |
| Algorithms for Maintaining Shared Files in a Mobile Environment Y Aumann, MA Bender, V Liberatore, MO Rabin | | 2000 |
| Asynchronous Parallel Computing, from Theory to Practice MO Rabin Parallel and Distributed Processing Symposium, International, 2000 | | 2000 |
| The infinite binary tree is the set T={0, 1}* of all finite words on {0, 1}. MO RABIN Mathematical Logic and Foundations of Set Theory, Proceedings of an …, 2000 | | 2000 |
| Selecting closest vectors through randomization C Bosley, M Rabin | | 2000 |
| Discussion on computer science and discrete mathematics M Rabin, M Gromov, A Razborov, V Milman, S Klainerman, L Lovasz, ... Modern Birkhäuser Classics, 950, 2000 | | 2000 |
| Efficient Cryptographic Protocols and Protection of Privacy MO Rabin NSF Award Number 9877138. Directorate for Computer and Information Science …, 1999 | | 1999 |
| Correctness of programs and protocols through randomization MO Rabin Annual Asian Computing Science Conference, 1-3, 1997 | | 1997 |
| Theory and System Building for Asynchronous Parallel Computing MO Rabin NSF Award Number 9700365. Directorate for Computer and Information Science …, 1997 | | 1997 |
| Characterization of the Burma Road Rubble Pit at the Savannah River Site, Aiken, South Carolina KG Ward, WL Frazier, TD McAdams, SL McFalls, M Rabin, L Voss Westinghouse Savannah River Co., Aiken, SC (United States), 1996 | | 1996 |
| 1.4 Finite Automata and Their Decision MO Rabin, D Scott Great Papers in Computer Science, 40, 1996 | | 1996 |
| Asynchronous Parallel Computing, Fault Tolerance, and Randomization MO Rabin NSF Award Number 9313775. Directorate for Computer and Information Science …, 1994 | | 1994 |
| a symmetric and fully distributed solution for the dining MO Rabin, D Lehmann A Classical Mind: Essays in Honour of CAR Hoare, 333, 1994 | | 1994 |
| Dependable parallel computing by randomization MO Rabin Conference Organized by INRIA, France, 17-20, 1992 | | 1992 |
| Algorithms for Distributed, Fault-Tolerant and Secure, Computing and for Routing and Control in Parallel Computers MO Rabin NSF Award Number 9007677. Directorate for Computer and Information Science …, 1990 | | 1990 |
| 10] ED Karnin, JW Greene, MH Hellman, On secret sharing systems, IEEE Trans. Inform. Theory, 29 (1983), 35 {41. FJ MacWilliams, NJA Sloane, S Mahmoud, JS Riordan, MO Rabin, ... Scandinavian Workshop on Algorithmic Theory 47, 59, 1990 | | 1990 |
| theory and on the foundations of mathematics. Contributed papers in all areas of logic are welcomed from ASL members. Abstracts should be submitted by February 12, 1989 to … A Pitts, P Pudlak, MO Rabin, P Simon, S Simpson, C Smoryfiski, A Spiess, ... The Journal of Symbolic Logic 53 (4), 1988 | | 1988 |
| Algorithms for Computer and Transaction Security, and for Distributed and Parallel Systems MO Rabin NSF Award Number 8704513. Directorate for Computer and Information Science …, 1987 | | 1987 |
| taneously a survey and a research article; it is technically simple and MO RABIN ACM Turing Award Lectures: The First Twenty Years, 1966 to 1985, 319, 1987 | | 1987 |
| The 1984 ASL Spring Meeting will be held on the campus of Notre Dame University, Notre Dame, Indiana, on 7-8 April 1984 in conjunction with a meeting of the American … J Barwise, A Bel'tyukov, C Berline, B Dahn, J Denef, JE Fenstad, ... The Journal of Symbolic Logic 49 (1), 1984 | | 1984 |
| パネル討論会: 理論計算機科学の展望 S Takasu, R Fagin, MO Rabin, LG Valiant, S Winograd, J Hartmanis, ... 情報処理 24 (11), p1359-1363, 1983 | | 1983 |
| Randomizing Algorithms and Concurrent Computations (ComputerResearch) MO Rabin NSF Award Number 8121431. Directorate for Computer and Information Science …, 1982 | | 1982 |
| Wolfgang J. PAUL, Universität Bielefeld, Fakultät für Mathematik, Uni MO RABIN Logic and Algorithmic: An International Symposium Held in Honour of Ernst …, 1982 | | 1982 |
| BENTLEY, JON LOUIS, 214 JA BERGSTRA, K TAKUMI, MO RABIN, D HAREL, J HULLOT, ... Journal of Computer and System Sciences 25, 436, 1982 | | 1982 |
| crocs sac Lasoro MO Rabin | | 1980 |
| Aristotle, The Works of Aristotle Translated into English, vol. viii, ed. WD Ross (12 vols., London, 1908–1952).–, Aristotle's Categories and de Interpretatione, trans. JL … E Poznanski, M Rabin, A Robinson, S Anniversary Philosophy 76, 634-48, 1979 | | 1979 |
| SYMBOLIC LOGIC G HASENJAEGER, H HERMES, HJ KEISLER, A LEVY, D MONK, ... | | 1978 |
| OFFICERS OF THE DIVISION J Hintikka, AJ Ayer, S Korner, CRE Butts, B Ellis, S Feferman, ... Basic Problems in Methodology and Linguistics: Part Three of the Proceedings …, 1977 | | 1977 |
| European meeting of the Association for Symbolic Logic S Aanderaa, J Barwise, J Berg, P Eklof, Y Ershov, S Feferman, J Fenstad, ... The Journal of Symbolic Logic 42 (3), 1977 | | 1977 |
| A. Mostowskit MO Rabin, H Rogers Jr, I Jerusalem | | 1976 |
| Fast evaluation of polynomials by rational preparation MO Rabin, S Winograd Matematika 18 (4), 98-120, 1974 | | 1974 |
| AGMON, Shmuel, D. ès Sc. AMITSUR, Shimshon Avraham, Ph. D. RJ AUMANN, H FURSTENBERG, A LEVY, M RABIN, S KANIEL, ... The Hebrew University of Jerusalem, 119, 1972 | | 1972 |
| Meeting of the Association for Symbolic Logic, Atlantic City, 1971 MO Rabin, M Morley The Journal of Symbolic Logic 36 (4), 696-710, 1971 | | 1971 |
| Notice of two directories of philosophy MO Rabin, M Morley The Journal of Symbolic Logic 36 (4), 710-710, 1971 | | 1971 |
| THEORIES OF COMPUTATION. MO Rabin | | 1970 |
| Theories of computation Final report, 15 Jan. 1969- 15 Jan. 1970(Theories of computation including mathematical logic, set theory, and automata theory) MO RABIN | | 1970 |
| MP Schützenberger. On context-free languages and push-downautomata. Information and control, vol. 6 (1963), pp. 246–264. MO Rabin The Journal of Symbolic Logic 34 (2), 297-298, 1969 | | 1969 |
| MP Schützenberger. On the definition of a family ofautomata. Information and control, vol. 4 (1961), pp. 245–270.-MP Schützenberger. Finite countingautomata. Information and … MO Rabin The Journal of Symbolic Logic 34 (2), 296-297, 1969 | | 1969 |
| MP Schützenberger. A remark on finitetransducers. Information and control, vol. 4 (1961), pp. 185–196. MO Rabin The Journal of Symbolic Logic 34 (2), 297-297, 1969 | | 1969 |
| MP Schutzenberger, On the Definition of a Family of Automata; MP Schutzenberger, Finite Counting Automata; MP Schutzenberger, Certain Elementary Families of Automata MO Rabin J. Symbolic Logic 34 (1), 296-297, 1969 | | 1969 |
| List of important publications in computer science NJ Cutland, MO Rabin, DS Scott, JE Hopcroft, JD Ullman, R Motwani Trans. Amer. Math. Soc 141, 1-35, 1969 | | 1969 |
| MATHEMATICAL THEORY OF AUTOMATA MO Rabin¹ Mathematical Aspects of Computer Science 19, 153, 1967 | | 1967 |
| Real Time Computation J Becvar, MO Rabin | | 1966 |
| undecidability of theories. Whereas the usual method for proving that MO RABIN Logic, Methodology, and Philosophy: Proceedings, 58, 1965 | | 1965 |
| model of T is obtained from some model of T₁, then T₁ is also undecidable. It turns out that the semantical form of the principle is particularly convenient for applications … MO RABIN Logic, Methodology, and Philosophy: Proceedings, 58, 1965 | | 1965 |
| ʻAl Profesor Avraham Halevi Frenḳel zal B Mazar, EIJ Poznanski, MO Rabin Hotsaʼat sefarim ʻal shem YL Magnes, ha-Universiṭah ha-ʻIvrit, 1965 | | 1965 |
| G. Higman. Subgroups of finitely presented groups. Proceedings of the Royal Society of London, series A, mathematical and physical sciences, vol. 262 (1961), pp. 455–475. MO Rabin The Journal of Symbolic Logic 29 (4), 204-205, 1964 | | 1964 |
| Higman G.. Subgroups of finitely presented groups. Proceedings of the Royal Society of London, series A, mathematical and physical sciences, vol. 262, pp. 455–475 MO Rabin | | 1964 |
| Britton JL. The word problem for groups. Proceedings of the London Mathematical Society, third series, vol. 8, pp. 493–506. Britton John L.. The word problem. Annals of … MO Rabin | | 1964 |
| Reviews - Günter Asser. Turing-Maschinen und Markowsche Algorithmen. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 5 (1959), pp … MO Rabin The Journal of Symbolic Logic 27 (4), 467-468, 1962 | | 1962 |
| Logique formalisée et raisonnement juridique R Feys | | 1961 |
| Recherche d'une Algèbre Logique Continue N Rouche, W Mays, H Greniewski, MO Rabin, D Scott, JC Shepherdson | | 1960 |
| A. Fröhlich and J. C. Shepherdson. On the factorisation of polynomials in a finite number of steps. Mathematische Zeitschrift, vol. 62, no. 4 (1955), pp. 331–334. - A. Fröhlich … MO Rabin The journal of symbolic logic 24 (2), 169-170, 1959 | | 1959 |
| On Codes for Checking Logical Operations MO Rabin IBM Journal of Research and Development 3, 155, 1959 | | 1959 |
| Fröhlich A. and Shepherdson JC. On the factorisation of polynomials in a finite number of steps. Mathematische Zeitschrift, vol. 62, no. 4, pp. 331–334. Fröhlich A. and … MO Rabin | | 1959 |
| A. Frohlich, JC Shepherdson, On the Factorisation of Polynomials in a Finite Number of Steps; A. Frohlich, JC Shepherdson, Effective Procedures in Field Theory MO Rabin J. Symbolic Logic 24 (1), 169-170, 1959 | | 1959 |
| Yehoshua Bar-Hillel. (On the nature of ethical sentences). (Iyun), vol. 5 no. 1 (1954), pp. 19–23. MO Rabin The Journal of Symbolic Logic 23 (1), 72-73, 1958 | | 1958 |
| Violin concerto no. 1 in F sharp minor H Wieniawski, M Rabin, A Boult, M Bruch, M Bruch Angel Records, 1958 | | 1958 |
| In Chapter I we combine Novikov's result with a certain algebraic con-struction to show that for a very extensive class of group theoretic prop MO RABIN Annals of Mathematics 67 (1), 172, 1958 | | 1958 |
| Bar-Hillel Yehoshua.., vol. 5 no. 1, pp. 19–23 MO Rabin | | 1958 |
| William W. Boone. Certain simple, unsolvable problems of group theory V–VI. Koninklijke Nederlandse Akademie van Wetenschappen, Proceedings, series A, vol. 60 (1957), pp. 22–27 … MO Rabin The Journal of Symbolic Logic 22 (4), 373-374, 1957 | | 1957 |
| William W. Boone. Certain simple, unsolvable problems of group theory I–IV. Koninklijke Nederlandse Akademie van Wetenschappen, Proceedings, series A, vol. 57 (1954), pp. 231–237 … MO Rabin The Journal of Symbolic Logic 22 (4), 372-373, 1957 | | 1957 |
| Boone William W.. Certain simple, unsolvable problems of group theory V–VI. Koninklijke Nederlandse Akademie van Wetenschappen, Proceedings, series A, vol. 60, pp. 22–27, 227 … MO Rabin | | 1957 |
| Scope of the Journal U i Oslo, MO Rabin | | 1912 |
| EDITORS: JE Fenstad Matematisk Institutt, Universitetet i Oslo, Blindern, Oslo 3, Norway K. Kunen Department of Mathematics, University of Wisconsin MO Rabin | | 1912 |
| Cryptography Miracles, Secure Auctions, Matching Problem Verification A solution to the persistent problem of preventing collusion in Vickrey auctions. S Micali, MO Rabin | | |
| Digitalized Signatures and Public Key Functions MO Rabin | | |
| André Cluytens rarities JS Bach, S Prokofiev, R Schumann, J Martzy, M Rabin, M Gendron (No Title), 0 | | |
| Konzertstücke, Duos C Saint-Saëns, P Sarasate, G Dinicu, N Paganini, E Elgar, JE Brandl, ... (No Title), 0 | | |
| Michael Rabin and Ossy Renardy M Rabin, O Renardy, N Paganini, A Dvořák, F Kreisler, H Wieniawski, ... (No Title), 0 | | |
| The art of violin Y Menuhin, DF Oĭstrakh, I Stern, C Ferras, F Kreisler, N Milstein, ... (No Title), 0 | | |
| Violin from films J Pachelbel, P Sarasate, S Barber, JS Bach, J Brahms, AP Borodin, ... (No Title), 0 | | |
| Konzerte N Paganini, H Wieniawski, PI Tchaikovsky, F Mendelssohn-Bartholdy, ... (No Title), 0 | | |
| Solosonaten, Duos, Konzertstücke JS Bach, E Ysaÿe, H Wieniawski, C Debussy, M Ravel, J Massenet, ... (No Title), 0 | | |
| Journal of Computer and System Sciences PC Fischer, MA Harrison, J Hartmanis, J Hopcroft, RM Karp, DE Knuth, ... | | |
| A look at mathematics through the lens of computation M Rabin, N Alon | | |
| a Journal of E Bourtl, LM Adleman, J Bentley, J Edmonds, S Even, M Fischer, Z Galil, ... | | |
| 94305, USA S. Winograd, IBM Thomas J. Watson Research Centre, PO Box 218, Yorktown Heights, NY 10598, USA H. Yamada, Department of Information Science, Faculty of Science … M Rabin, A Salomaa, A Schdnhage, M Takahashi | | |
| Volume 32 Appelt, DE, 173 Chapman, D., 333 Cushing, S., 259 E Davis, TL Dean, J de Kleer, BJ Grosz, JY Halpern, T Imielinski, ... | | |
| 4sJ Journal of LM Adleman, J Bentley, BM Chazelle, J Edmonds, S Even, P Flajolet, ... | | |
| J ournal of Combinatorial C Berge, RC Bose, GB Dantzig, NG de Bruijn, RJ Duffin, FJ Dyson, ... | | |
| EDITOR: J. E Traub YS Abu-Mostafa, K Arrow, G Debreu, Z Galil, L Hurwicz, R Karp, ... | | |
| Combinatorial C Berge, RC Bose, GB Dantzig, NG de Bruijn, RJ Duffin, FJ Dyson, ... | | |
| e9 dournab of J Bentley, DS Johnson, J Edmonds, EL Johnson, S Even, RM Karp, ... | | |
| Editors: ZVI GALIL. DAVID S. JOHNSON LM Adleman, B Awerbuch, BM Chazelle, C Dwork, S Even, J Feigenbaum, ... | | |
| ABgorithms LM Adleman, BM Chazelle, C Dwork, S Even, P Flajolet, HN Gabow, ... | | |
| QD Journal of LM Adleman, J Bentley, J Edmonds, S Even, M Fischer, Z Galil, R Graham, ... | | |
| Editors: DONALD E. KNUTH-HERBERT S. WILF LM Adleman, J Bentley, J Edmonds, S Even, P Flajolet, Z Galil, ... | | |
| DONALD E. KNUTH LM Adleman, J Bentley, J Edmonds, S Even, P Flajolet, Z Galil, ... | | |
| Iournal of Combinatorial Theory C Berge, RC Bose, GB Dantzig, NG de Bruijn, RJ Duffin, FJ Dyson, ... | | |
| EDITOR" Albert R. Meyer ADVISORY BOARD ER Berlekamp, RL Graham, A Salomaa, R Brockett, J Hopcroft, DS Scott, ... | | |
| Paris Toronto ER Berlekamp, R Brockett, SA Cook, M Eden, P Elias, H Friedman, ... | | |
| Albert R. Meyer ER Berlekamp, SA Cook, P Elias, MJ Fischer, H Friedman, RL Graham, ... | | |
| Department of Mathematics, University of California, Los Angeles, California 90024, USA Institute of Mathematics, University of Warsaw MO Rabin, H Rogers Jr | | |
| Scope of the Journal CC Chang, D van Dalen, JE Fenstad, Y Gurevich, J Hartmanis, K Kunen, ... | | |
| EK Blum J Hartmanis, J Hopcroft, RM Karp, DE Knuth, RE Miller, AV Aho, ... | | |
| ER Berlekamp H. Friedman A. Salomaa R. Brockett RL Graham DS Scott SA Cook J. Hopcroft R. 1. Soare M. Eden R. Karp BA Trakhtenbrot P Elias, MO Rabin, HS Witsenhausen, JL Bentley, AJ Kfoury, ... | | |
| Scope of the Journal CC Chang, D van Dalen, JE Fenstad, Y Gurevich, J Hartmanis, K Kunen, ... | | |
| Subscription Information K Kunen, MO Rabin, H Rogers Jr, U i Oslo | | |
| H. Rog~'rs, Jr. A Mogtowski, MO Rabin | | |
| A rithms J Bentley, DS Johnson, N Pippenger, J Edmonds, EL Johnson, M Rabin, ... | | |
| RL Graham J. Hopcroft R. Karp SR Kosaraju MO Rabin, P Elias, H Friedman, JL Bentley, G Berry, M Broy, R De Millo, ... | | |
| 94305, USA S. Winogrk, i&% 4 Thomas J. Watson Research Centre, PO Box 218, Yorktown Heights, NY 10598, USA H. Yamada, Department of Information Science, Faculty of Science … M Rabin, A Salomaa, A Schanhage, E Shamir, R Siromoney, ... | | |
| San Diego Orlando New York Austin Boston London Sydney Tokyo Toronto ER Berlekamp, RL Graham, R Brockett, J Hopcroft, SA Cook, R Karp, ... | | |
| Editors: DONALD E. KNUTH-HERBERT S. WILF N Pippenger, M Rabin, R Sedgewick, CC Sims, J Vuillemin, S Winograd, ... | | |
| 94305, USA S. Winograd, Ii3M Thomas J. Watson Research Centre, PO Box 218, Yorktown Heights, NY 10598, USA II. Yamada, Department of Infotmatiun Science, Faculty of Science … M Rabin, M Takahashi, JD Ulhnan | | |
| Automatic Failure Recovery in a Digital Data Processing System MO Rabin, D Scott, H Cole, MD Reeber | | |
| A Subsidiary of Harcourt Brace Jovanovich, Publishers New York London San Diego San Francisco S~ o Paulo Sydney Tokyo Toronto ER Berlekamp, R Karp, R Brockett, MO Rabin, SA Cook, A Salomaa, ... | | |
| Scope of the Journal A Mostowski, MO Rabin, H Rogers Jr | | |
| AV BALAKRISHNAN H ANTOSIEWICZ, RE BELLMAN, JIM DOUGLAS JR, CC ELGOT, ... | | |
| OxQ are not necessarily confined to A but may lie also in the superdomain A „. The operator O obeys the law of extensionality A ROBINSON, MO RABIN | | |
| Highly Efficient Asynchronous Execution of Large-Grained Parallel Programs YAZM Kedem, KV Palem, MO Rabin | | |
| Πρακτική διατήρηση εχεµύθειας, επαληθεύσιµα ορθές και αξιόπιστες δηµοπρασίες DC Parkes, MO Rabin, SM Shieber, C Thorpe | | |
| Turing award A Newell, HA Simon, MO Rabin, DS Scott | | |
