default search action
BibTeX records: Ulrich Huckenbeck
@book{DBLP:books/daglib/0094155, author = {Ulrich Huckenbeck}, title = {Extremal paths in graphs - foundations, search strategies and related topics}, publisher = {Akademie Verlag}, year = {1997}, isbn = {978-3-05-501658-5}, timestamp = {Tue, 26 Apr 2011 01:00:00 +0200}, biburl = {https://dblp.org/rec/books/daglib/0094155.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jalc/Huckenbeck97, author = {Ulrich Huckenbeck}, title = {On Valve Adjustments that Interrupt all s-t-Paths in a Digraph}, journal = {J. Autom. Lang. Comb.}, volume = {2}, number = {1}, pages = {19--45}, year = {1997}, url = {https://doi.org/10.25596/jalc-1997-019}, doi = {10.25596/JALC-1997-019}, timestamp = {Mon, 11 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jalc/Huckenbeck97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/Huckenbeck93, author = {Ulrich Huckenbeck}, editor = {Patrice Enjalbert and Alain Finkel and Klaus W. Wagner}, title = {On Paths in Networks with Valves}, booktitle = {{STACS} 93, 10th Annual Symposium on Theoretical Aspects of Computer Science, W{\"{u}}rzburg, Germany, February 25-27, 1993, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {665}, pages = {90--99}, publisher = {Springer}, year = {1993}, url = {https://doi.org/10.1007/3-540-56503-5\_12}, doi = {10.1007/3-540-56503-5\_12}, timestamp = {Tue, 14 May 2019 10:00:48 +0200}, biburl = {https://dblp.org/rec/conf/stacs/Huckenbeck93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/Huckenbeck92, author = {Ulrich Huckenbeck}, title = {Constructing Sets of Functions Which Have a Given F-Cardinality}, journal = {Math. Syst. Theory}, volume = {25}, number = {1}, pages = {3--22}, year = {1992}, url = {https://doi.org/10.1007/BF01368781}, doi = {10.1007/BF01368781}, timestamp = {Sun, 17 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mst/Huckenbeck92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mlq/Huckenbeck91, author = {Ulrich Huckenbeck}, title = {Some Elementary Results About the Equivalence of Computability and Decidability}, journal = {Math. Log. Q.}, volume = {37}, number = {5-6}, pages = {77--84}, year = {1991}, url = {https://doi.org/10.1002/malq.19910370503}, doi = {10.1002/MALQ.19910370503}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mlq/Huckenbeck91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Huckenbeck91, author = {Ulrich Huckenbeck}, title = {A Result about the Power of Geometric Oracle Machines}, journal = {Theor. Comput. Sci.}, volume = {88}, number = {2}, pages = {231--251}, year = {1991}, url = {https://doi.org/10.1016/0304-3975(91)90375-C}, doi = {10.1016/0304-3975(91)90375-C}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Huckenbeck91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ita/Huckenbeck90, author = {Ulrich Huckenbeck}, title = {On geometric automata which can nondeterminstically choose auxiliary points}, journal = {{RAIRO} Theor. Informatics Appl.}, volume = {24}, pages = {471--487}, year = {1990}, url = {https://doi.org/10.1051/ita/1990240504711}, doi = {10.1051/ITA/1990240504711}, timestamp = {Mon, 25 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ita/Huckenbeck90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/HuckenbeckR90, author = {Ulrich Huckenbeck and Detlev Ruland}, editor = {Rolf H. M{\"{o}}hring}, title = {A Generalized Best-First Search Method in Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 16rd International Workshop, {WG} '90, Berlin, Germany, June 20-22, 1990, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {484}, pages = {41--60}, publisher = {Springer}, year = {1990}, url = {https://doi.org/10.1007/3-540-53832-1\_30}, doi = {10.1007/3-540-53832-1\_30}, timestamp = {Fri, 17 Jul 2020 16:12:47 +0200}, biburl = {https://dblp.org/rec/conf/wg/HuckenbeckR90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eik/Huckenbeck89, author = {Ulrich Huckenbeck}, title = {An Equivalence Result for Oracle Sets}, journal = {J. Inf. Process. Cybern.}, volume = {25}, number = {11/12}, pages = {561--572}, year = {1989}, timestamp = {Fri, 06 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/eik/Huckenbeck89.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Huckenbeck89, author = {Ulrich Huckenbeck}, title = {Euclidian Geometry in Terms of Automata Theory}, journal = {Theor. Comput. Sci.}, volume = {68}, number = {1}, pages = {71--87}, year = {1989}, url = {https://doi.org/10.1016/0304-3975(89)90120-5}, doi = {10.1016/0304-3975(89)90120-5}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Huckenbeck89.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mmor/Huckenbeck88, author = {Ulrich Huckenbeck}, title = {On the complexity of convex hull algorithms if rotational minima can be found very fast}, journal = {{ZOR} Methods Model. Oper. Res.}, volume = {32}, number = {3-4}, pages = {187--199}, year = {1988}, url = {https://doi.org/10.1007/BF01928920}, doi = {10.1007/BF01928920}, timestamp = {Mon, 18 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mmor/Huckenbeck88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cga/Huckenbeck88, author = {Ulrich Huckenbeck}, editor = {Hartmut Noltemeier}, title = {Geometrical Abstract Automata}, booktitle = {Computational Geometry and its Applications, CG'88, International Workshop on Computational Geometry, W{\"{u}}rzburg, Germany, March 24-25, 1988}, series = {Lecture Notes in Computer Science}, volume = {333}, pages = {217--231}, publisher = {Springer}, year = {1988}, url = {https://doi.org/10.1007/3-540-50335-8\_37}, doi = {10.1007/3-540-50335-8\_37}, timestamp = {Fri, 17 Jul 2020 16:12:48 +0200}, biburl = {https://dblp.org/rec/conf/cga/Huckenbeck88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/Huckenbeck88, author = {Ulrich Huckenbeck}, editor = {Jan van Leeuwen}, title = {On Paths in Search or Decision Trees Which Require Almost Worst-Case Time}, booktitle = {Graph-Theoretic Concepts in Computer Science, 14th International Workshop, {WG} '88, Amsterdam, The Netherlands, June 15-17, 1988, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {344}, pages = {406--423}, publisher = {Springer}, year = {1988}, url = {https://doi.org/10.1007/3-540-50728-0\_59}, doi = {10.1007/3-540-50728-0\_59}, timestamp = {Tue, 14 May 2019 10:00:40 +0200}, biburl = {https://dblp.org/rec/conf/wg/Huckenbeck88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@phdthesis{DBLP:phd/dnb/Huckenbeck87, author = {Ulrich Huckenbeck}, title = {Geometrische Maschinenmodelle}, school = {Julius Maximilians University W{\"{u}}rzburg, Germany}, year = {1987}, url = {https://d-nb.info/871338335}, timestamp = {Sat, 17 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/phd/dnb/Huckenbeck87.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.