I
[IK89] Neil Immerman and Dexter C. Kozen. Definability with Bounded Number of Bound Variables. Information and Computation 83(2):121-139. Academic Press, November 1989. 
@article{icomp83(2)-IK,
  author =              {Immerman, Neil and Kozen, Dexter C.},
  title =               {Definability with Bounded Number of Bound Variables},
  publisher =           {Academic Press},
  journal =             {Information and Computation},
  volume =              {83},
  number =              {2},
  pages =               {121-139},
  year =                {1989},
  month =               nov,
}
[IKO+02] Satoshi Ikeda, Izumi Kubo, Norihiro Okumoto, and Masafumi Yamashita. Local Topological Information and Cover Time. IPSJ SIG Notes 88:27-34. Information Processing Society of Japan, September 2002. 
@article{ipsj88-IKOY,
  author =              {Ikeda, Satoshi and Kubo, Izumi and Okumoto, Norihiro
                         and Yamashita, Masafumi},
  title =               {Local Topological Information and Cover Time},
  publisher =           {Information Processing Society of Japan},
  journal =             {IPSJ SIG Notes},
  volume =              {88},
  pages =               {27-34},
  year =                {2002},
  month =               sep,
}
[IKY+08] Georgeta Igna, Vankatesh Kannan, Yang Yang, Twan Basten, Marc C.W. Geilen, Frits Vaandrager, Marc Voorhoeve, Sebastian de Smet, and Lou J. Somers. Formal Modeling and Scheduling of Datapaths of Digital Document Printers. In FORMATS'08, Lecture Notes in Computer Science 5215, pages 170-187. Springer-Verlag, September 2008. 
@inproceedings{formats2008-IKYBGVVSS,
  author =              {Igna, Georgeta and Kannan, Vankatesh and Yang, Yang
                         and Basten, Twan and Geilen, Marc C.W. and
                         Vaandrager, Frits and Voorhoeve, Marc and de Smet,
                         Sebastian and Somers, Lou J.},
  title =               {Formal Modeling and Scheduling of Datapaths of
                         Digital Document Printers},
  editor =              {Cassez, Franck and Jard, Claude},
  booktitle =           {{P}roceedings of the 6th {I}nternational
                         {C}onferences on {F}ormal {M}odelling and {A}nalysis
                         of {T}imed {S}ystems ({FORMATS}'08)},
  acronym =             {{FORMATS}'08},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {5215},
  pages =               {170-187},
  year =                {2008},
  month =               sep,
}
[Imm81] Neil Immerman. Number of quantifiers is better than number of tape cells. Journal of Computer and System Sciences 22(3):384-406. Academic Press, June 1981. 
@article{jcss22(3)-Imm,
  author =              {Immerman, Neil},
  title =               {Number of quantifiers is better than number of tape
                         cells},
  publisher =           {Academic Press},
  journal =             {Journal of Computer and System Sciences},
  volume =              {22},
  number =              {3},
  pages =               {384-406},
  year =                {1981},
  month =               jun,
  doi =                 {10.1016/0022-0000(81)90039-8},
}
[Imm87] Neil Immerman. Languages That Capture Complexity Classes. SIAM Journal on Computing 16(4):760-778. Society for Industrial and Applied Math., August 1987. 
@article{siamcomp16(4)-Imm,
  author =              {Immerman, Neil},
  title =               {Languages That Capture Complexity Classes},
  publisher =           {Society for Industrial and Applied Math.},
  journal =             {SIAM Journal on Computing},
  volume =              {16},
  number =              {4},
  pages =               {760-778},
  year =                {1987},
  month =               aug,
}
[Imm88] Neil Immerman. Nondeterministic Space is Closed Under Complementation. SIAM Journal on Computing 17(5):935-938. Society for Industrial and Applied Math., October 1988. 
@article{siamcomp17(5)-Imm,
  author =              {Immerman, Neil},
  title =               {Nondeterministic Space is Closed Under
                         Complementation},
  publisher =           {Society for Industrial and Applied Math.},
  journal =             {SIAM Journal on Computing},
  volume =              {17},
  number =              {5},
  pages =               {935-938},
  year =                {1988},
  month =               oct,
}
[Imm99] Neil Immerman. Descriptive complexity. Graduate texts in computer science. Springer-Verlag, 1999. 
@book{Imm-descrcompl,
  author =              {Immerman, Neil},
  title =               {Descriptive complexity},
  publisher =           {Springer-Verlag},
  series =              {Graduate texts in computer science},
  year =                {1999},
  doi =                 {10.1007/978-1-4612-0539-5},
}
[IS99] Balász Imreh and Magnus Steinby. Directable nondeterministic automata. Acta Cybernetica 14(1):105-115. Institute of Informatics, University of Szeged, 1999. 
@article{actacyb14(1)-IS,
  author =              {Imreh, Bal{\'a}sz and Steinby, Magnus},
  title =               {Directable nondeterministic automata},
  publisher =           {Institute of Informatics, University of Szeged},
  journal =             {Acta Cybernetica},
  volume =              {14},
  number =              {1},
  pages =               {105-115},
  year =                {1999},
}
[ISY03] Lucian Ilie, Baozhen Shan, and Sheng Yu. Expression Matching and Searching. In STACS'03, Lecture Notes in Computer Science 2607, pages 179-190. Springer-Verlag, February 2003. 
@inproceedings{stacs2003-ISY,
  author =              {Ilie, Lucian and Shan, Baozhen and Yu, Sheng},
  title =               {Expression Matching and Searching},
  editor =              {Alt, Helmut and Habib, Michel},
  booktitle =           {{P}roceedings of the 20th {S}ymposium on
                         {T}heoretical {A}spects of {C}omputer {S}cience
                         ({STACS}'03)},
  acronym =             {{STACS}'03},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2607},
  pages =               {179-190},
  year =                {2003},
  month =               feb,
}
[IT91] Katsushi Inoue and Itsuo Takanami. A survey of two-dimensional automata theory. Information Science 55(1-3):99-121. June 1991. 
@article{is55(1-3)-IT,
  author =              {Inoue, Katsushi and Takanami, Itsuo},
  title =               {A survey of two-dimensional automata theory},
  journal =             {Information Science},
  volume =              {55},
  number =              {1-3},
  pages =               {99-121},
  year =                {1991},
  month =               jun,
}
[ITN78] Katsushi Inoue, Itsuo Takanami, and Akira Nakamura. A note on Two-dimensional Finite Automata. Information Processing Letters 7(1):49-52. Elsevier, January 1978. 
@article{ipl7(1)-ITN,
  author =              {Inoue, Katsushi and Takanami, Itsuo and Nakamura,
                         Akira},
  title =               {A~note on Two-dimensional Finite Automata},
  publisher =           {Elsevier},
  journal =             {Information Processing Letters},
  volume =              {7},
  number =              {1},
  pages =               {49-52},
  year =                {1978},
  month =               jan,
}
List of authors