![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Ulrich Huckenbeck
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1990 – 1999
- 1997
- [b2]Ulrich Huckenbeck:
Extremal paths in graphs - foundations, search strategies and related topics. Akademie Verlag 1997, ISBN 978-3-05-501658-5, pp. 1-480 - [j8]Ulrich Huckenbeck:
On Valve Adjustments that Interrupt all s-t-Paths in a Digraph. J. Autom. Lang. Comb. 2(1): 19-45 (1997) - 1993
- [c4]Ulrich Huckenbeck:
On Paths in Networks with Valves. STACS 1993: 90-99 - 1992
- [j7]Ulrich Huckenbeck:
Constructing Sets of Functions Which Have a Given F-Cardinality. Math. Syst. Theory 25(1): 3-22 (1992) - 1991
- [j6]Ulrich Huckenbeck:
Some Elementary Results About the Equivalence of Computability and Decidability. Math. Log. Q. 37(5-6): 77-84 (1991) - [j5]Ulrich Huckenbeck:
A Result about the Power of Geometric Oracle Machines. Theor. Comput. Sci. 88(2): 231-251 (1991) - 1990
- [j4]Ulrich Huckenbeck:
On geometric automata which can nondeterminstically choose auxiliary points. RAIRO Theor. Informatics Appl. 24: 471-487 (1990) - [c3]Ulrich Huckenbeck, Detlev Ruland:
A Generalized Best-First Search Method in Graphs. WG 1990: 41-60
1980 – 1989
- 1989
- [j3]Ulrich Huckenbeck:
An Equivalence Result for Oracle Sets. J. Inf. Process. Cybern. 25(11/12): 561-572 (1989) - [j2]Ulrich Huckenbeck:
Euclidian Geometry in Terms of Automata Theory. Theor. Comput. Sci. 68(1): 71-87 (1989) - 1988
- [j1]Ulrich Huckenbeck:
On the complexity of convex hull algorithms if rotational minima can be found very fast. ZOR Methods Model. Oper. Res. 32(3-4): 187-199 (1988) - [c2]Ulrich Huckenbeck:
Geometrical Abstract Automata. Workshop on Computational Geometry 1988: 217-231 - [c1]Ulrich Huckenbeck:
On Paths in Search or Decision Trees Which Require Almost Worst-Case Time. WG 1988: 406-423 - 1987
- [b1]Ulrich Huckenbeck:
Geometrische Maschinenmodelle. Julius Maximilians University Würzburg, Germany, 1987, pp. 1-275
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint