The following pages link to Ingo Althöfer (Q328542):
Displaying 27 items.
- The problem of approach in differential-difference games (Q328543) (← links)
- On taxed matrix games and changes in the expected transfer (Q457868) (← links)
- Superlinear period lengths in some subtraction games (Q672382) (← links)
- An ``average distance'' inequality for large subsets of the cube (Q757399) (← links)
- The complexity of a simple stochastic OR-tree model in which ``directional search'' is bad (Q915453) (← links)
- Tight lower bounds on the length of word chains (Q915454) (← links)
- Asymptotic properties of level-regular decision trees with randomly evaluated leaves (Q1099794) (← links)
- On optimal realizations of finite metric spaces by graphs (Q1100481) (← links)
- (Q1108943) (redirect page) (← links)
- Nim games with arbitrary periodic moving orders (Q1108944) (← links)
- On the convergence of ``threshold accepting'' (Q1179163) (← links)
- A game tree with distinct leaf values which is easy for the alpha-beta algorithm (Q1190799) (← links)
- Average distances in undirected graphs and the removal of vertices (Q1263601) (← links)
- Two-best solutions under distance constraints: The model and exemplary results for matroids (Q1291060) (← links)
- \(k\)-best solutions under distance constraints in valuated \(\Delta\)-matroids (Q1293131) (← links)
- On sparse approximations to randomized strategies and convex combinations (Q1322876) (← links)
- The asymptotic behaviour of diameters in the average (Q1333337) (← links)
- Edge search in hypergraphs (Q1356674) (← links)
- On the deterministic complexity of searching local maxima (Q1801675) (← links)
- Edge search in graphs and hypergraphs of bounded rank (Q1801680) (← links)
- Improved game play by multiple computer hints (Q1884993) (← links)
- Computer-aided Go: Chess as a role model (Q1989582) (← links)
- An analysis of majority systems with dependent agents in a simple subtraction game (Q1989590) (← links)
- A Condorcet jury theorem for couples (Q2629321) (← links)
- An incremental negamax algorithm (Q2639785) (← links)
- Anomalies of Pure Monte-Carlo Search in Monte-Carlo Perfect Games (Q2947910) (← links)
- A Parallel Game Tree Search Algorithm With A Linear Speedup (Q3141528) (← links)
