Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Boris A. Trakhtenbrot
2000 – 2009
- 2008
[c19]Boris A. Trakhtenbrot: From Logic to Theoretical Computer Science - An Update. Pillars of Computer Science 2008: 1-38- 2004
[j8]
[j7]Boris A. Trakhtenbrot: Understanding Basic Automata Theory in the Continuous Time Setting. Fundam. Inform. 62(1): 69-121 (2004)
[j6]D. Pardo, Alexander Moshe Rabinovich, Boris A. Trakhtenbrot: Synchronous Circuits over Continuous Time: Feedback Reliability and mpleteness. Fundam. Inform. 62(1): 123-137 (2004)- 2001
[c18]
[c17]Boris A. Trakhtenbrot: Automata, circuits and hybrids: facets of continuous time. STOC 2001: 754-755
1990 – 1999
- 1999
[c16]- 1997
[j5]Boris A. Trakhtenbrot: On the Power of Compositional Proofs for Nets: Relationships Between Completeness and Modularity. Fundam. Inform. 30(1): 83-95 (1997)
[c15]Alexander Moshe Rabinovich, Boris A. Trakhtenbrot: From Finite Automata toward Hybrid Systems (Extended Abstract). FCT 1997: 411-422- 1996
[j4]Boris A. Trakhtenbrot: On the Power of Compositional Proofs for Nets: Relationships Between Completeness and Modularity. Fundam. Inform. 28(1-2): 183-195 (1996)- 1995
[c14]Boris A. Trakhtenbrot: Origins and Metamorphoses of the Trinity: Logic, Nets, Automata. LICS 1995: 506-507- 1994
[j3]Boris A. Trakhtenbrot: Compositional Proofs for Networks of Processes. Fundam. Inform. 20(1/2/3): 231-275 (1994)- 1991
[j2]Antoni W. Mazurkiewicz, Alexander Moshe Rabinovich, Boris A. Trakhtenbrot: Connectedness and Synchronization. Theor. Comput. Sci. 90(1): 171-184 (1991)
[c13]Alexander Moshe Rabinovich, Boris A. Trakhtenbrot: On Nets, Algebras and Modularity. TACS 1991: 176-203- 1990
[c12]Alexander Moshe Rabinovich, Boris A. Trakhtenbrot: Communication among Relations (Extended Abstract). ICALP 1990: 294-307
1980 – 1989
- 1989
[c11]Yoram Hirshfeld, Alexander Moshe Rabinovich, Boris A. Trakhtenbrot: Discerning Causality in Interleaving Behavior. Logic at Botik 1989: 146-162
[c10]Alexander Moshe Rabinovich, Boris A. Trakhtenbrot: Nets and Data Flow Interpreters. LICS 1989: 164-174
[c9]- 1988
[c8]Alexander Moshe Rabinovich, Boris A. Trakhtenbrot: Nets of processes and data flow. REX Workshop 1988: 574-602- 1984
[j1]Boris A. Trakhtenbrot: A Survey of Russian Approaches to Perebor (Brute-Force Searches) Algorithms. IEEE Annals of the History of Computing 6(4): 384-400 (1984)
[c7]Joseph Y. Halpern, Albert R. Meyer, Boris A. Trakhtenbrot: The Semantics of Local Storage, or What Makes the Free-List Free? POPL 1984: 245-257- 1983
[c6]Boris A. Trakhtenbrot, Joseph Y. Halpern, Albert R. Meyer: From Denotational to Operational and Axiomatic Semantics for ALGOL-like Languages: an Overview. Logic of Programs 1983: 474-500
1970 – 1979
- 1979
[c5]Boris A. Trakhtenbrot: Some reflections on the connection between computer science and the theory of algorithms. Algorithms in Modern Mathematics and Computer Science 1979: 461-462
[c4]- 1977
[c3]- 1976
[c2]- 1975
[c1]
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-23 18:45 CET by the dblp team



