Authors: ALLENDER E BALCAZAR J IMMERMAN N

Citation: E. Allender et al., A FIRST-ORDER ISOMORPHISM THEOREM, SIAM journal on computing, 26(2), 1997, pp. 557-567

Authors: PATNAIK S IMMERMAN N

Citation: S. Patnaik et N. Immerman, DYN-FO - A PARALLEL, DYNAMIC COMPLEXITY CLASS, Journal of computer and system sciences, 55(2), 1997, pp. 199-209

Authors: IMMERMAN N PATNAIK S STEMPLE D

Citation: N. Immerman et al., THE EXPRESSIVENESS OF A FAMILY OF FINITE-SET LANGUAGES, Theoretical computer science, 155(1), 1996, pp. 111-140

Authors: IMMERMAN N LANDAU S

Citation: N. Immerman et S. Landau, THE COMPLEXITY OF ITERATED MULTIPLICATION, Information and computation, 116(1), 1995, pp. 103-116

Authors: ETESSAMI K IMMERMAN N

Citation: K. Etessami et N. Immerman, REACHABILITY AND THE POWER OF LOCAL ORDERING, Theoretical computer science, 148(2), 1995, pp. 261-279

Authors: IMMERMAN N

Citation: N. Immerman, 6TH ANNUAL CONFERENCE ON STRUCTURE IN COMPLEXITY THEORY, JUNE 30 TO JULY 3, 1991 - FOREWORD, Journal of computer and system sciences, 50(3), 1995, pp. 357-357