default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexander Moshe Rabinovich
Alexander Rabinovich
Person information
- affiliation: Tel Aviv University, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[c63]Thomas Colcombet, Alexander Rabinovich:
On the Expansion of Monadic Second-Order Logic with Cantor-Bendixson Rank and Order Type Predicates. CSL 2025: 11:1-11:26- [i11]Ohad Drucker, Alexander Rabinovich:
Synthesis of Infinite State Systems. CoRR abs/2501.08713 (2025) - 2024
- [j67]Parthipan Siva, Alexander Wong, Patricia Hewston, George Ioannidis, Jonathan Adachi
, Alexander Rabinovich, Andrea Lee, Alexandra Papaioannou:
Automatic Radar-Based Step Length Measurement in the Home for Older Adults Living with Frailty. Sensors 24(4): 1056 (2024) - [c62]Xuan-Bach Le, Dominik Wagner, Leon Witzman, Alexander Rabinovich, Luke Ong:
Reinforcement Learning with LTL and ω-Regular Objectives via Optimality-Preserving Translation to Average Rewards. NeurIPS 2024 - [i10]Parthipan Siva, Alexander Wong, Patricia Hewston, George Ioannidis, Jonathan Adachi, Alexander Rabinovich, Andrea Lee, Alexandra Papaioannou:
Step length measurement in the wild using FMCW radar. CoRR abs/2401.01868 (2024) - [i9]Alexander Rabinovich, Daniel Fattal:
The Church Synthesis Problem over Continuous Time. CoRR abs/2404.04782 (2024) - [i8]Xuan-Bach Le, Dominik Wagner, Leon Witzman, Alexander Rabinovich, Luke Ong:
Reinforcement Learning with LTL and ω-Regular Objectives via Optimality-Preserving Translation to Average Rewards. CoRR abs/2410.12175 (2024) - 2022
- [j66]Arnon Avron, Nachum Dershowitz, Alexander Rabinovich:
Preface. Fundam. Informaticae 186(1-4) (2022) - [c61]Alexander Rabinovich:
On Uniformization in the Full Binary Tree. MFCS 2022: 77:1-77:14 - 2021
- [j65]Alexander Rabinovich, Doron Tiferet:
On degrees of ambiguity for Büchi tree automata. Inf. Comput. 281: 104750 (2021) - [j64]Alexander Rabinovich, Doron Tiferet:
Ambiguity Hierarchy of Regular Infinite Tree Languages. Log. Methods Comput. Sci. 17(3) (2021) - [c60]Alexander Rabinovich, Doron Tiferet:
Degrees of Ambiguity for Parity Tree Automata. CSL 2021: 36:1-36:20 - [i7]Kalev Alpernas, Aurojit Panda, Alexander Rabinovich, Mooly Sagiv, Scott Shenker, Sharon Shoham, Yaron Velner:
Some Complexity Results for Stateful Network Verification. CoRR abs/2106.01030 (2021) - 2020
- [c59]Alexander Rabinovich:
The Expressive Power of Temporal and First-Order Metric Logics. Fields of Logic and Computation III 2020: 226-246 - [c58]Alexander Rabinovich, Doron Tiferet:
Ambiguity Hierarchy of Regular Infinite Tree Languages. MFCS 2020: 80:1-80:14 - [i6]Alexander Rabinovich, Doron Tiferet:
Ambiguity Hierarchy of Regular Infinite Tree Languages. CoRR abs/2009.02985 (2020)
2010 – 2019
- 2019
- [j63]Kalev Alpernas, Aurojit Panda, Alexander Rabinovich, Mooly Sagiv, Scott Shenker, Sharon Shoham, Yaron Velner:
Some complexity results for stateful network verification. Formal Methods Syst. Des. 54(2): 191-231 (2019) - [c57]Alexander Rabinovich, Doron Tiferet:
Degrees of Ambiguity of Büchi Tree Automata. FSTTCS 2019: 50:1-50:14 - 2018
- [j62]Alexander Rabinovich:
A Proof of Stavi's Theorem. Log. Methods Comput. Sci. 14(1) (2018) - [c56]Alexander Rabinovich:
Complementation of Finitely Ambiguous Büchi Automata. DLT 2018: 541-552 - 2017
- [i5]Alexander Rabinovich:
A Proof of Stavi's Theorem. CoRR abs/1711.03876 (2017) - 2016
- [j61]Dorit Pardo, Alexander Moshe Rabinovich:
No Future without (a hint of) Past: A Finite Basis for 'Almost Future' Temporal Logic. Inf. Comput. 247: 203-216 (2016) - [j60]Ofer Arieli, Beata Konikowska, Alexander Rabinovich, Anna Zamansky:
Foreword. J. Log. Comput. 26(1): 1-6 (2016) - [c55]Alexander Rabinovich:
On Expressive Power of Regular Expressions over Infinite Orders. CSR 2016: 382-393 - [c54]Yaron Velner, Kalev Alpernas, Aurojit Panda, Alexander Rabinovich, Mooly Sagiv, Scott Shenker, Sharon Shoham:
Some Complexity Results for Stateful Network Verification. TACAS 2016: 811-830 - 2015
- [j59]Yaron Velner, Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, Alexander Moshe Rabinovich, Jean-François Raskin:
The complexity of multi-mean-payoff and multi-energy games. Inf. Comput. 241: 177-196 (2015) - [c53]Alexander Rabinovich:
On Almost Future Temporal Logics. Fields of Logic and Computation II 2015: 261-272 - 2014
- [j58]Alexander Rabinovich:
A Proof of Kamp's theorem. Log. Methods Comput. Sci. 10(1) (2014) - 2013
- [c52]Alexander Rabinovich:
An Unusual Temporal Logic. MFCS 2013: 741-752 - 2012
- [j57]Alexander Rabinovich:
Temporal logics over linear time domains are in PSPACE. Inf. Comput. 210: 40-67 (2012) - [j56]Yoram Hirshfeld, Alexander Rabinovich:
Continuous time temporal logic with counting. Inf. Comput. 214: 1-9 (2012) - [j55]Alexander Rabinovich:
The Church problem for expansions of (N, <) by unary predicates. Inf. Comput. 218: 1-16 (2012) - [j54]Alexis Bès, Alexander Rabinovich:
On countable chains having decidable monadic theory. J. Symb. Log. 77(2): 593-608 (2012) - [c51]Alexander Rabinovich:
A Proof of Kamp's theorem. CSL 2012: 516-527 - [c50]Alexander Rabinovich, Sasha Rubin:
Interpretations in Trees with Countably Many Branches. LICS 2012: 551-560 - [c49]Dorit Pardo Ordentlich, Alexander Rabinovich:
A Finite Basis for 'Almost Future' Temporal Logic over the Reals. MFCS 2012: 740-751 - [i4]Yaron Velner, Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, Alexander Rabinovich, Jean-François Raskin:
The Complexity of Multi-Mean-Payoff and Multi-Energy Games. CoRR abs/1209.3234 (2012) - 2011
- [j53]Alexis Bès, Alexander Rabinovich:
Decidable Expansions of Labelled Linear Orderings. Log. Methods Comput. Sci. 7(2) (2011) - [j52]Vince Bárány, Lukasz Kaiser, Alexander Rabinovich:
Expressing cardinality quantifiers in monadic second-order logic over chains. J. Symb. Log. 76(2): 603-619 (2011) - [c48]Mark Jenkins, Joël Ouaknine, Alexander Rabinovich, James Worrell:
The Church Synthesis Problem with Metric. CSL 2011: 307-321 - [c47]Yaron Velner, Alexander Rabinovich:
Church Synthesis Problem for Noisy Input. FoSSaCS 2011: 275-289 - 2010
- [j51]Alexander Rabinovich, Amit Shomrat:
Selection over classes of ordinals expanded by monadic predicates. Ann. Pure Appl. Log. 161(8): 1006-1023 (2010) - [j50]Stéphane Demri, Alexander Rabinovich:
The complexity of linear-time temporal logic over the class of ordinals. Log. Methods Comput. Sci. 6(4) (2010) - [j49]Mikolaj Bojanczyk, Damian Niwinski, Alexander Rabinovich, Adam Radziwonczyk-Syta, Michal Skrzypczak:
On the Borel Complexity of MSO Definable Sets of Branches. Fundam. Informaticae 98(4): 337-349 (2010) - [j48]Vince Bárány, Lukasz Kaiser, Alexander Moshe Rabinovich:
Expressing Cardinality Quantifiers in Monadic Second-Order Logic over Trees. Fundam. Informaticae 100(1-4): 1-17 (2010) - [j47]Aharon Abadi, Alexander Rabinovich, Mooly Sagiv:
Decidable fragments of many-sorted logic. J. Symb. Comput. 45(2): 153-172 (2010) - [j46]Alexander Rabinovich:
The full binary tree cannot be interpreted in a chain. J. Symb. Log. 75(4): 1489-1498 (2010) - [j45]Alexander Rabinovich:
Complexity of metric temporal logics with counting and the Pnueli modalities. Theor. Comput. Sci. 411(22-24): 2331-2342 (2010) - [c46]Alexis Bès, Alexander Rabinovich:
Decidable Expansions of Labelled Linear Orderings. Fields of Logic and Computation 2010: 95-107 - [c45]Mark Jenkins, Joël Ouaknine, Alexander Rabinovich, James Worrell:
Alternating Timed Automata over Bounded Time. LICS 2010: 60-69 - [c44]Alexander Rabinovich:
Temporal Logics over Linear Time Domains Are in PSPACE. RP 2010: 29-50
2000 – 2009
- 2009
- [j44]Alexander Rabinovich:
The Church Problem for Countable Ordinals. Log. Methods Comput. Sci. 5(2) (2009) - [c43]Joël Ouaknine, Alexander Rabinovich, James Worrell:
Time-Bounded Verification. CONCUR 2009: 496-510 - [c42]Vince Bárány, Lukasz Kaiser, Alexander Rabinovich:
Cardinality Quantifiers in MLO over Trees. CSL 2009: 117-131 - [c41]Alexander Rabinovich:
Decidable Extensions of Church's Problem. CSL 2009: 424-439 - [c40]Alexander Rabinovich:
Synthesis of Finite-state and Definable Winning Strategies. FSTTCS 2009: 359-370 - 2008
- [j43]Yoram Hirshfeld, Alexander Moshe Rabinovich:
Decidable metric logics. Inf. Comput. 206(12): 1425-1442 (2008) - [j42]Alexander Rabinovich, Amit Shomrat:
Selection in the monadic theory of a countable ordinal. J. Symb. Log. 73(3): 783-816 (2008) - [j41]Alexander Rabinovich:
Arity hierarchy for temporal logics. Theor. Comput. Sci. 403(2-3): 373-381 (2008) - [c39]Arnon Avron, Nachum Dershowitz, Alexander Rabinovich:
Boris A. Trakhtenbrot: Academic Genealogy and Publications. Pillars of Computer Science 2008: 46-57 - [c38]Alexander Rabinovich, Amit Shomrat:
Selection and Uniformization Problems in the Monadic Theory of Ordinals: A Survey. Pillars of Computer Science 2008: 571-588 - [c37]Alexander Rabinovich:
Complexity of Metric Temporal Logics with Counting and the Pnueli Modalities. FORMATS 2008: 93-108 - [e1]Arnon Avron, Nachum Dershowitz, Alexander Rabinovich:
Pillars of Computer Science, Essays Dedicated to Boris (Boaz) Trakhtenbrot on the Occasion of His 85th Birthday. Lecture Notes in Computer Science 4800, Springer 2008, ISBN 978-3-540-78126-4 [contents] - 2007
- [j40]Alexander Rabinovich:
Composition Theorem for Generalized Sum. Fundam. Informaticae 79(1-2): 137-167 (2007) - [j39]Alexander Rabinovich:
Temporal logics with incommensurable distances are undecidable. Inf. Comput. 205(5): 707-715 (2007) - [j38]Alexander Rabinovich:
On decidability of monadic logic of order over the naturals extended by monadic predicates. Inf. Comput. 205(6): 870-889 (2007) - [j37]Greta Yorsh, Alexander Moshe Rabinovich, Mooly Sagiv, Antoine Meyer, Ahmed Bouajjani:
A logic of reachable patterns in linked data-structures. J. Log. Algebraic Methods Program. 73(1-2): 111-142 (2007) - [j36]Yoram Hirshfeld, Alexander Rabinovich:
Expressiveness of Metric modalities for continuous time. Log. Methods Comput. Sci. 3(1) (2007) - [j35]Alexander Rabinovich:
The Church Synthesis Problem with Parameters. Log. Methods Comput. Sci. 3(4) (2007) - [j34]Alexander Rabinovich:
On compositionality and its limitations. ACM Trans. Comput. Log. 8(1): 4 (2007) - [c36]Alexander Rabinovich, Wolfgang Thomas:
Logical Refinements of Church's Problem. CSL 2007: 69-83 - [c35]Aharon Abadi, Alexander Moshe Rabinovich, Mooly Sagiv:
Decidable Fragments of Many-Sorted Logic. LPAR 2007: 17-31 - [c34]Stéphane Demri, Alexander Rabinovich:
The Complexity of Temporal Logic with Until and Since over Ordinals. LPAR 2007: 531-545 - [i3]Greta Yorsh, Alexander Moshe Rabinovich, Mooly Sagiv, Antoine Meyer, Ahmed Bouajjani:
A Logic of Reachable Patterns in Linked Data-Structures. CoRR abs/0705.3610 (2007) - [i2]Alexander Rabinovich:
The Church Synthesis Problem with Parameters. CoRR abs/0708.3477 (2007) - 2006
- [j33]Alexander Rabinovich:
Quantitative analysis of probabilistic lossy channel systems. Inf. Comput. 204(5): 713-740 (2006) - [j32]Alexander Rabinovich, Philippe Schnoebelen:
BTL2 and the expressive power of ECTL+. Inf. Comput. 204(7): 1023-1044 (2006) - [j31]Danièle Beauquier, Alexander Moshe Rabinovich, Anatol Slissenko:
A Logic of Probability with Decidable Model Checking. J. Log. Comput. 16(4): 461-487 (2006) - [c33]Alexander Moshe Rabinovich:
Church Synthesis Problem with Parameters. CSL 2006: 546-561 - [c32]Alexander Moshe Rabinovich, Wolfgang Thomas:
Decidable Theories of the Ordering of Natural Numbers with Unary Predicates. CSL 2006: 562-574 - [c31]Yoram Hirshfeld, Alexander Moshe Rabinovich:
Expressiveness of Metric Modalities for Continuous Time. CSR 2006: 211-220 - [c30]Alexander Moshe Rabinovich:
Decidability and Expressive Power of Real Time Logics. FORMATS 2006: 32 - [c29]Greta Yorsh, Alexander Moshe Rabinovich, Mooly Sagiv, Antoine Meyer, Ahmed Bouajjani:
A Logic of Reachable Patterns in Linked Data-Structures. FoSSaCS 2006: 94-110 - [c28]Yoram Hirshfeld, Alexander Moshe Rabinovich:
An Expressive Temporal Logic for Real Time. MFCS 2006: 492-504 - [i1]Yoram Hirshfeld, Alexander Rabinovich:
Expressiveness of Metric modalities for continuous time. CoRR abs/cs/0611119 (2006) - 2005
- [j30]Yoram Hirshfeld, Alexander Moshe Rabinovich:
Timer formulas and decidable metric temporal logic. Inf. Comput. 198(2): 148-178 (2005) - [j29]Parosh Aziz Abdulla, Nathalie Bertrand, Alexander Moshe Rabinovich, Philippe Schnoebelen:
Verification of probabilistic systems with faulty communication. Inf. Comput. 202(2): 141-165 (2005) - 2004
- [j28]Yoram Hirshfeld, Alexander Moshe Rabinovich:
Logics for Real Time: Decidability and Complexity. Fundam. Informaticae 62(1): 1-28 (2004) - [j27]Dorit Pardo, Alexander Moshe Rabinovich, Boris A. Trakhtenbrot:
Synchronous Circuits over Continuous Time: Feedback Reliability and mpleteness. Fundam. Informaticae 62(1): 123-137 (2004) - [j26]Alexander Moshe Rabinovich:
Selection and Uniformization in Generalized Product. Log. J. IGPL 12(2): 125-134 (2004) - [c27]Neil Immerman, Alexander Moshe Rabinovich, Thomas W. Reps, Shmuel Sagiv, Greta Yorsh:
Verification via Structure Simulation. CAV 2004: 281-294 - [c26]Neil Immerman, Alexander Moshe Rabinovich, Thomas W. Reps, Shmuel Sagiv, Greta Yorsh:
The Boundary Between Decidability and Undecidability for Transitive-Closure Logics. CSL 2004: 160-174 - [c25]Alexander Moshe Rabinovich:
Composition Theorems for Generalized Sum and Recursively Defined Types. WoLLIC 2004: 209-211 - 2003
- [j25]Faron Moller, Alexander Moshe Rabinovich:
Counting on CTL*: on the expressive power of monadic path logic. Inf. Comput. 184(1): 147-159 (2003) - [j24]Yoram Hirshfeld, Alexander Moshe Rabinovich:
Future temporal logic needs infinitely many modalities. Inf. Comput. 187(2): 196-208 (2003) - [j23]Alexander Moshe Rabinovich:
Automata over continuous time. Theor. Comput. Sci. 300(1-3): 331-363 (2003) - [c24]Parosh Aziz Abdulla, Alexander Moshe Rabinovich:
Verification of Probabilistic Systems with Faulty Communication. FoSSaCS 2003: 39-53 - [c23]Alexander Moshe Rabinovich:
Quantitative Analysis of Probabilistic Lossy Channel Systems. ICALP 2003: 1008-1021 - 2002
- [j22]Y. Abramson, Alexander Moshe Rabinovich:
Decidability of Split Equivalence. Inf. Comput. 173(1): 15-39 (2002) - [j21]Albert R. Meyer, Alexander Rabinovich:
Valid Identity Problem for Shuffle Regular Expressions. J. Autom. Lang. Comb. 7(1): 109-125 (2002) - [j20]Yuri Gurevich, Alexander Moshe Rabinovich:
Definability in Rationals with Real Order in the Background. J. Log. Comput. 12(1): 1-11 (2002) - [j19]Danièle Beauquier, Alexander Moshe Rabinovich:
Monadic Logic of Order over Naturals has no Finite Base. J. Log. Comput. 12(2): 243-253 (2002) - [j18]Alexander Moshe Rabinovich:
Finite variability interpretation of monadic logic of order. Theor. Comput. Sci. 275(1-2): 111-125 (2002) - [c22]Alexander Moshe Rabinovich:
Expressive Power of Temporal Logics. CONCUR 2002: 57-75 - [c21]Danièle Beauquier, Alexander Moshe Rabinovich, Anatol Slissenko:
A Logic of Probability with Decidable Model-Checking. CSL 2002: 306-321 - [c20]Danièle Beauquier, Yoram Hirshfeld, Alexander Moshe Rabinovich, Anatol Slissenko:
The Probability Nesting Game. EXPRESS 2002: 4-14 - 2001
- [j17]Alexander Moshe Rabinovich, Shahar Maoz:
An Infinite Hierarchy of Temporal Logics over Branching Time. Inf. Comput. 171(2): 306-332 (2001) - 2000
- [j16]Alexander Moshe Rabinovich:
Succinctness Gap between Monadic Logic and Duration Calculus. Fundam. Informaticae 42(2): 201-210 (2000) - [j15]Alexander Moshe Rabinovich:
Expressive Completeness of Duration Calculus. Inf. Comput. 156(1-2): 320-344 (2000) - [j14]Yuri Gurevich, Alexander Moshe Rabinovich:
Definability and Undefinability with Real Order at The Background. J. Symb. Log. 65(2): 946-958 (2000) - [j13]Alexander Moshe Rabinovich:
Star free expressions over the reals. Theor. Comput. Sci. 233(1-2): 233-245 (2000) - [j12]Alexander Moshe Rabinovich:
Symbolic model checking for µ-calculus requires exponential time. Theor. Comput. Sci. 243(1-2): 467-475 (2000) - [c19]Alexander Moshe Rabinovich, Shahar Maoz:
Why so Many Temporal Logics Climb up the Trees? MFCS 2000: 629-639
1990 – 1999
- 1999
- [c18]Yoram Hirshfeld, Alexander Moshe Rabinovich:
Quantitative Temporal Logic. CSL 1999: 172-187 - [c17]Yoram Hirshfeld, Alexander Moshe Rabinovich:
A Framework for Decidable Metrical Logics. ICALP 1999: 422-432 - [c16]Faron Moller, Alexander Moshe Rabinovich:
On the Expressive Power of CTL. LICS 1999: 360-368 - 1998
- [j11]Alexander Moshe Rabinovich:
Modularity and Expressibility for Nets of Relations. Acta Informatica 35(4): 293-327 (1998) - [j10]Alexander Moshe Rabinovich:
Non-Elementary Lower Bound for Propositional Duration Calculus. Inf. Process. Lett. 66(1): 7-11 (1998) - [j9]Alexander Moshe Rabinovich:
On the Decidability of Continuous Time Specification Formalisms. J. Log. Comput. 8(5): 669-678 (1998) - [j8]Alexander Moshe Rabinovich:
On Translations of Temporal Logic of Actions Into Monadic Second-Order Logic. Theor. Comput. Sci. 193(1-2): 197-214 (1998) - [c15]Alexander Moshe Rabinovich:
Expressive Completeness of Temporal Logic of Action. MFCS 1998: 229-238 - 1997
- [j7]Alexander Moshe Rabinovich:
On Schematological Equivalence of Partially Interpreted Dataflow Networks. Inf. Comput. 138(1): 49-87 (1997) - [j6]Alexander Moshe Rabinovich:
Complexity of Equivalence Problems for Concurrent Systems of Finite Agents. Inf. Comput. 139(2): 111-129 (1997) - [c14]Alexander Moshe Rabinovich, Boris A. Trakhtenbrot:
From Finite Automata toward Hybrid Systems (Extended Abstract). FCT 1997: 411-422 - [c13]Alexander Moshe Rabinovich:
On expressive completeness of duration and mean value calculi. EXPRESS 1997: 248-261 - 1996
- [j5]Alexander Moshe Rabinovich:
On Schematological Equivalence of Dataflow Networks. Inf. Comput. 124(2): 154-167 (1996) - [c12]Albert R. Meyer, Alexander Moshe Rabinovich:
A solution of an interleaving decision problem by a partial order technique. Partial Order Methods in Verification 1996: 203-211 - 1995
- [j4]Marc R. Best, Marat V. Burnashev, Yannick Lévy, Alexander Moshe Rabinovich, Peter C. Fishburn, A. Robert Calderbank, Daniel J. Costello Jr.:
On a technique to calculate the exact performance of a convolutional code. IEEE Trans. Inf. Theory 41(2): 441-447 (1995) - [j3]A. Robert Calderbank, Peter C. Fishburn, Alexander Moshe Rabinovich:
Covering properties of convolutional codes and associated lattices. IEEE Trans. Inf. Theory 41(3): 732-746 (1995) - 1993
- [c11]A. Robert Calderbank, Peter C. Fishburn, Alexander Moshe Rabinovich:
Sequence Based Methods for Data Transmission and Source Compression. AAECC 1993: 1-12 - [c10]Alexander Moshe Rabinovich:
A Complete Axiomatisation for Trace Congruence of Finite State Behaviors. MFPS 1993: 530-543 - 1992
- [c9]Alexander Moshe Rabinovich:
Logic of Trace Languages (Extended Abstract). CONCUR 1992: 504-517 - [c8]A. Robert Calderbank, Peter C. Fishburn, Alexander Moshe Rabinovich:
Covering Properties of Binary Convolutional Codes and Lattice Quantization of Uniform Sources. Coding And Quantization 1992: 153-159 - [c7]Alexander Moshe Rabinovich:
Checking Equivalences Between Concurrent Systems of Finite Agents (Extended Abstract). ICALP 1992: 696-707 - [c6]Alexander Moshe Rabinovich:
Non Modularity and Expressibility for Nets of Relations. LFCS 1992: 394-405 - 1991
- [j2]Antoni W. Mazurkiewicz, Alexander Moshe Rabinovich, Boris A. Trakhtenbrot:
Connectedness and Synchronization. Theor. Comput. Sci. 90(1): 171-184 (1991) - [c5]Alexander Moshe Rabinovich, Boris A. Trakhtenbrot:
On Nets, Algebras and Modularity. TACS 1991: 176-203 - 1990
- [c4]Alexander Moshe Rabinovich, Boris A. Trakhtenbrot:
Communication among Relations (Extended Abstract). ICALP 1990: 294-307
1980 – 1989
- 1989
- [c3]Yoram Hirshfeld, Alexander Moshe Rabinovich, Boris A. Trakhtenbrot:
Discerning Causality in Interleaving Behavior. Logic at Botik 1989: 146-162 - [c2]Alexander Moshe Rabinovich, Boris A. Trakhtenbrot:
Nets and Data Flow Interpreters. LICS 1989: 164-174 - 1988
- [b1]Alexander Moshe Rabinovich:
Nets and processes. Tel Aviv University, Israel, 1988 - [c1]Alexander Moshe Rabinovich, Boris A. Trakhtenbrot:
Nets of processes and data flow. REX Workshop 1988: 574-602 - 1987
- [j1]Alexander Moshe Rabinovich:
Pomset semantics is consistenct with data flow semantics. Bull. EATCS 32: 107-117 (1987)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-02-24 21:30 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
