K. Etessami. A hierarchy of polynomial-time computable simulations for automata. To appear in Proc. of CONCUR'2002 (August, 2002).
K. Etessami, Th. Wilke, and R. Schuller. Fair simulation relations, parity games, and state space reduction for Buchi automata. In Proc. of 28th Int. Col. on Automata, Languages, and Programming (ICALP'2001).
R. Alur, K. Etessami, and M. Yannakakis. Analysis of recursive state machines. In Proc. of 13th Conf. on Computer-Aided Verification (CAV'2001) .
R. Alur, K. Etessami, and M. Yannakakis. Realizability and verification of MSC graphs. In Proc. of 28th Int. Col. on Automata, Languages, and Programming (ICALP'2001) .
K. Etessami and M. Yannakakis. From rule-based to automata-based testing. In Proc. of 20th IFIP Int. Conf. on Formal Description Techniques/Protocol Specification, Testing and Verification (FORTE/PSTV'2000), 2000.
K. Etessami. A note on a question of Peled and Wilke regarding stutter-invariant LTL, Information Processing Letters , vol. 75 (6), pp. 261-263, 2000.
K. Etessami and G. Holzmann. Optimizing Buchi automata, in Proc. of 11th Int. Conf. on Concurrency Theory (CONCUR'2000) , pp. 153-167, 2000.
R. Alur, K. Etessami, and M. Yannakakis. Inference of message sequence charts, in Proc. of 22nd Int. Conf. on Software Engineering (ICSE'2000) , pp. 304-313, 2000. full version
R. Alur, K. Etessami, S. LaTorre, and D. Peled, Parametric temporal logic for model measuring , in Proc. of 26th Int. Coll. on . Automata, Languages, and Programming (ICALP'99), pp. 159-168, 1999. Journal version will appear in ACM Transactions on Computational Logic , July, 2001.
K. Etessami, Stutter-invariant languages, omega-automata, and temporal logic, in Proc. of 11th Int. Conf. on Computer-Aided Verification (CAV'99) , pp. 236-248, 1999.
K. Etessami, Dynamic tree isomorphism via first-order updates to a relational database, in Proc. of 17th ACM Symp. on Principles of Database Systems (PODS'98) , 1998, pp. 235-243.
K. Etessami, M. Y. Vardi, and Th. Wilke First-order logic with two variables and unary temporal logic, in Proc. of 12th IEEE Symp. on Logic in Computer Science (LICS'97) , pp. 228-235, 1997. Journal version will appear in Information and Computation .
K. Etessami and Th. Wilke. An until hierarchy for temporal logic, Information and Computation , volume 160(1/2), pp. 88-108, 2000. Conference version appeared in Proc. of 11th IEEE Symp. on Logic in Computer Science (LICS'96) , pp. 108-117, 1996.
K. Etessami. Counting quantifiers, successor relations, and logarithmic space, Journal of Computer and System Sciences , volume 54(3), pp. 400-411, 1997. Conference version appeared in Proc. of 10th IEEE Structure in Complexity Theory Conference (Structures'95) , pp. 1-11, 1995.
K. Etessami and N. Immerman, Tree canonization and transitive closure, Information and Computation , volume 157(1/2), pp. 2-24, 2000. Conference version appeared in Proc. of 10th IEEE Symp. on Logic in Computer Science (LICS'95) , pp. 331-341, 1995.
K. Etessami and N. Immerman, Reachability and the power of local ordering, in Theoretical Computer Science , volume 149, pp. 227-260, 1995. Conference version appeared in 11th Symposium on Theoretical Aspects of Computer Science (STACS'94) , pp. 123-135, 1994.