Boris A. Trakhtenbrot

Affiliations:
  • Tel Aviv University, Israel


According to our database1, Boris A. Trakhtenbrot authored at least 25 papers between 1975 and 2008.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2008
From Logic to Theoretical Computer Science - An Update.
Proceedings of the Pillars of Computer Science, 2008

2004
Understanding Basic Automata Theory in the Continuous Time Setting.
Fundam. Informaticae, 2004

Preface.
Fundam. Informaticae, 2004

Synchronous Circuits over Continuous Time: Feedback Reliability and mpleteness.
Fundam. Informaticae, 2004

2001
Automata, Circuits, and Hybrids: Facets of Continuous Time.
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

1999
Automata and Their Interaction: Definitional Suggestions.
Proceedings of the Fundamentals of Computation Theory, 12th International Symposium, 1999

1997
From Finite Automata toward Hybrid Systems (Extended Abstract).
Proceedings of the Fundamentals of Computation Theory, 11th International Symposium, 1997

1996
On the Power of Compositional Proofs for Nets: Relationships Between Completeness and Modularity.
Fundam. Informaticae, 1996

1995
Origins and Metamorphoses of the Trinity: Logic, Nets, Automata
Proceedings of the Proceedings, 1995

1994
Compositional Proofs for Networks of Processes.
Fundam. Informaticae, 1994

1991
Connectedness and Synchronization.
Theor. Comput. Sci., 1991

On Nets, Algebras and Modularity.
Proceedings of the Theoretical Aspects of Computer Software, 1991

1990
Communication among Relations (Extended Abstract).
Proceedings of the Automata, Languages and Programming, 17th International Colloquium, 1990

1989
Understanding Nets.
Proceedings of the Mathematical Foundations of Computer Science 1989, 1989

Nets and Data Flow Interpreters
Proceedings of the Fourth Annual Symposium on Logic in Computer Science (LICS '89), 1989

Discerning Causality in Interleaving Behavior.
Proceedings of the Logic at Botik '89, 1989

1988
Nets of processes and data flow.
Proceedings of the Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop, Noordwijkerhout, The Netherlands, May 30, 1988

1984
A Survey of Russian Approaches to Perebor (Brute-Force Searches) Algorithms.
IEEE Ann. Hist. Comput., 1984

The Semantics of Local Storage, or What Makes the Free-List Free?
Proceedings of the Conference Record of the Eleventh Annual ACM Symposium on Principles of Programming Languages, 1984

1983
From Denotational to Operational and Axiomatic Semantics for ALGOL-like Languages: an Overview.
Proceedings of the Logics of Programs, 1983

1979
On Relaxation Rules in Algorithmic Logic.
Proceedings of the Mathematical Foundations of Computer Science 1979, 1979

Some reflections on the connection between computer science and the theory of algorithms.
Proceedings of the Algorithms in Modern Mathematics and Computer Science, 1979

1977
Frequency Algorithms and Computations.
Proceedings of the Mathematical Foundations of Computer Science 1977, 1977

1976
Recursive Program Schemas and Computable Functionals.
Proceedings of the Mathematical Foundations of Computer Science 1976, 1976

1975
On Problems Solvable by Successive Trials.
Proceedings of the Mathematical Foundations of Computer Science 1975, 1975


  Loading...