Search dblp for Publications

export results for "toc:db/journals/tcs/tcs357.bht:"

 download as .bib file

@article{DBLP:journals/tcs/Artemov06,
  author       = {Sergei N. Art{\"{e}}mov},
  title        = {Justified common knowledge},
  journal      = {Theor. Comput. Sci.},
  volume       = {357},
  number       = {1-3},
  pages        = {4--22},
  year         = {2006},
  url          = {https://doi.org/10.1016/j.tcs.2006.03.009},
  doi          = {10.1016/J.TCS.2006.03.009},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Artemov06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/ArtemovM06,
  author       = {Sergei N. Art{\"{e}}mov and
                  Michael W. Mislove},
  title        = {Preface},
  journal      = {Theor. Comput. Sci.},
  volume       = {357},
  number       = {1-3},
  pages        = {1--3},
  year         = {2006},
  url          = {https://doi.org/10.1016/j.tcs.2006.03.008},
  doi          = {10.1016/J.TCS.2006.03.008},
  timestamp    = {Wed, 07 Dec 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/ArtemovM06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/BrezhnevK06,
  author       = {Vladimir Brezhnev and
                  Roman Kuznets},
  title        = {Making knowledge explicit: How hard it is},
  journal      = {Theor. Comput. Sci.},
  volume       = {357},
  number       = {1-3},
  pages        = {23--34},
  year         = {2006},
  url          = {https://doi.org/10.1016/j.tcs.2006.03.010},
  doi          = {10.1016/J.TCS.2006.03.010},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/BrezhnevK06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Buss06,
  author       = {Samuel R. Buss},
  title        = {Polynomial-size Frege and resolution proofs of \emph{st}-connectivity
                  and Hex tautologies},
  journal      = {Theor. Comput. Sci.},
  volume       = {357},
  number       = {1-3},
  pages        = {35--52},
  year         = {2006},
  url          = {https://doi.org/10.1016/j.tcs.2006.03.011},
  doi          = {10.1016/J.TCS.2006.03.011},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Buss06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/DershowitzK06,
  author       = {Nachum Dershowitz and
                  Claude Kirchner},
  title        = {Abstract canonical presentations},
  journal      = {Theor. Comput. Sci.},
  volume       = {357},
  number       = {1-3},
  pages        = {53--69},
  year         = {2006},
  url          = {https://doi.org/10.1016/j.tcs.2006.03.012},
  doi          = {10.1016/J.TCS.2006.03.012},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/DershowitzK06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/FajstrupRG06,
  author       = {Lisbeth Fajstrup and
                  Martin Rau{\ss}en and
                  Eric Goubault},
  title        = {Algebraic topology and concurrency},
  journal      = {Theor. Comput. Sci.},
  volume       = {357},
  number       = {1-3},
  pages        = {241--278},
  year         = {2006},
  url          = {https://doi.org/10.1016/j.tcs.2006.03.022},
  doi          = {10.1016/J.TCS.2006.03.022},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/FajstrupRG06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/HylandPP06,
  author       = {Martin Hyland and
                  Gordon D. Plotkin and
                  John Power},
  title        = {Combining effects: Sum and tensor},
  journal      = {Theor. Comput. Sci.},
  volume       = {357},
  number       = {1-3},
  pages        = {70--99},
  year         = {2006},
  url          = {https://doi.org/10.1016/j.tcs.2006.03.013},
  doi          = {10.1016/J.TCS.2006.03.013},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/HylandPP06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/JaegerES06,
  author       = {Fr{\'{e}}d{\'{e}}ric De Jaeger and
                  Mart{\'{\i}}n H{\"{o}}tzel Escard{\'{o}} and
                  Gabriele Santini},
  title        = {On the computational content of the Lawson topology},
  journal      = {Theor. Comput. Sci.},
  volume       = {357},
  number       = {1-3},
  pages        = {230--240},
  year         = {2006},
  url          = {https://doi.org/10.1016/j.tcs.2006.03.021},
  doi          = {10.1016/J.TCS.2006.03.021},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/JaegerES06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Japaridze06,
  author       = {Giorgi Japaridze},
  title        = {From truth to computability {I}},
  journal      = {Theor. Comput. Sci.},
  volume       = {357},
  number       = {1-3},
  pages        = {100--135},
  year         = {2006},
  url          = {https://doi.org/10.1016/j.tcs.2006.03.014},
  doi          = {10.1016/J.TCS.2006.03.014},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Japaridze06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Krupski06,
  author       = {Nikolai V. Krupski},
  title        = {On the complexity of the reflected logic of proofs},
  journal      = {Theor. Comput. Sci.},
  volume       = {357},
  number       = {1-3},
  pages        = {136--142},
  year         = {2006},
  url          = {https://doi.org/10.1016/j.tcs.2006.03.015},
  doi          = {10.1016/J.TCS.2006.03.015},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Krupski06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Krupski06a,
  author       = {Vladimir Krupski},
  title        = {Referential logic of proofs},
  journal      = {Theor. Comput. Sci.},
  volume       = {357},
  number       = {1-3},
  pages        = {143--166},
  year         = {2006},
  url          = {https://doi.org/10.1016/j.tcs.2006.03.016},
  doi          = {10.1016/J.TCS.2006.03.016},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Krupski06a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Naumov06,
  author       = {Pavel Naumov},
  title        = {Logic of subtyping},
  journal      = {Theor. Comput. Sci.},
  volume       = {357},
  number       = {1-3},
  pages        = {167--185},
  year         = {2006},
  url          = {https://doi.org/10.1016/j.tcs.2006.03.017},
  doi          = {10.1016/J.TCS.2006.03.017},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Naumov06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Pentus06,
  author       = {Mati Pentus},
  title        = {Lambek calculus is NP-complete},
  journal      = {Theor. Comput. Sci.},
  volume       = {357},
  number       = {1-3},
  pages        = {186--201},
  year         = {2006},
  url          = {https://doi.org/10.1016/j.tcs.2006.03.018},
  doi          = {10.1016/J.TCS.2006.03.018},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Pentus06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Schwichtenberg06,
  author       = {Helmut Schwichtenberg},
  title        = {An arithmetic for polynomial-time computation},
  journal      = {Theor. Comput. Sci.},
  volume       = {357},
  number       = {1-3},
  pages        = {202--214},
  year         = {2006},
  url          = {https://doi.org/10.1016/j.tcs.2006.03.019},
  doi          = {10.1016/J.TCS.2006.03.019},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Schwichtenberg06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Slavnov06,
  author       = {Sergey Slavnov},
  title        = {Geometrical semantics for linear logic (multiplicative fragment)},
  journal      = {Theor. Comput. Sci.},
  volume       = {357},
  number       = {1-3},
  pages        = {215--229},
  year         = {2006},
  url          = {https://doi.org/10.1016/j.tcs.2006.03.020},
  doi          = {10.1016/J.TCS.2006.03.020},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Slavnov06.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.