Orna Kupferman

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C

Ask others: ACM DL/Guide -

- CSB - MetaPress - Google - Bing - Yahoo

	2013
j40		Seth Fogarty, Orna Kupferman, Thomas Wilke, Moshe Y. Vardi: Unifying Büchi Complementation Constructions. Logical Methods in Computer Science 9(1) (2013)
j39		Benjamin Aminof, Orna Kupferman, Robby Lampert: Rigorous approximated determinization of weighted automata. Theor. Comput. Sci. 480: 104-117 (2013)
c114		Guy Avni, Orna Kupferman: Parameterized Weighted Containment. FoSSaCS 2013: 369-384
	2012
j38		Orna Kupferman, Tami Tamir: Coping with selfish on-going behaviors. Inf. Comput. 210: 1-12 (2012)
j37		Benjamin Aminof, Orna Kupferman, Aniello Murano: Improved model checking of hierarchical systems. Inf. Comput. 210: 68-86 (2012)
j36		Orna Kupferman, Amir Pnueli, Moshe Y. Vardi: Once and for all. J. Comput. Syst. Sci. 78(3): 981-996 (2012)
j35		Udi Boker, Orna Kupferman: Translating to Co-Büchi Made Tight, Unified, and Useful. ACM Trans. Comput. Log. 13(4): 29 (2012)
c113		Shulamit Halamish, Orna Kupferman: Approximating Deterministic Lattice Automata. ATVA 2012: 27-41
c112		Orna Grumberg, Orna Kupferman, Sarai Sheinvald: Model Checking Systems and Specifications with Parameterized Atomic Propositions. ATVA 2012: 122-136
c111		Guy Avni, Orna Kupferman: Making Weighted Containment Feasible: A Heuristic Based on Simulation and Abstraction. CONCUR 2012: 84-99
c110		Orna Kupferman: Recent Challenges and Ideas in Temporal Synthesis. SOFSEM 2012: 88-98
	2011
c109		Shaull Almagor, Orna Kupferman: Max and Sum Semantics for Alternating Weighted Automata. ATVA 2011: 13-27
c108		Benjamin Aminof, Orna Kupferman, Robby Lampert: Formal Analysis of Online Algorithms. ATVA 2011: 213-227
c107		Shaull Almagor, Udi Boker, Orna Kupferman: What's Decidable about Weighted Automata? ATVA 2011: 482-491
c106		Seth Fogarty, Orna Kupferman, Moshe Y. Vardi, Thomas Wilke: Unifying Büchi Complementation Constructions. CSL 2011: 248-263
c105		Udi Boker, Orna Kupferman: Co-Büching Them All. FOSSACS 2011: 184-198
c104		Shulamit Halamish, Orna Kupferman: Minimizing Deterministic Lattice Automata. FOSSACS 2011: 199-213
c103		Orna Kupferman, Dorsa Sadigh, Sanjit A. Seshia: Synthesis with Clairvoyance. Haifa Verification Conference 2011: 5-19
c102		Udi Boker, Krishnendu Chatterjee, Thomas A. Henzinger, Orna Kupferman: Temporal Specifications with Accumulative Values. LICS 2011: 43-52
c101		Benjamin Aminof, Orna Kupferman, Robby Lampert: Rigorous Approximated Determinization of Weighted Automata. LICS 2011: 345-354
c100		Guy Avni, Orna Kupferman: An Abstraction-Refinement Framework for Trigger Querying. SAS 2011: 263-279
c99		Orna Kupferman, Yoad Lustig, Moshe Y. Vardi, Mihalis Yannakakis: Temporal Synthesis for Bounded Systems and Environments. STACS 2011: 615-626
	2010
j34		Orna Kupferman, Yoad Lustig: Latticed Simulation Relations and Games. Int. J. Found. Comput. Sci. 21(2): 167-189 (2010)
j33		Benjamin Aminof, Orna Kupferman, Robby Lampert: Reasoning about online algorithms with weighted automata. ACM Transactions on Algorithms 6(2) (2010)
j32		Hana Chockler, Joseph Y. Halpern, Orna Kupferman: Erratum for "What causes a system to satisfy a specification?". ACM Trans. Comput. Log. 11(4) (2010)
c98		Shaull Almagor, Yoram Hirshfeld, Orna Kupferman: Promptness in omega-Regular Automata. ATVA 2010: 22-36
c97		Udi Boker, Orna Kupferman: The Quest for a Tight Translation of Büchi to co-Büchi Automata. Fields of Logic and Computation 2010: 147-164
c96		Orna Kupferman, Nir Piterman, Moshe Y. Vardi: An Automata-Theoretic Approach to Infinite-State Systems. Essays in Memory of Amir Pnueli 2010: 202-259
c95		Udi Boker, Orna Kupferman, Avital Steinitz: Parityizing Rabin and Streett. FSTTCS 2010: 412-423
c94		Udi Boker, Orna Kupferman, Adin Rosenberg: Alternation Removal in Büchi Automata. ICALP (2) 2010: 76-87
c93		Orna Grumberg, Orna Kupferman, Sarai Sheinvald: Variable Automata over Infinite Alphabets. LATA 2010: 561-572
c92		Orna Kupferman, Moshe Y. Vardi: Synthesis of Trigger Properties. LPAR (Dakar) 2010: 312-331
c91		Orna Kupferman, Tami Tamir: Coping with Selfish On-Going Behaviors. LPAR (Dakar) 2010: 501-516
c90		Orna Kupferman, Adin Rosenberg: The Blowup in Translating LTL to Deterministic Automata. MoChArt 2010: 85-94
c89		Dana Fisman, Orna Kupferman, Yoad Lustig: Rational Synthesis. TACAS 2010: 190-204
c88		Benjamin Aminof, Orna Kupferman, Aniello Murano: Improved Model Checking of Hierarchical Systems. VMCAI 2010: 61-77
p1		Orna Kupferman: Multi-Valued Automata and Their Applications. Logics and Languages for Reliability and Security 2010: 179-194
	2009
j31		Orna Kupferman, Nir Piterman, Moshe Y. Vardi: From liveness to promptness. Formal Methods in System Design 34(2): 83-103 (2009)
c87		Orna Kupferman, Nir Piterman: Lower Bounds on Witnesses for Nonemptiness of Universal Co-Büchi Automata. FOSSACS 2009: 182-196
c86		Dana Fisman, Orna Kupferman: Reasoning about Finite-State Switched Systems. Haifa Verification Conference 2009: 71-86
c85		Udi Boker, Orna Kupferman: Co-ing Büchi Made Tight and Useful. LICS 2009: 245-254
c84		Benjamin Aminof, Orna Kupferman, Robby Lampert: Reasoning about online algorithms with weighted automata. SODA 2009: 835-844
i2		Dana Fisman, Orna Kupferman, Yoad Lustig: Rational Synthesis. CoRR abs/0907.3019 (2009)
	2008
j30		Hana Chockler, Joseph Y. Halpern, Orna Kupferman: What causes a system to satisfy a specification&quest;. ACM Trans. Comput. Log. 9(3) (2008)
c83		Orna Kupferman, Wenchao Li, Sanjit A. Seshia: A Theory of Mutations with Applications to Vacuity, Coverage, and Fault Tolerance. FMCAD 2008: 1-9
c82		Dana Fisman, Orna Kupferman, Sarai Sheinvald-Faragy, Moshe Y. Vardi: A Framework for Inherent Vacuity. Haifa Verification Conference 2008: 7-22
c81		Benjamin Aminof, Orna Kupferman, Omer Lev: On the Relative Succinctness of Nondeterministic Büchi and co-Büchi Word Automata. LPAR 2008: 183-197
c80		Dana Fisman, Orna Kupferman, Yoad Lustig: On Verifying Fault Tolerance of Distributed Protocols. TACAS 2008: 315-331
c79		Thomas Ball, Orna Kupferman: Vacuity in Testing. TAP 2008: 4-17
c78		Orna Kupferman, Yoad Lustig: Multi-valued Logics, Automata, Simulations, and Games. VMCAI 2008: 5
	2007
j29		Orna Kupferman: Exponential Gaps in our Knowledge. Bulletin of the EATCS 92: 45-64 (2007)
j28		Luca de Alfaro, Thomas A. Henzinger, Orna Kupferman: Concurrent reachability games. Theor. Comput. Sci. 386(3): 188-217 (2007)
c77		Orna Kupferman, Yoad Lustig: Latticed Simulation Relations and Games. ATVA 2007: 316-330
c76		Orna Kupferman, Nir Piterman, Moshe Y. Vardi: From Liveness to Promptness. CAV 2007: 406-419
c75		Thomas Ball, Orna Kupferman, Mooly Sagiv: Leaping Loops in the Presence of Abstraction. CAV 2007: 491-503
c74		Orna Kupferman: Tightening the Exchange Rates Between Automata. CSL 2007: 7-22
c73		Orna Kupferman, Yoad Lustig: What Triggers a Behavior? FMCAD 2007: 146-153
c72		Orna Kupferman, Yoad Lustig: Lattice Automata. VMCAI 2007: 199-213
c71		Thomas Ball, Orna Kupferman: Better Under-Approximation of Programs by Hiding Variables. VMCAI 2007: 314-328
	2006
j27		Orna Kupferman, Shmuel Safra, Moshe Y. Vardi: Relating word and tree automata. Ann. Pure Appl. Logic 138(1-3): 126-146 (2006)
j26		Hana Chockler, Orna Kupferman, Moshe Y. Vardi: Coverage metrics for temporal logic model checking^*. Formal Methods in System Design 28(3): 189-212 (2006)
j25		Ehud Friedgut, Orna Kupferman, Moshe Y. Vardi: Büchi Complementation Made Tighter. Int. J. Found. Comput. Sci. 17(4): 851-868 (2006)
j24		Orna Kupferman, Gila Morgenstern, Aniello Murano: Typeness for omega-regular Automata. Int. J. Found. Comput. Sci. 17(4): 869-884 (2006)
j23		Hana Chockler, Orna Kupferman, Moshe Y. Vardi: Coverage metrics for formal verification. STTT 8(4-5): 373-386 (2006)
j22		Thomas A. Henzinger, Orna Kupferman, Rupak Majumdar: On the universal and existential fragments of the mu-calculus. Theor. Comput. Sci. 354(2): 173-186 (2006)
c70		Orna Kupferman, Robby Lampert: On the Construction of Fine Automata for Safety Properties. ATVA 2006: 110-124
c69		Benjamin Aminof, Orna Kupferman: On the Succinctness of Nondeterminism. ATVA 2006: 125-140
c68		Orna Kupferman, Nir Piterman, Moshe Y. Vardi: Safraless Compositional Synthesis. CAV 2006: 31-44
c67		Orna Kupferman: Sanity Checks in Formal Verification. CONCUR 2006: 37-51
c66		Orna Kupferman, Sarai Sheinvald-Faragy: Finding Shortest Witnesses to the Nonemptiness of Automata on Infinite Words. CONCUR 2006: 492-508
c65		Orna Kupferman: Avoiding Determinization. LICS 2006: 243-254
c64		Orna Kupferman, Moshe Y. Vardi: Memoryful Branching-Time Logic. LICS 2006: 265-274
c63		Thomas Ball, Orna Kupferman: An Abstraction-Refinement Framework for Multi-Agent Systems. LICS 2006: 379-388
c62		Orna Kupferman, Yoad Lustig, Moshe Y. Vardi: On Locally Checkable Properties. LPAR 2006: 302-316
	2005
j21		Orna Kupferman, Moshe Y. Vardi: From complementation to certification. Theor. Comput. Sci. 345(1): 83-100 (2005)
j20		Orna Kupferman, Moshe Y. Vardi: From linear time to branching time. ACM Trans. Comput. Log. 6(2): 273-294 (2005)
c61		Thomas Ball, Orna Kupferman, Greta Yorsh: Abstraction for Falsification. CAV 2005: 67-81
c60		Arindam Chakrabarti, Krishnendu Chatterjee, Thomas A. Henzinger, Orna Kupferman, Rupak Majumdar: Verifying Quantitative Properties Using Bound Functions. CHARME 2005: 50-64
c59		Doron Bustan, Alon Flaisher, Orna Grumberg, Orna Kupferman, Moshe Y. Vardi: Regular Vacuity. CHARME 2005: 191-206
c58		Orna Kupferman, Moshe Y. Vardi: Safraless Decision Procedures. FOCS 2005: 531-542
c57		Orna Kupferman, Moshe Y. Vardi: Complementation Constructions for Nondeterministic Automata on Infinite Words. TACAS 2005: 206-221
	2004
j19		Hana Chockler, Orna Kupferman: w-Regular languages are testable with a constant number of queries. Theor. Comput. Sci. 329(1-3): 71-92 (2004)
c56		Ehud Friedgut, Orna Kupferman, Moshe Y. Vardi: Büchi Complementation Made Tighter. ATVA 2004: 64-78
c55		Orna Kupferman, Gila Morgenstern, Aniello Murano: Typeness for omega-Regular Automata. ATVA 2004: 324-338
c54		Benjamin Aminof, Thomas Ball, Orna Kupferman: Reasoning About Systems with Transition Fairness. LPAR 2004: 194-208
c53		Doron Bustan, Orna Kupferman, Moshe Y. Vardi: A Measured Collapse of the Modal µ-Calculus Alternation Hierarchy. STACS 2004: 522-533
c52		Orna Kupferman, Moshe Y. Vardi: From Complementation to Certification. TACAS 2004: 591-606
	2003
j18		Thomas A. Henzinger, Orna Kupferman, Shaz Qadeer: From Pre-Historic to Post-Modern Symbolic Model Checking. Formal Methods in System Design 23(3): 303-327 (2003)
j17		Orna Kupferman, Moshe Y. Vardi: Vacuity detection in temporal model checking. STTT 4(2): 224-233 (2003)
j16		Orna Kupferman, David Harel: Response to "Comments on 'On Object Systems and Behavior Inheritance'". IEEE Trans. Software Eng. 29(6): 576 (2003)
c51		Orna Kupferman, Nir Piterman, Moshe Y. Vardi: Fair Equivalence Relations. Verification: Theory and Practice 2003: 702-732
c50		Sankar Gurumurthy, Orna Kupferman, Fabio Somenzi, Moshe Y. Vardi: On Complementing Nondeterministic Büchi Automata. CHARME 2003: 96-110
c49		Hana Chockler, Orna Kupferman, Moshe Y. Vardi: Coverage Metrics for Formal Verification. CHARME 2003: 111-125
c48		Orna Kupferman, Moshe Y. Vardi: Pi₂ cap Sigma₂ equiv AFMC. ICALP 2003: 697-713
c47		Thomas A. Henzinger, Orna Kupferman, Rupak Majumdar: On the Universal and Existential Fragments of the µ-Calculus. TACAS 2003: 49-64
c46		Roy Armoni, Doron Bustan, Orna Kupferman, Moshe Y. Vardi: Resets vs. Aborts in Linear Temporal Logic. TACAS 2003: 65-80
i1		Hana Chockler, Joseph Y. Halpern, Orna Kupferman: What Causes a System to Satisfy a Specification? CoRR cs.LO/0312036 (2003)
	2002
j15		Thomas A. Henzinger, Orna Kupferman, Sriram K. Rajamani: Fair Simulation. Inf. Comput. 173(1): 64-81 (2002)
j14		David Harel, Orna Kupferman, Moshe Y. Vardi: On the Complexity of Verifying Concurrent Transition Systems. Inf. Comput. 173(2): 143-161 (2002)
j13		Rajeev Alur, Thomas A. Henzinger, Orna Kupferman: Alternating-time temporal logic. J. ACM 49(5): 672-713 (2002)
j12		David Harel, Orna Kupferman: On Object Systems and Behavioral Inheritance. IEEE Trans. Software Eng. 28(9): 889-903 (2002)
c45		Orna Kupferman, Ulrike Sattler, Moshe Y. Vardi: The Complexity of the Graded µ-Calculus. CADE 2002: 423-437
c44		Orna Kupferman, Nir Piterman, Moshe Y. Vardi: Model Checking Linear Properties of Prefix-Recognizable Systems. CAV 2002: 371-385
c43		Marcin Jurdzinski, Orna Kupferman, Thomas A. Henzinger: Trading Probability for Fairness. CSL 2002: 292-305
c42		Thomas A. Henzinger, Sriram C. Krishnan, Orna Kupferman, Freddy Y. C. Mang: Synthesis of Uninitialized Systems. ICALP 2002: 644-656
c41		Hana Chockler, Orna Kupferman: Coverage of Implementations by Simulating Specifications. IFIP TCS 2002: 409-421
c40		Orna Kupferman, Nir Piterman, Moshe Y. Vardi: Pushdown Specifications. LPAR 2002: 262-277
c39		Orna Kupferman, Sharon Zuhovitzky: An Improved Algorithm for the Membership Problem for Extended Regular Expressions. MFCS 2002: 446-458
c38		Hana Chockler, Orna Kupferman: omega-Regular Languages Are Testable with a Constant Number of Queries. RANDOM 2002: 26-28
	2001
j11		Orna Kupferman, Moshe Y. Vardi: Model Checking of Safety Properties. Formal Methods in System Design 19(3): 291-314 (2001)
j10		Orna Kupferman, Moshe Y. Vardi, Pierre Wolper: Module Checking. Inf. Comput. 164(2): 322-344 (2001)
j9		Orna Kupferman, Moshe Y. Vardi: Weak alternating automata are not that weak. ACM Trans. Comput. Log. 2(3): 408-429 (2001)
c37		Hana Chockler, Orna Kupferman, Robert P. Kurshan, Moshe Y. Vardi: A Practical Approach to Coverage in Model Checking. CAV 2001: 66-78
c36		Orna Kupferman, Nir Piterman, Moshe Y. Vardi: Extended Temporal Logic Revisited. CONCUR 2001: 519-535
c35		Valerie King, Orna Kupferman, Moshe Y. Vardi: On the Complexity of Parity Word Automata. FoSSaCS 2001: 276-286
c34		Orna Kupferman, Moshe Y. Vardi: Synthesizing Distributed Systems. LICS 2001: 389-398
c33		Orna Kupferman, Moshe Y. Vardi: On Bounded Specifications. LPAR 2001: 24-38
c32		Hana Chockler, Orna Kupferman, Moshe Y. Vardi: Coverage Metrics for Temporal Logic Model Checking. TACAS 2001: 528-542
	2000
j8		Shoham Shamir, Orna Kupferman, Eli Shamir: Branching-Depth Hierarchies. Electr. Notes Theor. Comput. Sci. 39(1): 65-78 (2000)
j7		Orna Kupferman, Moshe Y. Vardi, Pierre Wolper: An automata-theoretic approach to branching-time model checking. J. ACM 47(2): 312-360 (2000)
j6		Orna Kupferman, Moshe Y. Vardi: An automata-theortetic approach to modular model checking. ACM Trans. Program. Lang. Syst. 22(1): 87-128 (2000)
c31		Orna Kupferman, Moshe Y. Vardi: An Automata-Theoretic Approach to Reasoning about Infinite-State Systems. CAV 2000: 36-52
c30		Orna Kupferman, P. Madhusudan, P. S. Thiagarajan, Moshe Y. Vardi: Open Systems in Reactive Environments: Control and Synthesis. CONCUR 2000: 92-107
c29		Orna Kupferman, Nir Piterman, Moshe Y. Vardi: Fair Equivalence Relations. FSTTCS 2000: 151-163
c28		Orna Kupferman, Moshe Y. Vardi: µ-Calculus Synthesis. MFCS 2000: 497-507
c27		David Harel, Orna Kupferman: On the Behavioral Inheritance of State-Based Objects. TOOLS (34) 2000: 83-94
	1999
j5		Orna Kupferman, Moshe Y. Vardi: Church's problem revisited. Bulletin of Symbolic Logic 5(2): 245-263 (1999)
j4		Orna Kupferman: Augmenting Branching Temporal Logics with Existential Quantification over Atomic Propositions. J. Log. Comput. 9(2): 135-147 (1999)
c26		Orna Kupferman, Moshe Y. Vardi: Model Checking of Safety Properties. CAV 1999: 172-183
c25		Orna Kupferman, Moshe Y. Vardi: Vacuity Detection in Temporal Model Checking. CHARME 1999: 82-96
c24		Orna Kupferman, Moshe Y. Vardi: Robust Satisfaction. CONCUR 1999: 383-398
c23		Orna Kupferman, Moshe Y. Vardi: The Weakness of Self-Complementation. STACS 1999: 455-466
	1998
j3		Orna Kupferman, Moshe Y. Vardi: Verification of Fair Transition Systems. Chicago J. Theor. Comput. Sci. 1998 (1998)
c22		Thomas A. Henzinger, Orna Kupferman, Shaz Qadeer: From Pre-historic to Post-modern Symbolic Model Checking. CAV 1998: 195-206
c21		Rajeev Alur, Thomas A. Henzinger, Orna Kupferman, Moshe Y. Vardi: Alternating Refinement Relations. CONCUR 1998: 163-178
c20		Luca de Alfaro, Thomas A. Henzinger, Orna Kupferman: Concurrent Reachability Games. FOCS 1998: 564-575
c19		Orna Kupferman, Moshe Y. Vardi: Freedom, Weakness, and Determinism: From Linear-Time to Branching-Time. LICS 1998: 81-92
c18		Orna Kupferman, Moshe Y. Vardi: Relating linear and branching model checking. PROCOMET 1998: 304-326
c17		Orna Kupferman, Moshe Y. Vardi: Weak Alternating Automata and Tree Automata Emptiness. STOC 1998: 224-233
	1997
c16		Orna Kupferman, Moshe Y. Vardi: Module Checking Revisited. CAV 1997: 36-47
c15		Rajeev Alur, Thomas A. Henzinger, Orna Kupferman: Alternating-Time Temporal Logic. COMPOS 1997: 23-60
c14		Orna Kupferman, Moshe Y. Vardi: Modular Model Checking. COMPOS 1997: 381-401
c13		David Harel, Orna Kupferman, Moshe Y. Vardi: On the Complexity of Verifying Concurrent Transition Systems. CONCUR 1997: 258-272
c12		Thomas A. Henzinger, Orna Kupferman, Sriram K. Rajamani: Fair Simulation. CONCUR 1997: 273-287
c11		Orna Kupferman, Robert P. Kurshan, Mihalis Yannakakis: Existence of Reduction Hierarchies. CSL 1997: 327-340
c10		Rajeev Alur, Thomas A. Henzinger, Orna Kupferman: Alternating-time Temporal Logic. FOCS 1997: 100-109
c9		Thomas A. Henzinger, Orna Kupferman: From Quantity to Quality. HART 1997: 48-62
c8		Orna Kupferman, Moshe Y. Vardi: Weak Alternating Automata Are Not That Weak. ISTCS 1997: 147-158
	1996
j2		Orna Kupferman, Orna Grumberg: Branching-Time Temporal Logic and Tree Automata. Inf. Comput. 125(1): 62-69 (1996)
j1		Orna Kupferman, Orna Grumberg: Buy One, Get One Free!!! J. Log. Comput. 6(4): 523-539 (1996)
c7		Orna Kupferman, Moshe Y. Vardi: Module Checking. CAV 1996: 75-86
c6		Orna Kupferman, Moshe Y. Vardi: Verification of Fair Transisiton Systems. CAV 1996: 372-382
c5		Thomas A. Henzinger, Orna Kupferman, Moshe Y. Vardi: A Space-Efficient On-the-fly Algorithm for Real-Time Model Checking. CONCUR 1996: 514-529
c4		Orna Kupferman, Shmuel Safra, Moshe Y. Vardi: Relating Word and Tree Automata. LICS 1996: 322-332
	1995
c3		Orna Kupferman: Augmenting Branching Temporal Logics with Existential Quantification over Atomic Propositions. CAV 1995: 325-338
c2		Orna Kupferman, Moshe Y. Vardi: On the Complexity of Branching Modular Model Checking (Extended Abstract). CONCUR 1995: 408-422
c1		Orna Kupferman, Amir Pnueli: Once and For All. LICS 1995: 25-35

Coauthor Index

1	Luca de Alfaro	[j28] [c20]
2	Shaull Almagor	[c109] [c107] [c98]
3	Rajeev Alur	[j13] [c21] [c15] [c10]
4	Benjamin Aminof	[j39] [j37] [c108] [c101] [j33] [c88] [c84] [c81] [c69] [c54]
5	Roy Armoni	[c46]
6	Guy Avni	[c114] [c111] [c100]
7	Thomas Ball	[c79] [c75] [c71] [c63] [c61] [c54]
8	Udi Boker	[j35] [c107] [c105] [c102] [c97] [c95] [c94] [c85]
9	Doron Bustan	[c59] [c53] [c46]
10	Arindam Chakrabarti	[c60]
11	Krishnendu Chatterjee	[c102] [c60]
12	Hana Chockler	[j32] [j30] [j26] [j23] [j19] [c49] [i1] [c41] [c38] [c37] [c32]
13	Dana Fisman	[c89] [c86] [i2] [c82] [c80]
14	Alon Flaisher	[c59]
15	Seth Fogarty	[j40] [c106]
16	Ehud Friedgut	[j25] [c56]
17	Orna Grumberg	[c112] [c93] [c59] [j2] [j1]
18	Sankar Gurumurthy	[c50]
19	Shulamit Halamish	[c113] [c104]
20	Joseph Y. Halpern	[j32] [j30] [i1]
21	David Harel	[j16] [j14] [j12] [c27] [c13]
22	Thomas A. Henzinger	[c102] [j28] [j22] [c60] [j18] [c47] [j15] [j13] [c43] [c42] [c22] [c21] [c20] [c15] [c12] [c10] [c9] [c5]
23	Yoram Hirshfeld	[c98]
24	Marcin Jurdzinski	[c43]
25	Valerie King	[c35]
26	Sriram C. Krishnan	[c42]
27	Robert P. Kurshan	[c37] [c11]
28	Robby Lampert	[j39] [c108] [c101] [j33] [c84] [c70]
29	Omer Lev	[c81]
30	Wenchao Li	[c83]
31	Yoad Lustig	[c99] [j34] [c89] [i2] [c80] [c78] [c77] [c73] [c72] [c62]
32	P. Madhusudan (Parthasarathy Madhusudan)	[c30]
33	Rupak Majumdar	[j22] [c60] [c47]
34	Freddy Y. C. Mang	[c42]
35	Gila Morgenstern	[j24] [c55]
36	Aniello Murano	[j37] [c88] [j24] [c55]
37	Nir Piterman	[c96] [j31] [c87] [c76] [c68] [c51] [c44] [c40] [c36] [c29]
38	Amir Pnueli	[j36] [c1]
39	Shaz Qadeer	[j18] [c22]
40	Sriram K. Rajamani	[j15] [c12]
41	Adin Rosenberg	[c94] [c90]
42	Dorsa Sadigh	[c103]
43	Shmuel Safra (Muli Safra)	[j27] [c4]
44	Shmuel Sagiv (Mooly Sagiv)	[c75]
45	Ulrike Sattler (Uli Sattler)	[c45]
46	Sanjit A. Seshia	[c103] [c83]
47	Eli Shamir	[j8]
48	Shoham Shamir	[j8]
49	Sarai Sheinvald (Sarai Sheinvald-Faragy)	[c112] [c93] [c82] [c66]
50	Fabio Somenzi	[c50]
51	Avital Steinitz	[c95]
52	Tami Tamir	[j38] [c91]
53	P. S. Thiagarajan	[c30]
54	Moshe Y. Vardi	[j40] [j36] [c106] [c99] [c96] [c92] [j31] [c82] [c76] [j27] [j26] [j25] [j23] [c68] [c64] [c62] [j21] [j20] [c59] [c58] [c57] [c56] [c53] [c52] [j17] [c51] [c50] [c49] [c48] [c46] [j14] [c45] [c44] [c40] [j11] [j10] [j9] [c37] [c36] [c35] [c34] [c33] [c32] [j7] [j6] [c31] [c30] [c29] [c28] [j5] [c26] [c25] [c24] [c23] [j3] [c21] [c19] [c18] [c17] [c16] [c14] [c13] [c8] [c7] [c6] [c5] [c4] [c2]
55	Thomas Wilke	[j40] [c106]
56	Pierre Wolper	[j10] [j7]
57	Mihalis Yannakakis	[c99] [c11]
58	Greta Yorsh	[c61]
59	Sharon Zuhovitzky	[c39]

Colors in the list of coauthors

Last update Sun May 19 16:35:57 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page