The SCEAS System
Navigation Menu

Search the dblp DataBase


Ingo Althöfer: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ingo Althöfer, Raymond Georg Snatzke
    Playing Games with Multiple Choice Systems. [Citation Graph (0, 0)][DBLP]
    Computers and Games, 2002, pp:142-153 [Conf]
  2. Ingo Althöfer, Gautam Das, David P. Dobkin, Deborah Joseph
    Generating Sparse Spanners for Weighted Graphs. [Citation Graph (0, 0)][DBLP]
    SWAT, 1990, pp:26-37 [Conf]
  3. Ingo Althöfer
    An Incremental Negamax Algorithm. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1990, v:43, n:1, pp:57-65 [Journal]
  4. Ingo Althöfer
    Data Compression Using an Intelligent Generator: The Storage of Chess Games as an Example. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1991, v:52, n:1, pp:109-113 [Journal]
  5. Ingo Althöfer, Bernhard Balkenhol
    A Game Tree with Distinct Leaf Values which is Easy for the Alpha-Beta Agorithm. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1992, v:52, n:2, pp:183-190 [Journal]
  6. Ingo Althöfer, Klaus-Uwe Koschnick
    On the Deterministic Complexity of Searching Local Maxima. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:43, n:2, pp:111-113 [Journal]
  7. Ingo Althöfer
    On Optimal Realizations of Finite Metric Spaces by Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1988, v:3, n:, pp:103-122 [Journal]
  8. Ingo Althöfer, Gautam Das, David P. Dobkin, Deborah Joseph, José Soares
    On Sparse Spanners of Weighted Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1993, v:9, n:, pp:81-100 [Journal]
  9. Ingo Althöfer
    Tight Lower Bounds on the Length of Word Chains. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1990, v:34, n:5, pp:275-276 [Journal]
  10. Ingo Althöfer
    On the Complexity of Searching Game Trees and Other Recursion Trees. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1988, v:9, n:4, pp:538-567 [Journal]
  11. Ingo Althöfer
    A Parallel Game Tree Search Algorithm with a Linear Speedup. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1993, v:15, n:2, pp:175-198 [Journal]
  12. Ingo Althöfer
    The complexity of a simple stochastic OR-tree model in which "directional search" is bad. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1990, v:6, n:3, pp:264-277 [Journal]
  13. Ingo Althöfer
    Average distances in undirected graphs and the removal of vertices. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1990, v:48, n:1, pp:140-142 [Journal]
  14. Ingo Althöfer, Torsten Sillke
    An "average distance" inequality for large subsets of the cube. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1992, v:56, n:2, pp:296-301 [Journal]
  15. Rudolf Ahlswede, Ingo Althöfer
    The Asymptotic Behavior of Diameters in the Average. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1994, v:61, n:2, pp:167-177 [Journal]
  16. Ingo Althöfer, Imre Leader
    Correlation of Boolean Functions and Pathology in Recursion Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1995, v:8, n:4, pp:526-535 [Journal]
  17. Ingo Althöfer
    Improved game play by multiple computer hint. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:303, n:3, pp:315-324 [Journal]
  18. Ingo Althöfer, Jörg Bültermann
    Superlinear Period Lengths in Some Subtraction Games. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:148, n:1, pp:111-119 [Journal]
  19. Ingo Althöfer, Matthias Löwe
    Edge search in hypergraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:162, n:1-3, pp:267-271 [Journal]
  20. Ingo Althöfer, Eberhard Triesch
    Edge search in graphs and hypergraphs of bounded rank. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:115, n:1-3, pp:1-9 [Journal]

Search in 0.003secs, Finished in 0.004secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002