%mm6/8/99
% cj99-05--done

@Article{cj99-05-01,
  author =       "J. L. Balc\'{a}zar",
  title =        "The Complexity of Search Implicit Graphs",
  journal =      "Artificial Intelligence",
  year =         "1996",
  volume =       "86",
  pages =        "171--188",
}

@InCollection{cj99-05-02,
  author =       "J. L. Balc\'{a}zar and A. Lozano",
  title =        "The complexity 
		of graph problems for succinctly
                 represented graphs",
  series =       "Lecture Notes in Computer Science",
  volume =       "411",
  pages =        "277--285",
  booktitle =    "Proceedings of 
		Graph-Theoretic Concepts in Computer Science",
  year =         "1989",
  publisher =    "Springer-Verlag",
  address =      "Berlin/Heidelberg/New York"
}

@InCollection{cj99-05-03,
  author =       "J. L. Balc\'{a}zar and A. Lozano and J. Tor\'{a}n",
  title =        "The complexity of Algorithmic Problems on Succinct
                 Instances",
  booktitle =    "Computer Science",
  publisher =    "Plenum Press",
  year =         "1992",
  editor =       "R. Baeza-Yates and U. Manber",
  pages =        "351--377",
  address =      "New York",
}

@InCollection{cj99-05-04,
  author =       "I. Beer and S. Ben-David and D. Geist and 
		R. Gewirtzman and M. Yoeli",
  title =        "Methodology 
		and system for practical formal
                 verification of reactive hardware",
  series =       "Lecture Notes in Computer Science",
  volume =       "818",
  pages =        "182--193",
  booktitle =    "Proceedings of the Sixth International 
                 Conference on Computer-Aided Verification",
  year =         "1994",
  publisher =    "Springer-Verlag",
  address =      "Berlin/Heidelberg/New York"
}

@InCollection{cj99-05-05,
  author =       "C. L. Berman",
  title =        "Ordered 
		Binary Decision Diagrams and Circuit
                 Structure",
  pages =        "392--395",
  booktitle =    "Proceedings of the 
		IEEE International Conference on Computer Design",
  publisher =    "IEEE Computer Society Press",
  address =      "Los Alamitos, CA",
  year =         "1989",
}

@Article{cj99-05-06,
  author =       "R. Bryant",
  title =        "Graph-Based Algorithms for {B}oolean Function Manipulation",
  number =       "C-35",
  pages =        "677--691",
  journal =    "IEEE Transactions on Computers",
  year =         "1986",
}

@Article{cj99-05-07,
  author =       "R. Bryant",
  title =        "Symbolic Manipulation with Ordered Binary Decision
                 Diagrams",
  journal =      "ACM Computing Surveys",
  year =         "1992",
  volume =       "24",
  pages =        "293--318",
}

@Article{cj99-05-08,
  author =       "J. R. Burch and E. M. Clarke and K. L. McMillan and D.
                 L. Dill and L. J. Hwang",
  title =        "Symbolic model checking: $10^{20}$ states and beyond",
  journal =      "Information and Computation",
  year =         "1992",
  volume =       "98",
  pages =        "142--170",
}

@InCollection{cj99-05-09,
  author =       "S. A. Cook",
  title =        "The complexity of 
		theorem proving procedures",
  pages =        "151--158",
  booktitle =    "Proceedings of the Third Annual ACM Symposium 
		on the Theory of
                 Computing",
  publisher =    "ACM",
  address =      "New York",
  year =         "1971",
}

@Article{cj99-05-10,
  author =       "E. M. Clarke and O. Grumberg and H. Hiraishi and S.
                 Jha and D. E. Long and K. L. McMillan and L. A. Ness",
  title =        "Verification of the Futurebus+ Cache Coherence
                 Protocol",
  journal =      "Formal Methods in System Design",
  year =         "1995",
  volume =       "6",
  pages =        "217--232",
}

@Book{cj99-05-11,
  author =       "T. Cormen and C. Leiserson and R. Rivest",
  title =        "Introduction to Algorithms",
  publisher =    "MIT Press",
  year =         "1989",
  address =      "Cambridge",
}

@InCollection{cj99-05-12,
  author =       "E. A. Emerson and C. L. Lei",
  title =        "Efficient Model Checking in Fragments of the
                 Propositional Mu-Calculus",
  pages =        "267--278",
  booktitle =    "Proceedings of the First IEEE Symposium 
		on Logic in Computer Science",
  publisher =    "IEEE Computer Society Press",
  address =      "Los Alamitos, CA",
  year =         "1986",
}

@Article{cj99-05-13,
  author =       "H. Galperin and A. Wigderson",
  title =        "Succinct Representations of Graphs",
  journal =      "Information and Control",
  year =         "1983",
  volume =       "56",
  pages =        "183--198",
}

@Book{cj99-05-14,
  author =       "J. E. Hopcroft and J. D. Ullman",
  title =        "Introduction 
		to Automata Theory, Languages, and
                 Computation",
  publisher =    "Addison-Wesley",
  address =      "Reading, MA",
  year =         "1979",
}

@InCollection{cj99-05-15,
  author =       "O. Kupferman and M. Y. Vardi",
  title =        "Module checking",
  series =       "Lecture Notes in Computer Science",
  volume =       "1102",
  pages =        "75--86",
  booktitle =    "Proceedings of the Eighth International Conference
		on Computer-Aided
                 Verification",
  year =         "1996",
  publisher =    "Springer-Verlag",
  address =      "Berlin/Heidelberg/New York"
}

@Book{cj99-05-16,
  author =       "R. Kurshan",
  title =        "Computer-Aided Verification of Coordinating
                 Proces\-ses: The Au\-to\-ma\-ta-The\-o\-re\-tic
                 Ap\-proach",
  publisher =    "Princeton University Press",
  year =         "1994",
  address =      "Princeton",
}

@InCollection{cj99-05-17,
  author =       "R. Kurshan",
  title =        "The 
		Complexity of Verification",
  pages =        "365--371",
  booktitle =    "Proceedings of the Twenty-sixth ACM 
		Symposium on the Theory of Computing",
  publisher =    "ACM",
  address =      "New York",
  year =         "1994",
}

@Book{cj99-05-18,
  author =       "K. McMillan",
  title =        "Symbolic Model Checking",
  publisher =    "Kluwer",
  year =         "1993",
  address =      "Amsterdam",
}

@Article{cj99-05-19,
  author =       "C. Papadimitriou and M. Yannakakis",
  title =        "A Note on Succinct Representations of Graphs",
  journal =      "Information and Control",
  year =         "1986",
  volume =       "71",
  pages =        "181--185",
}

@InCollection{cj99-05-20,
  author =       "S. Ponzio",
  title =        "A lower 
		bound for integer multiplication with
                 read-once branching programs",
  pages =        "130--139",
  booktitle =    "Proceedings of the Twenty-seventh ACM Symposium
		on the Theory of Computation",
  publisher =    "ACM",
  address =      "New York",
  year =         "1995",
}

@PhdThesis{cj99-05-21,
  author =       "S. Ponzio",
  title =        "Restricted 
		branching programs and hardware
                 Verification",
  school =       "MIT",
  year =         "1995",
}

@InCollection{cj99-05-22,
  author =       "S. Skyum and L. Valiant",
  title =        "A Complexity 
		Theory Based on {B}oolean Algebra",
  pages =        "244--253",
  booktitle =    "Proceedings of the Twenty-third IEEE Symposium 
		on the Foundations of Computer
                 Science",
  publisher =    "IEEE Computer Society Press",
  address =      "Los Alamitos, CA",
  year =         "1982",
}

@InCollection{cj99-05-23,
  author =       "J. Tor\'{a}n",
  title =        "Succinct 
		representations of counting problems",
  series =       "Lecture Notes in Computer Science",
  volume =       "357",
  pages =        "415--426",
  booktitle =    "Proceedings of the Sixth International Conference
		on Applied Algebra,
                 Algebraic Algorithms, and Error-Correcting Codes",
  year =         "1988",
  publisher =    "Springer-Verlag",
  address =      "Berlin/Heidelberg/New York"
}

@TechReport{cj99-05-24,
  author =       "H. Veith",
  title =        "Languages Represented by {B}oolean Formulas",
  institution =  "TU Vienna",
  year =         "1995",
  number =       "TR CD 85/95",
}

@InCollection{cj99-05-25,
  author =       "H. Veith",
  title =        "Succinct Representation, Leaf Languages, and
                 Projection Reductions",
  pages =        "118--126",
  booktitle =    "Proceedings of the Eleventh IEEE Conference on Computational Complexity",
  publisher =    "IEEE Computer Society Press",
  address =      "Los Alamitos, CA",
  year =         "1996",
}

@InCollection{cj99-05-26,
  author =       "H. Veith",
  title =        "How to Encode a Logical Structure as an {OBDD}",
  pages =        "122--131",
  booktitle =    "Thirteenth IEEE Conference on Computational Complexity",
  year =         "1998",
  publisher =    "IEEE Computer Society Press",
  address =      "Los Alamitos, CA",
}