Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/eatcs/eatcs73.bht:"
@article{DBLP:journals/eatcs/Flum01, author = {J{\"{o}}rg Flum}, title = {Tree-Decompositions and the Model-Checking Problem}, journal = {Bull. {EATCS}}, volume = {73}, pages = {78--98}, year = {2001}, timestamp = {Thu, 18 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eatcs/Flum01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eatcs/GatesK01, author = {Ann Q. Gates and Vladik Kreinovich}, title = {Strassen's Algorithm Made (Somewhat) More Natural: {A} Pedagogical Remark}, journal = {Bull. {EATCS}}, volume = {73}, pages = {142--145}, year = {2001}, timestamp = {Thu, 18 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eatcs/GatesK01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eatcs/Grosse-Rhode01, author = {Martin Gro{\ss}e{-}Rhode}, title = {The {DFG} Priority Programme "Integration of Software Specification Techniques for Applications in Engineering"}, journal = {Bull. {EATCS}}, volume = {73}, pages = {52--56}, year = {2001}, timestamp = {Thu, 18 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eatcs/Grosse-Rhode01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eatcs/HalavaH01, author = {Vesa Halava and Tero Harju}, title = {Some New Results on Post Correspondence Problem and Its Modifications}, journal = {Bull. {EATCS}}, volume = {73}, pages = {131--141}, year = {2001}, timestamp = {Thu, 18 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eatcs/HalavaH01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eatcs/Kari01, author = {Jarkko Kari}, title = {A Counter Example to a Conjecture Concerning Synchronizing Words in Finite Automata}, journal = {Bull. {EATCS}}, volume = {73}, pages = {146}, year = {2001}, timestamp = {Thu, 18 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eatcs/Kari01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eatcs/KrishnaR01, author = {Shankara Narayanan Krishna and Raghavan Rama}, title = {A Note on Parallel Rewriting in {P} Systems}, journal = {Bull. {EATCS}}, volume = {73}, pages = {147--151}, year = {2001}, timestamp = {Thu, 18 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eatcs/KrishnaR01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eatcs/Mavronicolas01a, author = {Marios Mavronicolas}, title = {The Distributed Computing Column Distributed Computing Theory to Date (Part {I:} Models and an Example)}, journal = {Bull. {EATCS}}, volume = {73}, pages = {99--106}, year = {2001}, timestamp = {Thu, 18 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eatcs/Mavronicolas01a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eatcs/Melkebeek01, author = {Dieter van Melkebeek}, title = {The Computational Complexity Column Time-Space Lower Bounds for Satisfiability}, journal = {Bull. {EATCS}}, volume = {73}, pages = {57--77}, year = {2001}, timestamp = {Thu, 18 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eatcs/Melkebeek01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eatcs/Siegelmann01, author = {Hava T. Siegelmann}, title = {Neural Computing}, journal = {Bull. {EATCS}}, volume = {73}, pages = {107--130}, year = {2001}, timestamp = {Thu, 18 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eatcs/Siegelmann01.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.