default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIngo Althöfer
Person information
- affiliation: Friedrich Schiller University of Jena, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i1]Ingo Althöfer, Holger Boche, Christian Deppe, Ulrich Tamm, Andreas J. Winter, Raymond W. Yeung:
Ning Cai: A Tribute to a Pioneering Scholar in Information Theory. CoRR abs/2409.19398 (2024)- 2023
- [c9]Ingo Althöfer, Michael Hartisch
, Thomas Zipproth:
Analysis of a Collatz Game and Other Variants of the 3n+1 Problem. ACG 2023: 123-132 - 2020
- [j71]Ingo Althöfer:
Computer Chess and Chess Computers in East Germany. J. Int. Comput. Games Assoc. 42(2-3): 152-164 (2020) - [j70]Raphael Thiele, Ingo Althöfer:
Analyzing a variant of Clobber: The game of San Jego. J. Int. Comput. Games Assoc. 42(4): 257-271 (2020)
2010 – 2019
- 2016
- [j69]Ievgen Liubarshchuk, Ingo Althöfer:
The problem of approach in differential-difference games. Int. J. Game Theory 45(3): 511-522 (2016) - [c8]Ingo Althöfer:
Computer-Aided Go: Chess as a Role Model. Computers and Games 2016: 149-155 - [c7]Raphael Thiele, Ingo Althöfer:
An Analysis of Majority Systems with Dependent Agents in a Simple Subtraction Game. Computers and Games 2016: 202-211 - 2015
- [j68]Ingo Althöfer, Jan Kristian Haugland, Karl Scherer, Frank Schneider, Nico Van Cleemput:
Alternating plane graphs. Ars Math. Contemp. 8(2): 337-363 (2015) - [j67]Ingo Althöfer:
Obituary: John Nash, A Beautiful Mind has Gone. J. Int. Comput. Games Assoc. 38(2): 125-127 (2015) - [j66]Michael Hartisch, Ingo Althöfer:
Optimal Robot Play in Certain Chess Endgame Situations. J. Int. Comput. Games Assoc. 38(3): 180-185 (2015) - [j65]Ingo Althöfer:
Advances in Computer Games Conference 2015: Report on Day 1. J. Int. Comput. Games Assoc. 38(3): 187-188 (2015) - [j64]Ingo Althöfer:
HANFRIED wins EinStein Würfelt Nicht! Tournament. J. Int. Comput. Games Assoc. 38(4): 246 (2015) - [c6]Ingo Althöfer, Matthias Beckmann, Friedrich Salzer:
On Some Random Walk Games with Diffusion Control. ACG 2015: 65-75 - 2014
- [j63]Ingo Althöfer, Raymond Georg Snatzke:
The codecentric Go Challenge 2014: Franz-Josef Dickhut vs. CRAZY STONE. J. Int. Comput. Games Assoc. 37(4): 232-236 (2014) - 2013
- [j62]Ingo Althöfer:
Conference Report Day 1. J. Int. Comput. Games Assoc. 36(3): 170-171 (2013) - [j61]Ingo Althöfer:
PAN Wins Clobber Tournament. J. Int. Comput. Games Assoc. 36(3): 177 (2013) - [c5]Ingo Althöfer:
Remarks on History and Presence of Game Tree Search and Research. Information Theory, Combinatorics, and Search Theory 2013: 677-693 - [c4]Ingo Althöfer, Wesley Michael Turner:
Anomalies of Pure Monte-Carlo Search in Monte-Carlo Perfect Games. Computers and Games 2013: 84-99 - 2012
- [j60]Ingo Althöfer:
The Origin of Dynamic Komi. J. Int. Comput. Games Assoc. 35(1): 31-34 (2012) - [j59]Ingo Althöfer:
Side Report: Popular Video Livestream. J. Int. Comput. Games Assoc. 35(1): 42 (2012) - [j58]Ingo Althöfer:
PAN Wins Clobber Tournament. J. Int. Comput. Games Assoc. 35(1): 55-57 (2012) - [j57]Ingo Althöfer:
Havannah - The Old Man and the C's. J. Int. Comput. Games Assoc. 35(4): 214-219 (2012) - 2011
- [j56]Ingo Althöfer:
John Tromp in the Style of David Levy: 4-0 Win in the Go Bet. J. Int. Comput. Games Assoc. 34(2): 97-102 (2011) - [j55]Ingo Althöfer:
On Games with Random-Turn Order and Monte Carlo Perfectness. J. Int. Comput. Games Assoc. 34(4): 179-190 (2011) - [c3]Ingo Althöfer:
On Board-Filling Games with Random-Turn Order and Monte Carlo Perfectness. ACG 2011: 258-269 - 2010
- [j54]Ingo Althöfer:
Automatic Generation and Evaluation of Recombination Games. J. Int. Comput. Games Assoc. 33(4): 215-216 (2010)
2000 – 2009
- 2005
- [j53]Ingo Althöfer, Susanne Heuser:
Randomised Evaluations in Single-Agent Search. J. Int. Comput. Games Assoc. 28(1): 21-31 (2005) - 2004
- [j52]Ingo Althöfer:
Improved game play by multiple computer hint. Theor. Comput. Sci. 313(3): 315-324 (2004) - 2003
- [j51]Ingo Althöfer:
A 20-Choice Experiment in Go for Human+Computer. J. Int. Comput. Games Assoc. 26(2): 108-114 (2003) - [j50]Ingo Althöfer, Johan de Koning, Jens Lieberum, Stefan Meyer-Kahlen, Thomas Rolle, Jörg Sameith:
Five Visualisations of the k-best Mode. J. Int. Comput. Games Assoc. 26(3): 182-189 (2003) - 2002
- [c2]Ingo Althöfer, Raymond Georg Snatzke:
Playing Games with Multiple Choice Systems. Computers and Games 2002: 142-153 - 2000
- [j49]Ingo Althöfer:
A One-Sided Advanced Chess Match. J. Int. Comput. Games Assoc. 23(3): 192-198 (2000) - [j48]Ingo Althöfer:
A One-Sided Advanced Chess Match. J. Int. Comput. Games Assoc. 23(4): 254-256 (2000)
1990 – 1999
- 1999
- [j47]Ingo Althöfer:
Corrections on Dap Hartmann's Review of "13 Years of 3-Hirn". J. Int. Comput. Games Assoc. 22(3): 190-191 (1999) - [j46]Ingo Althöfer:
Advanced Shuffle Chess with Technical Improvements. J. Int. Comput. Games Assoc. 22(4): 245-251 (1999) - 1998
- [b2]Ingo Althöfer:
13 Jahre 3-Hirn - meine Schach-Experimente mit Mensch-Maschinen-Kombinationen: das 3-Hirn-Prinzip. Selbstverl. 1998, ISBN 978-3-00-003100-7, pp. 1-348 - [j45]Ingo Althöfer:
LIST-3-HIRN vs. Grandmaster Yusupov. J. Int. Comput. Games Assoc. 21(1): 52-60 (1998) - [j44]Ingo Althöfer:
LIST-3-HIRN vs. Grandmaster Yusupov, A Report on a very Experimental Match Part II: Analysis. J. Int. Comput. Games Assoc. 21(2): 131-134 (1998) - [j43]Ingo Althöfer:
Technical Proposals on "Advanced Chess". J. Int. Comput. Games Assoc. 21(4): 275 (1998) - 1997
- [j42]Ingo Althöfer:
A Symbiosis of Man and Machine Beats Grandmaster Timoshchenko. J. Int. Comput. Games Assoc. 20(1): 40-47 (1997) - [j41]Ingo Althöfer:
On the K-Best Mode in Computer Chess: Measuring the Similarity of Move Proposals. J. Int. Comput. Games Assoc. 20(3): 152-165 (1997) - 1996
- [j40]Ingo Althöfer, Matthias Löwe:
Edge search in hypergraphs. Discret. Math. 162(1-3): 267-271 (1996) - 1995
- [j39]Ingo Althöfer:
Review. J. Int. Comput. Games Assoc. 18(1): 34 (1995) - [j38]Ingo Althöfer:
Review. J. Int. Comput. Games Assoc. 18(2): 85-86 (1995) - [j37]Ingo Althöfer, Imre Leader:
Correlation of Boolean Functions and Pathology in Recursion Trees. SIAM J. Discret. Math. 8(4): 526-535 (1995) - [j36]Ingo Althöfer, Jörg Bültermann:
Superlinear Period Lengths in Some Subtraction Games. Theor. Comput. Sci. 148(1): 111-119 (1995) - 1994
- [j35]Ingo Althöfer, Bernhard Walter:
Weak Zugzwang: Statistics on some Chess Endgames. J. Int. Comput. Games Assoc. 17(2): 75-77 (1994) - [j34]Ingo Althöfer:
Reviews. J. Int. Comput. Games Assoc. 17(2): 82-83 (1994) - [j33]Ingo Althöfer:
Reviews. J. Int. Comput. Games Assoc. 17(2): 83-84 (1994) - [j32]Ingo Althöfer:
Reviews. J. Int. Comput. Games Assoc. 17(2): 84 (1994) - [j31]Rudolf Ahlswede, Ingo Althöfer:
The Asymptotic Behavior of Diameters in the Average. J. Comb. Theory B 61(2): 167-177 (1994) - [j30]Ingo Althöfer:
Note: Small integral flows need only sparse networks. Networks 24(4): 263-266 (1994) - 1993
- [j29]Ingo Althöfer, Klaus-Uwe Koschnick:
On the Deterministic Complexity of Searching Local Maxima. Discret. Appl. Math. 43(2): 111-113 (1993) - [j28]Ingo Althöfer, Gautam Das, David P. Dobkin, Deborah Joseph, José Soares:
On Sparse Spanners of Weighted Graphs. Discret. Comput. Geom. 9: 81-100 (1993) - [j27]Ingo Althöfer, Eberhard Triesch:
Edge search in graphs and hypergraphs of bounded rank. Discret. Math. 115(1-3): 1-9 (1993) - [j26]Ingo Althöfer:
On Telescoping Linear Evaluation Functions. J. Int. Comput. Games Assoc. 16(2): 91-94 (1993) - [j25]Ingo Althöfer:
Review. J. Int. Comput. Games Assoc. 16(3): 147-148 (1993) - [j24]Ingo Althöfer:
A Parallel Game Tree Search Algorithm with a Linear Speedup. J. Algorithms 15(2): 175-198 (1993) - 1992
- [j23]Ingo Althöfer, Bernhard Balkenhol:
A Game Tree with Distinct Leaf Values which is Easy for the Alpha-Beta Agorithm. Artif. Intell. 52(2): 183-190 (1992) - [j22]Ingo Althöfer:
On Asymmetries in Chess Programs. J. Int. Comput. Games Assoc. 15(1): 23-26 (1992) - [j21]Ingo Althöfer:
B. Balkenhol: K-reguläre Minimax-Bäume mit distinkten Blattwerten, die bei beliebiger Sortierung "leicht" für den alpha-beta Algorithmus sind. J. Int. Comput. Games Assoc. 15(2): 81 (1992) - [j20]Ingo Althöfer:
Move Ordering by Time Ordering. J. Int. Comput. Games Assoc. 15(2): 103-104 (1992) - [j19]Ingo Althöfer, Torsten Sillke:
An "average distance" inequality for large subsets of the cube. J. Comb. Theory B 56(2): 296-301 (1992) - 1991
- [j18]Ingo Althöfer:
Data Compression Using an Intelligent Generator: The Storage of Chess Games as an Example. Artif. Intell. 52(1): 109-113 (1991) - [j17]Ingo Althöfer:
Sören W. Perrey: Mathematische Methoden der Künstlichen Intelligenz: Zur Quiescence-Suche in Spielbäumen. J. Int. Comput. Games Assoc. 14(2): 84 (1991) - [j16]Ingo Althöfer:
An Additive Evaluation Function in Chess. J. Int. Comput. Games Assoc. 14(3): 137-141 (1991) - 1990
- [j15]Ingo Althöfer:
An Incremental Negamax Algorithm. Artif. Intell. 43(1): 57-65 (1990) - [j14]Ingo Althöfer:
Review. J. Int. Comput. Games Assoc. 13(3): 143-144 (1990) - [j13]Ingo Althöfer:
Compressing Chess Games with the Help of a Fast Deterministic Chess Program. J. Int. Comput. Games Assoc. 13(4): 200-203 (1990) - [j12]David L. Dowe, Ingo Althöfer, John Roycroft:
Symmetrical Chess. J. Int. Comput. Games Assoc. 13(4): 235 (1990) - [j11]Ingo Althöfer:
Tight Lower Bounds on the Length of Word Chains. Inf. Process. Lett. 34(5): 275-276 (1990) - [j10]Ingo Althöfer:
The complexity of a simple stochastic OR-tree model in which "directional search" is bad. J. Complex. 6(3): 264-277 (1990) - [j9]Ingo Althöfer:
Average distances in undirected graphs and the removal of vertices. J. Comb. Theory B 48(1): 140-142 (1990) - [c1]Ingo Althöfer, Gautam Das, David P. Dobkin, Deborah Joseph:
Generating Sparse Spanners for Weighted Graphs. SWAT 1990: 26-37
1980 – 1989
- 1989
- [j8]Ingo Althöfer:
Retrograde Analysis and Two Computerizable Definitions of the Quality of Chess Games. J. Int. Comput. Games Assoc. 12(2): 74-78 (1989) - [j7]Ingo Althöfer:
A Conjecture Withdrawn. J. Int. Comput. Games Assoc. 12(3): 194 (1989) - 1988
- [j6]Ingo Althöfer:
On Optimal Realizations of Finite Metric Spaces by Graphs. Discret. Comput. Geom. 3: 103-122 (1988) - [j5]Ingo Althöfer:
Root Evaluation Errors: How they Arise and Propagate. J. Int. Comput. Games Assoc. 11(2-3): 55-63 (1988) - [j4]Ingo Althöfer:
Report on the Workshop "Computer Chess and Game Trees". J. Int. Comput. Games Assoc. 11(2-3): 129 (1988) - [j3]Ingo Althöfer:
Reviews. J. Int. Comput. Games Assoc. 11(4): 160-161 (1988) - [j2]Ingo Althöfer:
On the Complexity of Searching Game Trees and Other Recursion Trees. J. Algorithms 9(4): 538-567 (1988) - 1987
- [j1]Ingo Althöfer:
A Prize for Symbiosis. J. Int. Comput. Games Assoc. 10(1): 55 (1987) - 1986
- [b1]Ingo Althöfer:
Asymptotic properties of certain competition systems in artificial intelligence and ecology. Bielefeld University, Germany, 1986
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-10-18 20:25 CEST 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:
