default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "stream:conf/lam:"
download as .bib file
@proceedings{DBLP:conf/lam/1983,
editor = {Egon B{\"{o}}rger and
Gisbert Hasenjaeger and
Dieter R{\"{o}}dding},
title = {Logic and Machines: Decision Problems and Complexity, Proceedings
of the Symposium "Rekursive Kombinatorik" held from May 23-28, 1983
at the Institut f{\"{u}}r Mathematische Logik und Grundlagenforschung
der Universit{\"{a}}t M{\"{u}}nster/Westfalen},
series = {Lecture Notes in Computer Science},
volume = {171},
publisher = {Springer},
year = {1984},
url = {https://doi.org/10.1007/3-540-13331-3},
doi = {10.1007/3-540-13331-3},
isbn = {3-540-13331-3},
timestamp = {Fri, 17 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/lam/1983.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lam/Aanderaa83,
author = {St{\aa}l Aanderaa},
editor = {Egon B{\"{o}}rger and
Gisbert Hasenjaeger and
Dieter R{\"{o}}dding},
title = {On the solvability of the extended (exist-forall)and(exists-forall*)-Ackermann
class with identity},
booktitle = {Logic and Machines: Decision Problems and Complexity, Proceedings
of the Symposium "Rekursive Kombinatorik" held from May 23-28, 1983
at the Institut f{\"{u}}r Mathematische Logik und Grundlagenforschung
der Universit{\"{a}}t M{\"{u}}nster/Westfalen},
series = {Lecture Notes in Computer Science},
volume = {171},
pages = {270--284},
publisher = {Springer},
year = {1983},
url = {https://doi.org/10.1007/3-540-13331-3\_46},
doi = {10.1007/3-540-13331-3\_46},
timestamp = {Fri, 17 Jul 2020 16:12:46 +0200},
biburl = {https://dblp.org/rec/conf/lam/Aanderaa83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lam/Ambos-Spies83,
author = {Klaus Ambos{-}Spies},
editor = {Egon B{\"{o}}rger and
Gisbert Hasenjaeger and
Dieter R{\"{o}}dding},
title = {P-mitotic sets},
booktitle = {Logic and Machines: Decision Problems and Complexity, Proceedings
of the Symposium "Rekursive Kombinatorik" held from May 23-28, 1983
at the Institut f{\"{u}}r Mathematische Logik und Grundlagenforschung
der Universit{\"{a}}t M{\"{u}}nster/Westfalen},
series = {Lecture Notes in Computer Science},
volume = {171},
pages = {1--23},
publisher = {Springer},
year = {1983},
url = {https://doi.org/10.1007/3-540-13331-3\_30},
doi = {10.1007/3-540-13331-3\_30},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/lam/Ambos-Spies83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lam/BlassG83,
author = {Andreas Blass and
Yuri Gurevich},
editor = {Egon B{\"{o}}rger and
Gisbert Hasenjaeger and
Dieter R{\"{o}}dding},
title = {Equivalence relations, invariants, and normal forms},
booktitle = {Logic and Machines: Decision Problems and Complexity, Proceedings
of the Symposium "Rekursive Kombinatorik" held from May 23-28, 1983
at the Institut f{\"{u}}r Mathematische Logik und Grundlagenforschung
der Universit{\"{a}}t M{\"{u}}nster/Westfalen},
series = {Lecture Notes in Computer Science},
volume = {171},
pages = {24--42},
publisher = {Springer},
year = {1983},
url = {https://doi.org/10.1007/3-540-13331-3\_31},
doi = {10.1007/3-540-13331-3\_31},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/lam/BlassG83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lam/BlatterS83,
author = {Christian Blatter and
Ernst Specker},
editor = {Egon B{\"{o}}rger and
Gisbert Hasenjaeger and
Dieter R{\"{o}}dding},
title = {Recurrence relations for the number of labeled structures on a finite
set},
booktitle = {Logic and Machines: Decision Problems and Complexity, Proceedings
of the Symposium "Rekursive Kombinatorik" held from May 23-28, 1983
at the Institut f{\"{u}}r Mathematische Logik und Grundlagenforschung
der Universit{\"{a}}t M{\"{u}}nster/Westfalen},
series = {Lecture Notes in Computer Science},
volume = {171},
pages = {43--61},
publisher = {Springer},
year = {1983},
url = {https://doi.org/10.1007/3-540-13331-3\_32},
doi = {10.1007/3-540-13331-3\_32},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/lam/BlatterS83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lam/Borger83,
author = {Egon B{\"{o}}rger},
editor = {Egon B{\"{o}}rger and
Gisbert Hasenjaeger and
Dieter R{\"{o}}dding},
title = {Spektralproblem and completeness of logical decision problems},
booktitle = {Logic and Machines: Decision Problems and Complexity, Proceedings
of the Symposium "Rekursive Kombinatorik" held from May 23-28, 1983
at the Institut f{\"{u}}r Mathematische Logik und Grundlagenforschung
der Universit{\"{a}}t M{\"{u}}nster/Westfalen},
series = {Lecture Notes in Computer Science},
volume = {171},
pages = {333--356},
publisher = {Springer},
year = {1983},
url = {https://doi.org/10.1007/3-540-13331-3\_50},
doi = {10.1007/3-540-13331-3\_50},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/lam/Borger83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lam/Bruggemann-KleinPRS83,
author = {Anne Br{\"{u}}ggemann{-}Klein and
Lutz Priese and
Dieter R{\"{o}}dding and
R{\"{u}}diger Sch{\"{a}}tz},
editor = {Egon B{\"{o}}rger and
Gisbert Hasenjaeger and
Dieter R{\"{o}}dding},
title = {Modular decomposition of automata},
booktitle = {Logic and Machines: Decision Problems and Complexity, Proceedings
of the Symposium "Rekursive Kombinatorik" held from May 23-28, 1983
at the Institut f{\"{u}}r Mathematische Logik und Grundlagenforschung
der Universit{\"{a}}t M{\"{u}}nster/Westfalen},
series = {Lecture Notes in Computer Science},
volume = {171},
pages = {198--236},
publisher = {Springer},
year = {1983},
url = {https://doi.org/10.1007/3-540-13331-3\_42},
doi = {10.1007/3-540-13331-3\_42},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/lam/Bruggemann-KleinPRS83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lam/Buchberger83,
author = {Bruno Buchberger},
editor = {Egon B{\"{o}}rger and
Gisbert Hasenjaeger and
Dieter R{\"{o}}dding},
title = {A critical-pair/completion algorithm for finitely generated ideals
in rings},
booktitle = {Logic and Machines: Decision Problems and Complexity, Proceedings
of the Symposium "Rekursive Kombinatorik" held from May 23-28, 1983
at the Institut f{\"{u}}r Mathematische Logik und Grundlagenforschung
der Universit{\"{a}}t M{\"{u}}nster/Westfalen},
series = {Lecture Notes in Computer Science},
volume = {171},
pages = {137--161},
publisher = {Springer},
year = {1983},
url = {https://doi.org/10.1007/3-540-13331-3\_39},
doi = {10.1007/3-540-13331-3\_39},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/lam/Buchberger83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lam/Buning83,
author = {Hans Kleine{ }B{\"{u}}ning},
editor = {Egon B{\"{o}}rger and
Gisbert Hasenjaeger and
Dieter R{\"{o}}dding},
title = {Complexity of loop-problems in normed networks},
booktitle = {Logic and Machines: Decision Problems and Complexity, Proceedings
of the Symposium "Rekursive Kombinatorik" held from May 23-28, 1983
at the Institut f{\"{u}}r Mathematische Logik und Grundlagenforschung
der Universit{\"{a}}t M{\"{u}}nster/Westfalen},
series = {Lecture Notes in Computer Science},
volume = {171},
pages = {254--269},
publisher = {Springer},
year = {1983},
url = {https://doi.org/10.1007/3-540-13331-3\_45},
doi = {10.1007/3-540-13331-3\_45},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/lam/Buning83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lam/CarstensP83,
author = {Hans Georg Carstens and
Peter P{\"{a}}ppinghaus},
editor = {Egon B{\"{o}}rger and
Gisbert Hasenjaeger and
Dieter R{\"{o}}dding},
title = {Extensible algorithms},
booktitle = {Logic and Machines: Decision Problems and Complexity, Proceedings
of the Symposium "Rekursive Kombinatorik" held from May 23-28, 1983
at the Institut f{\"{u}}r Mathematische Logik und Grundlagenforschung
der Universit{\"{a}}t M{\"{u}}nster/Westfalen},
series = {Lecture Notes in Computer Science},
volume = {171},
pages = {162--182},
publisher = {Springer},
year = {1983},
url = {https://doi.org/10.1007/3-540-13331-3\_40},
doi = {10.1007/3-540-13331-3\_40},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/lam/CarstensP83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lam/Cohen83,
author = {Daniel E. Cohen},
editor = {Egon B{\"{o}}rger and
Gisbert Hasenjaeger and
Dieter R{\"{o}}dding},
title = {Modular machines, undecidability and incompleteness},
booktitle = {Logic and Machines: Decision Problems and Complexity, Proceedings
of the Symposium "Rekursive Kombinatorik" held from May 23-28, 1983
at the Institut f{\"{u}}r Mathematische Logik und Grundlagenforschung
der Universit{\"{a}}t M{\"{u}}nster/Westfalen},
series = {Lecture Notes in Computer Science},
volume = {171},
pages = {237--247},
publisher = {Springer},
year = {1983},
url = {https://doi.org/10.1007/3-540-13331-3\_43},
doi = {10.1007/3-540-13331-3\_43},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/lam/Cohen83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lam/Dahlhaus83,
author = {Elias Dahlhaus},
editor = {Egon B{\"{o}}rger and
Gisbert Hasenjaeger and
Dieter R{\"{o}}dding},
title = {Reduction to NP-complete problems by interpretations},
booktitle = {Logic and Machines: Decision Problems and Complexity, Proceedings
of the Symposium "Rekursive Kombinatorik" held from May 23-28, 1983
at the Institut f{\"{u}}r Mathematische Logik und Grundlagenforschung
der Universit{\"{a}}t M{\"{u}}nster/Westfalen},
series = {Lecture Notes in Computer Science},
volume = {171},
pages = {357--365},
publisher = {Springer},
year = {1983},
url = {https://doi.org/10.1007/3-540-13331-3\_51},
doi = {10.1007/3-540-13331-3\_51},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/lam/Dahlhaus83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lam/Deutsch83,
author = {Michael Deutsch},
editor = {Egon B{\"{o}}rger and
Gisbert Hasenjaeger and
Dieter R{\"{o}}dding},
title = {Reductions for the satisfiability with a simple interpretation of
the predicate variable},
booktitle = {Logic and Machines: Decision Problems and Complexity, Proceedings
of the Symposium "Rekursive Kombinatorik" held from May 23-28, 1983
at the Institut f{\"{u}}r Mathematische Logik und Grundlagenforschung
der Universit{\"{a}}t M{\"{u}}nster/Westfalen},
series = {Lecture Notes in Computer Science},
volume = {171},
pages = {285--311},
publisher = {Springer},
year = {1983},
url = {https://doi.org/10.1007/3-540-13331-3\_47},
doi = {10.1007/3-540-13331-3\_47},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/lam/Deutsch83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lam/Furer83,
author = {Martin F{\"{u}}rer},
editor = {Egon B{\"{o}}rger and
Gisbert Hasenjaeger and
Dieter R{\"{o}}dding},
title = {The computational complexity of the unconstrained limited domino problem
(with implications for logical decision problems)},
booktitle = {Logic and Machines: Decision Problems and Complexity, Proceedings
of the Symposium "Rekursive Kombinatorik" held from May 23-28, 1983
at the Institut f{\"{u}}r Mathematische Logik und Grundlagenforschung
der Universit{\"{a}}t M{\"{u}}nster/Westfalen},
series = {Lecture Notes in Computer Science},
volume = {171},
pages = {312--319},
publisher = {Springer},
year = {1983},
url = {https://doi.org/10.1007/3-540-13331-3\_48},
doi = {10.1007/3-540-13331-3\_48},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/lam/Furer83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lam/Grandjean83,
author = {Etienne Grandjean},
editor = {Egon B{\"{o}}rger and
Gisbert Hasenjaeger and
Dieter R{\"{o}}dding},
title = {Universal quantifiers and time complexity of random access machines},
booktitle = {Logic and Machines: Decision Problems and Complexity, Proceedings
of the Symposium "Rekursive Kombinatorik" held from May 23-28, 1983
at the Institut f{\"{u}}r Mathematische Logik und Grundlagenforschung
der Universit{\"{a}}t M{\"{u}}nster/Westfalen},
series = {Lecture Notes in Computer Science},
volume = {171},
pages = {366--379},
publisher = {Springer},
year = {1983},
url = {https://doi.org/10.1007/3-540-13331-3\_52},
doi = {10.1007/3-540-13331-3\_52},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/lam/Grandjean83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lam/Hasenjaeger83,
author = {Gisbert Hasenjaeger},
editor = {Egon B{\"{o}}rger and
Gisbert Hasenjaeger and
Dieter R{\"{o}}dding},
title = {Universal Turing machines {(UTM)} and Jones-Matijasevich-masking},
booktitle = {Logic and Machines: Decision Problems and Complexity, Proceedings
of the Symposium "Rekursive Kombinatorik" held from May 23-28, 1983
at the Institut f{\"{u}}r Mathematische Logik und Grundlagenforschung
der Universit{\"{a}}t M{\"{u}}nster/Westfalen},
series = {Lecture Notes in Computer Science},
volume = {171},
pages = {248--253},
publisher = {Springer},
year = {1983},
url = {https://doi.org/10.1007/3-540-13331-3\_44},
doi = {10.1007/3-540-13331-3\_44},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/lam/Hasenjaeger83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lam/Hedtstuck83,
author = {Ulrich Hedtst{\"{u}}ck},
editor = {Egon B{\"{o}}rger and
Gisbert Hasenjaeger and
Dieter R{\"{o}}dding},
title = {On the argument complexity of multiply transitive Boolean functions},
booktitle = {Logic and Machines: Decision Problems and Complexity, Proceedings
of the Symposium "Rekursive Kombinatorik" held from May 23-28, 1983
at the Institut f{\"{u}}r Mathematische Logik und Grundlagenforschung
der Universit{\"{a}}t M{\"{u}}nster/Westfalen},
series = {Lecture Notes in Computer Science},
volume = {171},
pages = {390--396},
publisher = {Springer},
year = {1983},
url = {https://doi.org/10.1007/3-540-13331-3\_54},
doi = {10.1007/3-540-13331-3\_54},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/lam/Hedtstuck83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lam/KramerL83,
author = {Mark R. Kramer and
Jan van Leeuwen},
editor = {Egon B{\"{o}}rger and
Gisbert Hasenjaeger and
Dieter R{\"{o}}dding},
title = {The {VLSI} complexity of Boolean functions},
booktitle = {Logic and Machines: Decision Problems and Complexity, Proceedings
of the Symposium "Rekursive Kombinatorik" held from May 23-28, 1983
at the Institut f{\"{u}}r Mathematische Logik und Grundlagenforschung
der Universit{\"{a}}t M{\"{u}}nster/Westfalen},
series = {Lecture Notes in Computer Science},
volume = {171},
pages = {397--407},
publisher = {Springer},
year = {1983},
url = {https://doi.org/10.1007/3-540-13331-3\_55},
doi = {10.1007/3-540-13331-3\_55},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/lam/KramerL83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lam/MenzelS83,
author = {Wolfgang Menzel and
Volker Sperschneider},
editor = {Egon B{\"{o}}rger and
Gisbert Hasenjaeger and
Dieter R{\"{o}}dding},
title = {Recursively enumerable extensions of R\({}_{\mbox{1}}\) by finite
functions},
booktitle = {Logic and Machines: Decision Problems and Complexity, Proceedings
of the Symposium "Rekursive Kombinatorik" held from May 23-28, 1983
at the Institut f{\"{u}}r Mathematische Logik und Grundlagenforschung
der Universit{\"{a}}t M{\"{u}}nster/Westfalen},
series = {Lecture Notes in Computer Science},
volume = {171},
pages = {62--76},
publisher = {Springer},
year = {1983},
url = {https://doi.org/10.1007/3-540-13331-3\_33},
doi = {10.1007/3-540-13331-3\_33},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/lam/MenzelS83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lam/Oberschelp83,
author = {Walter Oberschelp},
editor = {Egon B{\"{o}}rger and
Gisbert Hasenjaeger and
Dieter R{\"{o}}dding},
title = {Fast parallel algorithms for finding all prime implicants for discrete
functions},
booktitle = {Logic and Machines: Decision Problems and Complexity, Proceedings
of the Symposium "Rekursive Kombinatorik" held from May 23-28, 1983
at the Institut f{\"{u}}r Mathematische Logik und Grundlagenforschung
der Universit{\"{a}}t M{\"{u}}nster/Westfalen},
series = {Lecture Notes in Computer Science},
volume = {171},
pages = {408--420},
publisher = {Springer},
year = {1983},
url = {https://doi.org/10.1007/3-540-13331-3\_56},
doi = {10.1007/3-540-13331-3\_56},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/lam/Oberschelp83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lam/Pudlak83,
author = {Pavel Pudl{\'{a}}k},
editor = {Egon B{\"{o}}rger and
Gisbert Hasenjaeger and
Dieter R{\"{o}}dding},
title = {Bounds for Hodes-Specker theorem},
booktitle = {Logic and Machines: Decision Problems and Complexity, Proceedings
of the Symposium "Rekursive Kombinatorik" held from May 23-28, 1983
at the Institut f{\"{u}}r Mathematische Logik und Grundlagenforschung
der Universit{\"{a}}t M{\"{u}}nster/Westfalen},
series = {Lecture Notes in Computer Science},
volume = {171},
pages = {421--445},
publisher = {Springer},
year = {1983},
url = {https://doi.org/10.1007/3-540-13331-3\_57},
doi = {10.1007/3-540-13331-3\_57},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/lam/Pudlak83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lam/Regan83,
author = {Kenneth W. Regan},
editor = {Egon B{\"{o}}rger and
Gisbert Hasenjaeger and
Dieter R{\"{o}}dding},
title = {Arithmetical degrees of index sets for complexity classes},
booktitle = {Logic and Machines: Decision Problems and Complexity, Proceedings
of the Symposium "Rekursive Kombinatorik" held from May 23-28, 1983
at the Institut f{\"{u}}r Mathematische Logik und Grundlagenforschung
der Universit{\"{a}}t M{\"{u}}nster/Westfalen},
series = {Lecture Notes in Computer Science},
volume = {171},
pages = {118--130},
publisher = {Springer},
year = {1983},
url = {https://doi.org/10.1007/3-540-13331-3\_37},
doi = {10.1007/3-540-13331-3\_37},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/lam/Regan83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lam/Richter83,
author = {Michael M. Richter},
editor = {Egon B{\"{o}}rger and
Gisbert Hasenjaeger and
Dieter R{\"{o}}dding},
title = {Some reordering properties for inequality proof trees},
booktitle = {Logic and Machines: Decision Problems and Complexity, Proceedings
of the Symposium "Rekursive Kombinatorik" held from May 23-28, 1983
at the Institut f{\"{u}}r Mathematische Logik und Grundlagenforschung
der Universit{\"{a}}t M{\"{u}}nster/Westfalen},
series = {Lecture Notes in Computer Science},
volume = {171},
pages = {183--197},
publisher = {Springer},
year = {1983},
url = {https://doi.org/10.1007/3-540-13331-3\_41},
doi = {10.1007/3-540-13331-3\_41},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/lam/Richter83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lam/Scarpellini83,
author = {Bruno Scarpellini},
editor = {Egon B{\"{o}}rger and
Gisbert Hasenjaeger and
Dieter R{\"{o}}dding},
title = {Second order spectra},
booktitle = {Logic and Machines: Decision Problems and Complexity, Proceedings
of the Symposium "Rekursive Kombinatorik" held from May 23-28, 1983
at the Institut f{\"{u}}r Mathematische Logik und Grundlagenforschung
der Universit{\"{a}}t M{\"{u}}nster/Westfalen},
series = {Lecture Notes in Computer Science},
volume = {171},
pages = {380--389},
publisher = {Springer},
year = {1983},
url = {https://doi.org/10.1007/3-540-13331-3\_53},
doi = {10.1007/3-540-13331-3\_53},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/lam/Scarpellini83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lam/Schmidt83,
author = {Diana Schmidt},
editor = {Egon B{\"{o}}rger and
Gisbert Hasenjaeger and
Dieter R{\"{o}}dding},
title = {On the complement of one complexity class in another},
booktitle = {Logic and Machines: Decision Problems and Complexity, Proceedings
of the Symposium "Rekursive Kombinatorik" held from May 23-28, 1983
at the Institut f{\"{u}}r Mathematische Logik und Grundlagenforschung
der Universit{\"{a}}t M{\"{u}}nster/Westfalen},
series = {Lecture Notes in Computer Science},
volume = {171},
pages = {77--87},
publisher = {Springer},
year = {1983},
url = {https://doi.org/10.1007/3-540-13331-3\_34},
doi = {10.1007/3-540-13331-3\_34},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/lam/Schmidt83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lam/Sperschneider83,
author = {Volker Sperschneider},
editor = {Egon B{\"{o}}rger and
Gisbert Hasenjaeger and
Dieter R{\"{o}}dding},
title = {The length-problem},
booktitle = {Logic and Machines: Decision Problems and Complexity, Proceedings
of the Symposium "Rekursive Kombinatorik" held from May 23-28, 1983
at the Institut f{\"{u}}r Mathematische Logik und Grundlagenforschung
der Universit{\"{a}}t M{\"{u}}nster/Westfalen},
series = {Lecture Notes in Computer Science},
volume = {171},
pages = {88--102},
publisher = {Springer},
year = {1983},
url = {https://doi.org/10.1007/3-540-13331-3\_35},
doi = {10.1007/3-540-13331-3\_35},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/lam/Sperschneider83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lam/Spreen83,
author = {Dieter Spreen},
editor = {Egon B{\"{o}}rger and
Gisbert Hasenjaeger and
Dieter R{\"{o}}dding},
title = {On r.e. inseparability of {CPO} index sets},
booktitle = {Logic and Machines: Decision Problems and Complexity, Proceedings
of the Symposium "Rekursive Kombinatorik" held from May 23-28, 1983
at the Institut f{\"{u}}r Mathematische Logik und Grundlagenforschung
der Universit{\"{a}}t M{\"{u}}nster/Westfalen},
series = {Lecture Notes in Computer Science},
volume = {171},
pages = {103--117},
publisher = {Springer},
year = {1983},
url = {https://doi.org/10.1007/3-540-13331-3\_36},
doi = {10.1007/3-540-13331-3\_36},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/lam/Spreen83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lam/Tiuryn83,
author = {Jerzy Tiuryn},
editor = {Egon B{\"{o}}rger and
Gisbert Hasenjaeger and
Dieter R{\"{o}}dding},
title = {Implicit definability of finite binary trees by sets of equations},
booktitle = {Logic and Machines: Decision Problems and Complexity, Proceedings
of the Symposium "Rekursive Kombinatorik" held from May 23-28, 1983
at the Institut f{\"{u}}r Mathematische Logik und Grundlagenforschung
der Universit{\"{a}}t M{\"{u}}nster/Westfalen},
series = {Lecture Notes in Computer Science},
volume = {171},
pages = {320--332},
publisher = {Springer},
year = {1983},
url = {https://doi.org/10.1007/3-540-13331-3\_49},
doi = {10.1007/3-540-13331-3\_49},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/lam/Tiuryn83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lam/Volger83,
author = {Hugo Volger},
editor = {Egon B{\"{o}}rger and
Gisbert Hasenjaeger and
Dieter R{\"{o}}dding},
title = {Rudimentary relations and Turing machines with linear alternation},
booktitle = {Logic and Machines: Decision Problems and Complexity, Proceedings
of the Symposium "Rekursive Kombinatorik" held from May 23-28, 1983
at the Institut f{\"{u}}r Mathematische Logik und Grundlagenforschung
der Universit{\"{a}}t M{\"{u}}nster/Westfalen},
series = {Lecture Notes in Computer Science},
volume = {171},
pages = {131--136},
publisher = {Springer},
year = {1983},
url = {https://doi.org/10.1007/3-540-13331-3\_38},
doi = {10.1007/3-540-13331-3\_38},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/lam/Volger83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lam/Wegener83,
author = {Ingo Wegener},
editor = {Egon B{\"{o}}rger and
Gisbert Hasenjaeger and
Dieter R{\"{o}}dding},
title = {Proving lower bounds of the monotone complexity of Boolean functions},
booktitle = {Logic and Machines: Decision Problems and Complexity, Proceedings
of the Symposium "Rekursive Kombinatorik" held from May 23-28, 1983
at the Institut f{\"{u}}r Mathematische Logik und Grundlagenforschung
der Universit{\"{a}}t M{\"{u}}nster/Westfalen},
series = {Lecture Notes in Computer Science},
volume = {171},
pages = {446--456},
publisher = {Springer},
year = {1983},
url = {https://doi.org/10.1007/3-540-13331-3\_58},
doi = {10.1007/3-540-13331-3\_58},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/lam/Wegener83.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.
retrieved on 2024-11-02 20:51 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
