default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTimo von Oertzen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c9]Aziz Omar
, Timo von Oertzen, Thomas Augustin:
Learning from Categorical Data Subject to Non-random Misclassification and Non-response Under Prior Quasi-Near-Ignorance Using an Imprecise Dirichlet Model. IPMU (2) 2022: 532-544
2010 – 2019
- 2016
- [j10]Viktor Müller, Dionysios Perdikis, Timo von Oertzen, Rita Sleimen-Malkoun, Viktor K. Jirsa, Ulman Lindenberger:
Structure and Topology Dynamics of Hyper-Frequency Networks during Rest and Auditory Oddball Performance. Frontiers Comput. Neurosci. 10: 108 (2016) - 2015
- [j9]Julian D. Karch, Myriam C. Sander, Timo von Oertzen, Andreas M. Brandmaier, Markus Werkle-Bergner:
Using within-subject pattern classification to understand lifespan age differences in oscillatory mechanisms of working memory selection and maintenance. NeuroImage 118: 538-552 (2015) - 2013
- [j8]Christoph Sawade, Steffen Bickel, Timo von Oertzen, Tobias Scheffer, Niels Landwehr:
Active evaluation of ranking functions based on graded relevance. Mach. Learn. 92(1): 41-64 (2013) - [c8]Christoph Sawade, Steffen Bickel, Timo von Oertzen, Tobias Scheffer, Niels Landwehr:
Active Evaluation of Ranking Functions Based on Graded Relevance (Extended Abstract). IJCAI 2013: 3072-3076 - 2012
- [j7]Manuel Bodirsky, Peter Jonsson, Timo von Oertzen:
Essential Convexity and Complexity of Semi-Algebraic Constraints. Log. Methods Comput. Sci. 8(4) (2012) - [j6]Manuel Bodirsky, Peter Jonsson, Timo von Oertzen:
Horn versus full first-order: Complexity dichotomies in algebraic constraint satisfaction. J. Log. Comput. 22(3): 643-660 (2012) - [c7]Christoph Sawade, Steffen Bickel, Timo von Oertzen, Tobias Scheffer, Niels Landwehr:
Active Evaluation of Ranking Functions Based on Graded Relevance. ECML/PKDD (2) 2012: 676-691 - 2011
- [p1]Timo von Oertzen, Paolo Ghisletta, Ulman Lindenberger:
Simulating Statistical Power in Latent Growth Curve Modeling: A Strategy for Evaluating Age-Based Changes in Cognitive Resources. Resource-Adaptive Cognitive Processes 2011: 95-117 - 2010
- [j5]Shu-Chen Li, Christian Chicherio, Lars Nyberg, Timo von Oertzen, Irene E. Nagel, Goran Papenberg, Thomas Sander, Hauke R. Heekeren, Ulman Lindenberger, Lars Bäckman:
Ebbinghaus Revisited: Influences of the BDNF Val66Met Polymorphism on Backward Serial Recall Are Modulated by Human Aging. J. Cogn. Neurosci. 22(10): 2164-2173 (2010) - [i1]Manuel Bodirsky, Peter Jonsson, Timo von Oertzen:
Horn versus full first-order: complexity dichotomies in algebraic constraint satisfaction. CoRR abs/1005.1141 (2010)
2000 – 2009
- 2009
- [j4]Manuel Bodirsky, Gustav Nordh, Timo von Oertzen:
Integer programming with 2-variable equations and 1-variable inequalities. Inf. Process. Lett. 109(11): 572-575 (2009) - [j3]Manuel Bodirsky, Hubie Chen, Jan Kára, Timo von Oertzen:
Maximal infinite-valued constraint languages. Theor. Comput. Sci. 410(18): 1684-1693 (2009) - [c6]Manuel Bodirsky, Gustav Nordh, Timo von Oertzen:
Integer Programming with 2-Variable Equations and 1-Variable Inequalities. CTW 2009: 261-264 - [c5]Manuel Bodirsky, Peter Jonsson, Timo von Oertzen:
Semilinear Program Feasibility. ICALP (2) 2009: 79-90 - 2008
- [c4]Paul Czienskowski, Michael Schellenbach, Timo von Oertzen:
Feedback-controlled locomotion in virtual environments. NordiCHI 2008: 447-450 - 2007
- [c3]Manuel Bodirsky, Hubie Chen, Jan Kára, Timo von Oertzen:
Maximal Infinite-Valued Constraint Languages. ICALP 2007: 546-557 - 2006
- [j2]Timo von Oertzen:
Exact Computation of Polynomial Zeros Expressible by Square Roots. Algorithmica 46(1): 119-136 (2006) - [j1]Shu-Chen Li, Timo von Oertzen, Ulman Lindenberger:
A neurocomputational model of stochastic resonance and aging. Neurocomputing 69(13-15): 1553-1560 (2006) - 2004
- [b1]Timo von Oertzen:
Das Konstruktionsproblem. Saarland University, Germany, 2004 - [c2]Timo von Oertzen:
Exact Computation of Polynomial Zeros Expressible by Square Roots. ISAAC 2004: 729-741 - [c1]Manuel Bodirsky, Tobias Gärtner, Timo von Oertzen, Jan Schwinghammer:
Effciently Computing the Density of Regular Languages. LATIN 2004: 262-270
Coauthor Index
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-11-05 20:54 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:
