Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/cjtcs/cjtcs1999.bht:"
@article{DBLP:journals/cjtcs/Allender99, author = {Eric Allender}, title = {The Permanent Requires Large Uniform Threshold Circuits}, journal = {Chic. J. Theor. Comput. Sci.}, volume = {1999}, year = {1999}, url = {http://cjtcs.cs.uchicago.edu/articles/1999/7/contents.html}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cjtcs/Allender99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cjtcs/AzizSBBS99, author = {Adnan Aziz and Felice Balarin and Vigyan Singhal and Robert K. Brayton and Alberto L. Sangiovanni{-}Vincentelli}, title = {Equivalences for Fair Kripke Structures}, journal = {Chic. J. Theor. Comput. Sci.}, volume = {1999}, year = {1999}, url = {http://cjtcs.cs.uchicago.edu/articles/1999/12/contents.html}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cjtcs/AzizSBBS99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cjtcs/BealsCGT99, author = {Robert Beals and Richard Chang and William I. Gasarch and Jacobo Tor{\'{a}}n}, title = {On Finding the Number of Graph Automorphisms}, journal = {Chic. J. Theor. Comput. Sci.}, volume = {1999}, year = {1999}, url = {http://cjtcs.cs.uchicago.edu/articles/1999/1/contents.html}, timestamp = {Tue, 14 Dec 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cjtcs/BealsCGT99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cjtcs/CollinDK99, author = {Zeev Collin and Rina Dechter and Shmuel Katz}, title = {Self-Stabilizing Distributed Constraint Satisfaction}, journal = {Chic. J. Theor. Comput. Sci.}, volume = {1999}, year = {1999}, url = {http://cjtcs.cs.uchicago.edu/articles/1999/10/contents.html}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cjtcs/CollinDK99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cjtcs/Erickson99, author = {Jeff Erickson}, title = {Bounds for Linear Satisfiability Problems}, journal = {Chic. J. Theor. Comput. Sci.}, volume = {1999}, year = {1999}, url = {http://cjtcs.cs.uchicago.edu/articles/1999/8/contents.html}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cjtcs/Erickson99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cjtcs/FeigenbaumKVV99, author = {Joan Feigenbaum and Sampath Kannan and Moshe Y. Vardi and Mahesh Viswanathan}, title = {The Complexity of Problems on Graphs Represented as OBDDs}, journal = {Chic. J. Theor. Comput. Sci.}, volume = {1999}, year = {1999}, url = {http://cjtcs.cs.uchicago.edu/articles/1999/5/contents.html}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cjtcs/FeigenbaumKVV99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cjtcs/FennerGHSTV99, author = {Stephen A. Fenner and Frederic Green and Steven Homer and Alan L. Selman and Thomas Thierauf and Heribert Vollmer}, title = {Complements of Multivalued Functions}, journal = {Chic. J. Theor. Comput. Sci.}, volume = {1999}, year = {1999}, url = {http://cjtcs.cs.uchicago.edu/articles/1999/3/contents.html}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cjtcs/FennerGHSTV99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cjtcs/Jagota99, author = {Arun K. Jagota}, title = {Hopfield Neural Networks and Self-Stabilization}, journal = {Chic. J. Theor. Comput. Sci.}, volume = {1999}, year = {1999}, url = {http://cjtcs.cs.uchicago.edu/articles/1999/6/contents.html}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cjtcs/Jagota99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cjtcs/KargKS99, author = {Christoph Karg and Johannes K{\"{o}}bler and Rainer Schuler}, title = {The Complexity of Generating Test Instances}, journal = {Chic. J. Theor. Comput. Sci.}, volume = {1999}, year = {1999}, url = {http://cjtcs.cs.uchicago.edu/articles/1999/4/contents.html}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cjtcs/KargKS99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cjtcs/Kosa99, author = {Martha J. Kosa}, title = {Time Bounds for Strong and Hybrid Consistency for Arbitrary Abstract Data Types}, journal = {Chic. J. Theor. Comput. Sci.}, volume = {1999}, year = {1999}, url = {http://cjtcs.cs.uchicago.edu/articles/1999/9/contents.html}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cjtcs/Kosa99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cjtcs/PaturiPZ99, author = {Ramamohan Paturi and Pavel Pudl{\'{a}}k and Francis Zane}, title = {Satisfiability Coding Lemma}, journal = {Chic. J. Theor. Comput. Sci.}, volume = {1999}, year = {1999}, url = {http://cjtcs.cs.uchicago.edu/articles/1999/11/contents.html}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cjtcs/PaturiPZ99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cjtcs/Wang99, author = {Jie Wang}, title = {Randomized Reductions and Isomorphisms}, journal = {Chic. J. Theor. Comput. Sci.}, volume = {1999}, year = {1999}, url = {http://cjtcs.cs.uchicago.edu/articles/1999/2/contents.html}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cjtcs/Wang99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.