default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRyLee Hühne
Person information
- affiliation: South Westphalia University of Applied Sciences, Faculty of Information Technology and Natural Sciences, Iserlohn, Germany
- affiliation (former, Phd 1996): Technical University of Dortmund, Germany
Other persons with the same name
- Martin Schmidt — disambiguation page
- Martin Schmidt 0001 — Polish Academy of Sciences, Warsaw, Poland (and 1 more)
- Martin Schmidt 0002 — University of Osnabrück, Institute of Cognitive Science, Germany
- Martin Schmidt 0003
![[0000-0001-6208-5677]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0001-6208-5677")
— University of Trier, Department of Mathematics, Germany (and 1 more) - Martin Schmidt 0004 — TU Dresden, Institute of Biomedical Engineering, Germany
- Martin Schmidt 0005 — University of Stuttgart, Germany
- Martin Schmidt 0006 — Leibniz Universität Hannover, Germany
- Martin Schmidt 0008 — University of Würzburg, Institute of Geography, Department of Remote Sensing, Germany (and 1 more)
- Martin Schmidt 0009 — University of Ostrava, Faculty of Electrical Engineering and Computer Science, Department of Cybernetics and Biomedical Engineering, Czech Republic
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2008
[j5]Martin Dietzfelbinger, Martin Hühne, Christoph Weidling:
A dictionary implementation based on dynamic perfect hashing. ACM J. Exp. Algorithmics 12: 1.11:1-1.11:25 (2008)
1990 – 1999
- 1999
- [j4]Martin Dietzfelbinger, Martin Hühne:
Matching upper and lower bounds for simulations of several linear tapes on one multidimensional tape. Comput. Complex. 8(4): 371-392 (1999) - 1997
- [c4]Thomas Hofmeister, Martin Hühne:
Semidefinite Programming and Its Applications to Approximation Algorithms. Lectures on Proof Verification and Approximation Algorithms 1997: 263-298 - 1996
- [b1]Martin Hühne:
Concrete complexity theory - studies of the impact of the capabilities of the storage device on the efficiency of computations. Technical University of Dortmund, Germany, Berichte aus der Informatik, Shaker 1996, ISBN 978-3-8265-1696-2, pp. I-II, 1-123 - 1995
- [j3]Beate Bollig, Martin Hühne, Stefan Pölt, Petr Savický:
On the Average Case Circuit Delay of Disjunction. Parallel Process. Lett. 5: 275-280 (1995) - [c3]Martin Hühne:
The Hedge: An Efficient Storage Device for Turing Machines with One Head (Extended Abstract). MFCS 1995: 247-256 - 1994
- [c2]Martin Dietzfelbinger, Martin Hühne:
Matching Upper and Lower Bounds for Simulation of Several Tapes on One Multidimensional Tape. FSTTCS 1994: 24-35 - 1993
- [j2]Martin Hühne:
Linear Speed-Up Does not Hold on Turing Machines with Tree Storages. Inf. Process. Lett. 47(6): 313-318 (1993) - [j1]Martin Hühne:
On the Power of Several Queues. Theor. Comput. Sci. 113(1): 75-91 (1993) - 1991
- [c1]Martin Schmidt:
On the Power of Several Queues. STACS 1991: 64-75
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-12-10 21:48 CET 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:
