default search action
Search dblp for Publications
export results for "toc:db/journals/eatcs/eatcs84.bht:"
@article{DBLP:journals/eatcs/BlassG04, author = {Andreas Blass and Yuri Gurevich}, title = {Why Sets? (Column: Logic in Computer Science)}, journal = {Bull. {EATCS}}, volume = {84}, pages = {139--156}, year = {2004}, timestamp = {Thu, 18 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eatcs/BlassG04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eatcs/CaludeCM04, author = {Cristian Calude and Elena Calude and Solomon Marcus}, title = {Passages of Proof}, journal = {Bull. {EATCS}}, volume = {84}, pages = {167--188}, year = {2004}, timestamp = {Thu, 18 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eatcs/CaludeCM04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eatcs/FlumG04, author = {J{\"{o}}rg Flum and Martin Grohe}, title = {Parametrized Complexity and Subexponential Time (Column: Computational Complexity)}, journal = {Bull. {EATCS}}, volume = {84}, pages = {71--100}, year = {2004}, timestamp = {Thu, 18 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eatcs/FlumG04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eatcs/GattoJPWW04, author = {Michael Gatto and Riko Jacob and Leon Peeters and Birgitta Weber and Peter Widmayer}, title = {Theory on the Tracks: {A} Selection of Railway Optimization Problems (Column: Algorithmics)}, journal = {Bull. {EATCS}}, volume = {84}, pages = {41--70}, year = {2004}, timestamp = {Thu, 18 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eatcs/GattoJPWW04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eatcs/KhanA04, author = {Samee Ullah Khan and Ishfaq Ahmad}, title = {Some Preliminary Results on Three Combinatorial Board Games}, journal = {Bull. {EATCS}}, volume = {84}, pages = {159--166}, year = {2004}, timestamp = {Thu, 18 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eatcs/KhanA04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eatcs/LeveR04, author = {Florence Lev{\'{e}} and Gw{\'{e}}na{\"{e}}l Richomme}, title = {Quasiperiodic Infinite Words: Some Answers (Column: Formal Language Theory)}, journal = {Bull. {EATCS}}, volume = {84}, pages = {128--138}, year = {2004}, timestamp = {Thu, 18 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eatcs/LeveR04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eatcs/Piirainen04, author = {Ville Piirainen}, title = {Monotone Algebras, R-Trivial Monoids and a Variety of Tree Languages}, journal = {Bull. {EATCS}}, volume = {84}, pages = {189--194}, year = {2004}, timestamp = {Thu, 18 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eatcs/Piirainen04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eatcs/Sobocinski04, author = {Pawel Sobocinski}, title = {Process Congruences from Reaction Rules (Column: Concurrency)}, journal = {Bull. {EATCS}}, volume = {84}, pages = {102--127}, year = {2004}, timestamp = {Thu, 18 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eatcs/Sobocinski04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eatcs/Stay04, author = {Michael Stay}, title = {Inexpensive Linear-Optical Implementations of Deutsch's Algorithm}, journal = {Bull. {EATCS}}, volume = {84}, pages = {195--200}, year = {2004}, timestamp = {Thu, 18 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eatcs/Stay04.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.