@inproceedings(Agr2001c,
 author       = "Manindra Agrawal",
 year         = "2001",
 title        = "The First-Order Isomorphism Theorem",
 booktitle    = "FST TCS '01: Proc. of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science",
 volume       = "LNCS 2245",
 publisher    = "Springer-Verlag",
 address      = "London, UK",
 pages        = "70--82",
 doi          = "10.1007/3-540-45294-X\_7",
)
@article(Agrawal2011,
 author       = "Manindra Agrawal",
 year         = "2011",
 title        = "The {I}somorphism {C}onjecture for constant depth reductions",
 journal      = "Journal of Computer and System Sciences",
 volume       = "77",
 number       = "1",
 pages        = "3--13",
 doi          = "10.1016/j.jcss.2010.06.003",
)
@inproceedings(All2012,
 author       = "Eric Allender",
 year         = "2012",
 title        = "Investigations Concerning the Structure of Complete Sets",
 booktitle    = "Workshop on Complexity and Logic",
)
@article(AK2010,
 author       = "Eric Allender and Michal Kouck\'{y}",
 year         = "2010",
 title        = "Amplifying lower bounds by means of self-reducibility",
 journal      = "Journal of the ACM",
 volume       = "57",
 pages        = "14:1--14:36",
 doi          = "10.1145/1706591.1706594",
)
@article(AMBCDR2009,
 author       = "Eric Allender and David~A. Mix~Barrington and Tanmoy Chakraborty and Samir Datta and Sambuddha Roy",
 year         = "2009",
 title        = "Planar and Grid Graph Reachability Problems",
 journal      = "Theory of Computing Systems",
 volume       = "45",
 number       = "4",
 pages        = "675--723",
 doi          = "10.1007/s00224-009-9172-z",
)
@article(AJ1993,
 author       = "Carme \'{A}lvarez and Birgit Jenner",
 year         = "1993",
 title        = "A very hard log-space counting class",
 journal      = "Theoretical Computer Science",
 volume       = "107",
 number       = "1",
 pages        = "3--30",
 doi          = "10.1016/0304-3975(93)90252-O",
)
@book(AB2009x,
 author       = "Sanjeev Arora and Boaz Barak",
 year         = "2009",
 title        = "Computational Complexity: A Modern Approach",
 volume       = "978-0-511-53381-5",
 publisher    = "Cambridge University Press",
 doi          = "10.1017/CBO9780511804090",
)
@article(BIS1990p,
 author       = "David A.~Mix Barrington and Neil Immerman and Howard Straubing",
 year         = "1990",
 title        = "On Uniformity within {NC$^1$}",
 journal      = "Journal of Computer and System Sciences",
 volume       = "41",
 number       = "3",
 pages        = "274--306",
 doi          = "10.1016/0022-0000(90)90022-D",
)
@article(BB1988,
 author       = "Ronald~V. Book and Ker-I Ko",
 year         = "1988",
 title        = "On Sets Truth-Table Reducible to Sparse Sets",
 journal      = "SIAM Journal of Computing",
 volume       = "17",
 number       = "5",
 pages        = "903--919",
 doi          = "10.1137/0217056",
)
@article(BHL1995,
 author       = "Harry Buhrman and Edith Hemaspaandra and Luc Longpre",
 year         = "1995",
 title        = "{SPARSE} Reduces Conjunctively to {TALLY}",
 journal      = "SIAM Journal of Computing",
 volume       = "24",
 pages        = "673--681",
 doi          = "10.1137/0224044",
)
@article(CSV1984,
 author       = "Ashok~K. Chandra and Larry~J. Stockmeyer and Uzi Vishkin",
 year         = "1984",
 title        = "Constant Depth Reducibility",
 journal      = "SIAM Journal of Computing",
 volume       = "13",
 number       = "2",
 pages        = "423--439",
 doi          = "10.1137/0213028",
)
@article(FSS1984p,
 author       = "Merrick~L. Furst and James~B. Saxe and Michael Sipser",
 year         = "1984",
 title        = "Parity, circuits and the polynomial-time hierarchy",
 journal      = "Theory of Computing Systems (formerly Mathematical Systems Theory)",
 volume       = "17",
 number       = "1",
 pages        = "13--27",
 doi          = "10.1007/BF01744431",
)
@article(Gol1977p,
 author       = "Leslie~M. Goldschlager",
 year         = "1977",
 title        = "The monotone and planar circuit value problems are log space complete for {P}",
 journal      = "SIGACT News",
 volume       = "9",
 number       = "2",
 pages        = "25--29",
 doi          = "10.1145/1008354.1008356",
)
@book(GHR1995x,
 author       = "Raymand Greenlaw and H.~James Hoover and Walter~L. Ruzzo",
 year         = "1995",
 title        = "Limits to parallel computation: {P-c}ompleteness Theory",
 publisher    = "Oxford University Press",
 address      = "New York, Oxford",
)
@article(HK2010,
 author       = "Kristoffer~Arnsfelt Hansen and Michal Kouck\IeC {\'y}",
 year         = "2010",
 title        = "A New Characterization of {$\mathrm {ACC}^0$} and Probabilistic {$\mathrm {CC}^0$}",
 journal      = "Computational Complexity",
 volume       = "19",
 number       = "2",
 pages        = "211--234",
 doi          = "10.1007/s00037-010-0287-z",
)
@article(Imm1987,
 author       = "Neil Immerman",
 year         = "1987",
 title        = "Languages that capture complexity classes",
 journal      = "SIAM Journal of Computing",
 volume       = "16",
 number       = "4",
 pages        = "760--778",
 doi          = "10.1137/0216051",
)
@article(Imm1988p,
 author       = "Neil Immerman",
 year         = "1988",
 title        = "Nondeterministic Space is Closed Under Complementation",
 journal      = "SIAM Journal of Computing",
 volume       = "17",
 number       = "5",
 pages        = "935--938",
 doi          = "10.1137/0217058",
)
@book(Imm1999x,
 author       = "Neil Immerman",
 year         = "1999",
 title        = "Descriptive Complexity",
 publisher    = "Springer",
 doi          = "10.1007/978-1-4612-0539-5",
)
@article(Ko1989,
 author       = "Ker-I Ko",
 year         = "1989",
 title        = "Distinguishing conjunctive and disjunctive reducibilities by sparse sets",
 journal      = "Information and Computation",
 volume       = "81",
 number       = "1",
 pages        = "62--87",
 doi          = "10.1016/0890-5401(89)90029-1",
)
@article(LLS1975,
 author       = "Richard~E. Ladner and Nancy~A. Lynch and Alan~L. Selman",
 year         = "1975",
 title        = "A comparison of polynomial time reducibilities",
 journal      = "Theoretical Computer Science",
 volume       = "1",
 number       = "2",
 pages        = "103--123",
 doi          = "10.1016/0304-3975(75)90016-X",
)
@inproceedings(MW2010c,
 author       = "Niall Murphy and Damien Woods",
 year         = "2010",
 title        = "Uniformity conditions in natural computing",
 booktitle    = "The 16th International Conference on DNA Computing and Molecular Programming (DNA 16), Preproceedings",
 pages        = "109--120",
 note         = "{HKUST}, {H}ong {K}ong, {C}hina",
)
@book(Pap1993x,
 author       = "Christos~H. Papadimitriou",
 year         = "1993",
 title        = "Computational Complexity",
 publisher    = "Addison Wesley",
)
@inbook(PRRW2009x,
 author       = "Mario~J. P{\'e}rez-Jim{\'e}nez and Agust{\' i}n Riscos-N{\' u}{\~ n}ez and Alvaro Romero\IeC {\textendash }Jim{\'e}nez and Damien Woods",
 year         = "2009",
 title        = "Handbook of Membrane systems",
 chapter      = "12: Complexity -- Membrane Division, Membrane Creation",
 publisher    = "Oxford University Press",
)
@inproceedings(Pau2005c,
 author       = "Gheorghe P\IeC {\u a}un",
 year         = "2005",
 title        = "Further twenty six open problems in membrane computing",
 booktitle    = "Proceedings of the {T}hird {B}rainstorming {W}eek on {M}embrane {C}omputing, {S}evilla ({S}pain)",
 publisher    = "F\IeC {\'e}nix Editoria",
 pages        = "249--262",
)
@article(Sze1988p,
 author       = "R{\'o}bert Szelepcs{\'e}nyi",
 year         = "1988",
 title        = "The Method of Forced Enumeration for Nondeterministic Automata",
 journal      = "Acta Informatica",
 volume       = "26",
 number       = "3",
 pages        = "279--284",
 doi          = "10.1007/BF00299636",
)
@book(Vol1999x,
 author       = "Heribert Vollmer",
 year         = "1999",
 title        = "Introduction to Circuit Complexity: A Uniform Approach",
 publisher    = "Springer-Verlag New York, Inc.",
 address      = "Secaucus, NJ, USA",
 doi          = "10.1007/978-3-662-03927-4",
)