11 Search Results for "Raiha, Kari-Jouko"

Document
DOI: 10.4230/LIPIcs.SWAT.2026.28
The Parameterized Complexity of Coloring Mixed Graphs

Authors: Antonio Lauerbach, Konstanty Junosza-Szaniawski, Marie Diana Sieper, and Alexander Wolff

Published in: LIPIcs, Volume 370, 20th Scandinavian Symposium on Algorithm Theory (SWAT 2026)

Abstract
A mixed graph contains (undirected) edges as well as (directed) arcs, thus generalizing undirected and directed graphs. A proper coloring c of a mixed graph G assigns a positive integer to each vertex such that c(u)≠c(v) for every edge {u,v} and c(u)<c(v) for every arc (u,v) of G. As in classical coloring, the objective is to minimize the number of colors. Thus, mixed (graph) coloring generalizes classical coloring of undirected graphs and allows for more general applications, such as scheduling with precedence constraints, modeling metabolic pathways, and process management in operating systems; see a survey by Sotskov [Mathematics, 2020]. We initiate the systematic study of the parameterized complexity of mixed coloring. We focus on structural graph parameters that lie between cliquewidth and vertex cover, primarily with respect to the underlying undirected graph. Unlike classical coloring, which is fixed-parameter tractable (FPT) parameterized by treewidth or neighborhood diversity, we show that mixed coloring is W[1]-hard for treewidth and even paraNP-hard for neighborhood diversity. To utilize the directedness of arcs, we introduce and analyze natural generalizations of neighborhood diversity and cliquewidth to mixed graphs, and show that mixed coloring becomes FPT when parameterized by (the generalized) mixed neighborhood diversity. Further, we investigate how these parameters are affected if we add transitive arcs, which do not affect colorings. Finally, we provide tight bounds on the chromatic number of mixed graphs, generalizing known bounds on mixed interval graphs.
Cite as

Antonio Lauerbach, Konstanty Junosza-Szaniawski, Marie Diana Sieper, and Alexander Wolff. The Parameterized Complexity of Coloring Mixed Graphs. In 20th Scandinavian Symposium on Algorithm Theory (SWAT 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 370, pp. 28:1-28:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)

Copy BibTex To Clipboard

@InProceedings{lauerbach_et_al:LIPIcs.SWAT.2026.28,
  author =	{Lauerbach, Antonio and Junosza-Szaniawski, Konstanty and Sieper, Marie Diana and Wolff, Alexander},
  title =	{{The Parameterized Complexity of Coloring Mixed Graphs}},
  booktitle =	{20th Scandinavian Symposium on Algorithm Theory (SWAT 2026)},
  pages =	{28:1--28:18},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-421-5},
  ISSN =	{1868-8969},
  year =	{2026},
  volume =	{370},
  editor =	{Fraigniaud, Pierre},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2026.28},
  URN =		{urn:nbn:de:0030-drops-260644},
  doi =		{10.4230/LIPIcs.SWAT.2026.28},
  annote =	{Keywords: Mixed Graphs, Coloring, Parameterized Complexity, Structural Graph Parameters}
}
Document
DOI: 10.4230/LIPIcs.SoCG.2026.44
Tilt Automata: Gathering Particles with Uniform External Control

Authors: Sándor P. Fekete, Jonas Friemel, Peter Kramer, Jan-Marc Reinhardt, Christian Rieck, and Christian Scheffer

Published in: LIPIcs, Volume 367, 42nd International Symposium on Computational Geometry (SoCG 2026)

Abstract
Motivated by targeted drug delivery, we investigate the gathering of particles in the full tilt model of externally controlled motion planning: A set of particles is located at the tiles of a polyomino with all particles reacting uniformly to an external force by moving as far as possible in one of the four axis-parallel directions until they hit the boundary. The goal is to choose a sequence of directions that moves all particles to a common position. Our results include a polynomial-time algorithm for gathering in a completely filled polyomino as well as hardness reductions for approximating shortest gathering sequences and for determining whether the particles in a partially filled polyomino can be gathered. We pay special attention to the impact of restricted geometry, particularly polyominoes without holes. As a corollary, we make progress on an open question from [Balanza-Martinez et al., SODA 2020] by showing that deciding whether a given position can be occupied remains NP-hard in polyominoes without holes. Our results build on a connection we establish between tilt models and the theory of synchronizing automata.
Cite as

Sándor P. Fekete, Jonas Friemel, Peter Kramer, Jan-Marc Reinhardt, Christian Rieck, and Christian Scheffer. Tilt Automata: Gathering Particles with Uniform External Control. In 42nd International Symposium on Computational Geometry (SoCG 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 367, pp. 44:1-44:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)

Copy BibTex To Clipboard

@InProceedings{fekete_et_al:LIPIcs.SoCG.2026.44,
  author =	{Fekete, S\'{a}ndor P. and Friemel, Jonas and Kramer, Peter and Reinhardt, Jan-Marc and Rieck, Christian and Scheffer, Christian},
  title =	{{Tilt Automata: Gathering Particles with Uniform External Control}},
  booktitle =	{42nd International Symposium on Computational Geometry (SoCG 2026)},
  pages =	{44:1--44:19},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-418-5},
  ISSN =	{1868-8969},
  year =	{2026},
  volume =	{367},
  editor =	{Ahn, Hee-Kap and Hoffmann, Michael and Nayyeri, Amir},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2026.44},
  URN =		{urn:nbn:de:0030-drops-258508},
  doi =		{10.4230/LIPIcs.SoCG.2026.44},
  annote =	{Keywords: Uniform control, gathering, full tilt, polyominoes, synchronizing automata}
}
Document
DOI: 10.4230/LIPIcs.ISAAC.2025.24
Enumerating the Irreducible Closed Sets of an Acyclic Implicational Base of Bounded Degree

Authors: Oscar Defrain, Arthur Ohana, and Simon Vilmin

Published in: LIPIcs, Volume 359, 36th International Symposium on Algorithms and Computation (ISAAC 2025)

Abstract
We consider the problem of enumerating the irreducible closed sets of a closure system given by an implicational base. To date, the complexity status of this problem is widely open, and it is further known to generalize the notorious hypergraph dualization problem, even in the case of acyclic convex geometries, i.e., closure systems admitting an acyclic implicational base. This paper studies this case with a focus on the degree, which corresponds to the maximal number of implications in which an element occurs. We show that the problem is tractable for bounded values of this parameter, even when relaxed to the notions of premise- and conclusion-degree. Our algorithms rely on a sequential approach leveraging from acyclicity, combined with the solution graph traversal technique for the case of premise-degree. They are shown to perform in incremental-polynomial time. These results are complemented in the long version of this document by showing that the dual problem of constructing the implicational base can be solved in polynomial time. Finally, we argue that our running times cannot be improved to polynomial delay using the standard framework of flashlight search.
Cite as

Oscar Defrain, Arthur Ohana, and Simon Vilmin. Enumerating the Irreducible Closed Sets of an Acyclic Implicational Base of Bounded Degree. In 36th International Symposium on Algorithms and Computation (ISAAC 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 359, pp. 24:1-24:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)

Copy BibTex To Clipboard

@InProceedings{defrain_et_al:LIPIcs.ISAAC.2025.24,
  author =	{Defrain, Oscar and Ohana, Arthur and Vilmin, Simon},
  title =	{{Enumerating the Irreducible Closed Sets of an Acyclic Implicational Base of Bounded Degree}},
  booktitle =	{36th International Symposium on Algorithms and Computation (ISAAC 2025)},
  pages =	{24:1--24:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-408-6},
  ISSN =	{1868-8969},
  year =	{2025},
  volume =	{359},
  editor =	{Chen, Ho-Lin and Hon, Wing-Kai and Tsai, Meng-Tsung},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2025.24},
  URN =		{urn:nbn:de:0030-drops-249321},
  doi =		{10.4230/LIPIcs.ISAAC.2025.24},
  annote =	{Keywords: Algorithmic enumeration, closure systems, acyclic convex geometries, solution graph traversal, flashlight search, extension, hypergraph dualization}
}
Document
DOI: 10.4230/LIPIcs.ICDT.2025.8
Enumeration of Minimal Hitting Sets Parameterized by Treewidth

Authors: Batya Kenig and Dan Shlomo Mizrahi

Published in: LIPIcs, Volume 328, 28th International Conference on Database Theory (ICDT 2025)

Abstract
Enumerating the minimal hitting sets of a hypergraph is a problem which arises in many data management applications that include constraint mining, discovering unique column combinations, and enumerating database repairs. Previously, Eiter et al. [Thomas Eiter et al., 2003] showed that the minimal hitting sets of an n-vertex hypergraph, with treewidth w, can be enumerated with delay O^*(n^w) (ignoring polynomial factors), with space requirements that scale with the output size. We improve this to fixed-parameter-linear delay, following an FPT preprocessing phase. The memory consumption of our algorithm is exponential with respect to the treewidth of the hypergraph.
Cite as

Batya Kenig and Dan Shlomo Mizrahi. Enumeration of Minimal Hitting Sets Parameterized by Treewidth. In 28th International Conference on Database Theory (ICDT 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 328, pp. 8:1-8:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)

Copy BibTex To Clipboard

@InProceedings{kenig_et_al:LIPIcs.ICDT.2025.8,
  author =	{Kenig, Batya and Mizrahi, Dan Shlomo},
  title =	{{Enumeration of Minimal Hitting Sets Parameterized by Treewidth}},
  booktitle =	{28th International Conference on Database Theory (ICDT 2025)},
  pages =	{8:1--8:20},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-364-5},
  ISSN =	{1868-8969},
  year =	{2025},
  volume =	{328},
  editor =	{Roy, Sudeepa and Kara, Ahmet},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2025.8},
  URN =		{urn:nbn:de:0030-drops-229498},
  doi =		{10.4230/LIPIcs.ICDT.2025.8},
  annote =	{Keywords: Enumeration, Hitting sets}
}
Document
DOI: 10.4230/DagSemProc.05382.1
05382 Abstracts Collection – Efficient Text Entry

Authors: Karin Harbusch, Kari-Jouko Raiha, and Kumiko Tanaka-Ishii

Published in: Dagstuhl Seminar Proceedings, Volume 5382, Efficient Text Entry (2006)

Abstract
From 21.09.05 to 24.09.05, the Dagstuhl Seminar 05382 ``Efficient Text Entry'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.
Cite as

Karin Harbusch, Kari-Jouko Raiha, and Kumiko Tanaka-Ishii. 05382 Abstracts Collection – Efficient Text Entry. In Efficient Text Entry. Dagstuhl Seminar Proceedings, Volume 5382, pp. 1-7, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)

Copy BibTex To Clipboard

@InProceedings{harbusch_et_al:DagSemProc.05382.1,
  author =	{Harbusch, Karin and Raiha, Kari-Jouko and Tanaka-Ishii, Kumiko},
  title =	{{05382 Abstracts Collection – Efficient Text Entry}},
  booktitle =	{Efficient Text Entry},
  pages =	{1--7},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2006},
  volume =	{5382},
  editor =	{Karin Harbusch and Kari-Jouko Raiha and Kumiko Tanaka-Ishii},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05382.1},
  URN =		{urn:nbn:de:0030-drops-5589},
  doi =		{10.4230/DagSemProc.05382.1},
  annote =	{Keywords: Ambigous keyboard, keystroke saving}
}
Document
DOI: 10.4230/DagSemProc.05382.2
05382 Executive Summary – Efficient Text Entry

Authors: Karin Harbusch, Kari-Jouko Raiha, and Kumiko Tanaka-Ishii

Published in: Dagstuhl Seminar Proceedings, Volume 5382, Efficient Text Entry (2006)

Abstract
This files consists of three parts: - it first summarises the basic idea of the workshop, - then the topic of the individual talks are delineated and - finally the discussions are summarized.
Cite as

Karin Harbusch, Kari-Jouko Raiha, and Kumiko Tanaka-Ishii. 05382 Executive Summary – Efficient Text Entry. In Efficient Text Entry. Dagstuhl Seminar Proceedings, Volume 5382, pp. 1-3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)

Copy BibTex To Clipboard

@InProceedings{harbusch_et_al:DagSemProc.05382.2,
  author =	{Harbusch, Karin and Raiha, Kari-Jouko and Tanaka-Ishii, Kumiko},
  title =	{{05382 Executive Summary – Efficient Text Entry}},
  booktitle =	{Efficient Text Entry},
  pages =	{1--3},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2006},
  volume =	{5382},
  editor =	{Karin Harbusch and Kari-Jouko Raiha and Kumiko Tanaka-Ishii},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05382.2},
  URN =		{urn:nbn:de:0030-drops-5330},
  doi =		{10.4230/DagSemProc.05382.2},
  annote =	{Keywords: Ambiguous keyboard, keystroke saving}
}
Document
DOI: 10.4230/DagSemProc.05382.3
Attention Demands in Text Entry Interfaces

Authors: I. Scott MacKenzie

Published in: Dagstuhl Seminar Proceedings, Volume 5382, Efficient Text Entry (2006)

Abstract
The rationale for a model of text input that includes perceptual and cognitives processes is given. Reducing keystrokes is fine, but if the design imposes an increased perceptual and/or cognitive load on the user (e.g., shifting attention points or perusing a list of candidate words in a word completion system), then a newinterface may not be as efficient as first thought. This argument as well as others underscoring the need to more thoroughly acknowledge and quantifiy attention demans in text entry interface are developed.
Cite as

I. Scott MacKenzie. Attention Demands in Text Entry Interfaces. In Efficient Text Entry. Dagstuhl Seminar Proceedings, Volume 5382, pp. 1-5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)

Copy BibTex To Clipboard

@InProceedings{mackenzie:DagSemProc.05382.3,
  author =	{MacKenzie, I. Scott},
  title =	{{Attention Demands in Text Entry Interfaces}},
  booktitle =	{Efficient Text Entry},
  pages =	{1--5},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2006},
  volume =	{5382},
  editor =	{Karin Harbusch and Kari-Jouko Raiha and Kumiko Tanaka-Ishii},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05382.3},
  URN =		{urn:nbn:de:0030-drops-5180},
  doi =		{10.4230/DagSemProc.05382.3},
  annote =	{Keywords: Attention, perceptual and cognitive processes, model human processor}
}
Document
DOI: 10.4230/DagSemProc.05382.4
Human-centered compression for efficient text input

Authors: Rani Nelken and Stuart M. Shieber

Published in: Dagstuhl Seminar Proceedings, Volume 5382, Efficient Text Entry (2006)

Abstract
Traditional methods for efficient text entry are based on prediction. Prediction requires a constant context-shift between entering text and selecting or verifying the predictions. Previous research has shown that the advantages offered by prediction are usually eliminated by the cognitive load associated with such context-switching. We present a novel approach that relies on compression. Users are required to compress text using a very simple abbreviation technique that yields an average keystrok reduction of 26.4%. Input text is automatically decoded using weighted finite-state transducers, incorporating both word-based and letter-based n-gram language models. Decoding yields a residual error rate of 3.3%. User experiments show that this approach yields improved text input speeds.
Cite as

Rani Nelken and Stuart M. Shieber. Human-centered compression for efficient text input. In Efficient Text Entry. Dagstuhl Seminar Proceedings, Volume 5382, pp. 1-2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)

Copy BibTex To Clipboard

@InProceedings{nelken_et_al:DagSemProc.05382.4,
  author =	{Nelken, Rani and Shieber, Stuart M.},
  title =	{{Human-centered compression for efficient text input}},
  booktitle =	{Efficient Text Entry},
  pages =	{1--2},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2006},
  volume =	{5382},
  editor =	{Karin Harbusch and Kari-Jouko Raiha and Kumiko Tanaka-Ishii},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05382.4},
  URN =		{urn:nbn:de:0030-drops-5176},
  doi =		{10.4230/DagSemProc.05382.4},
  annote =	{Keywords: Prediction, compression, weigthed finite state transducers, text input}
}
Document
DOI: 10.4230/DagSemProc.05382.5
On the application of text input metrics to handwritten text input

Authors: Janet C. Read

Published in: Dagstuhl Seminar Proceedings, Volume 5382, Efficient Text Entry (2006)

Abstract
This paper describes the current metrics used in text input research, considering those used for discrete text input as well as those used for spoken input. It examines how these metrics might be used for handwritten text input and provides some thoughts about different metrics that might allow for a more fine grained evaluation of recognition improvement or input accuracy.
Cite as

Janet C. Read. On the application of text input metrics to handwritten text input. In Efficient Text Entry. Dagstuhl Seminar Proceedings, Volume 5382, pp. 1-9, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)

Copy BibTex To Clipboard

@InProceedings{read:DagSemProc.05382.5,
  author =	{Read, Janet C.},
  title =	{{On the application of text input metrics to handwritten text input}},
  booktitle =	{Efficient Text Entry},
  pages =	{1--9},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2006},
  volume =	{5382},
  editor =	{Karin Harbusch and Kari-Jouko Raiha and Kumiko Tanaka-Ishii},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05382.5},
  URN =		{urn:nbn:de:0030-drops-5144},
  doi =		{10.4230/DagSemProc.05382.5},
  annote =	{Keywords: Handwriting Recognition, Text Input, Metrics}
}
Document
DOI: 10.4230/DagSemProc.05382.6
Text Entry in Augmentative and Alternative Communication

Authors: John L. Arnott

Published in: Dagstuhl Seminar Proceedings, Volume 5382, Efficient Text Entry (2006)

Abstract
A concise outline of background is given on assistive methods for writing and communicating for non-speaking people, highlighting the role of efficient text entry in augmentative and alternative communication (AAC). AAC systems are designed to assist people with communication impairments to interact with others and to compose messages and other documents. Efficient text entry is therefore of great importance in AAC, in order to make it as easy as possible for text users to enter text into AAC systems. Continuing research and development is needed in the area of text entry to improve the efficacy and efficiency of AAC systems.
Cite as

John L. Arnott. Text Entry in Augmentative and Alternative Communication. In Efficient Text Entry. Dagstuhl Seminar Proceedings, Volume 5382, pp. 1-6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)

Copy BibTex To Clipboard

@InProceedings{arnott:DagSemProc.05382.6,
  author =	{Arnott, John L.},
  title =	{{Text Entry in Augmentative and Alternative Communication}},
  booktitle =	{Efficient Text Entry},
  pages =	{1--6},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2006},
  volume =	{5382},
  editor =	{Karin Harbusch and Kari-Jouko Raiha and Kumiko Tanaka-Ishii},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05382.6},
  URN =		{urn:nbn:de:0030-drops-5193},
  doi =		{10.4230/DagSemProc.05382.6},
  annote =	{Keywords: Augmentative \& alternative Communication, text input, non-speaking, prediction, disambiguation}
}
Document
DOI: 10.4230/DagSemProc.05382.7
The language component of the FASTY predictive typing system

Authors: Johannes Matiasek

Published in: Dagstuhl Seminar Proceedings, Volume 5382, Efficient Text Entry (2006)

Abstract
I describe the language component of FASTY, a text prediction system designed to improve text input efficiency for disabled users. The FASTY language component is based on state-of-the-art n-gram-based word-level and Part-of-Speech-level prediction and on a number of innovative modules (morphological analysis, collocation-based prediction, compound prediction) that are meant to enhance performance in languages other than English. Together with its modular architecture these novel techniques make it adaptable to a wide range of languages without sacrificing performance. Currently, versions for Dutch, German, French, Italian, and Swedish are supported. Going beyond the FASTY system, it will also be shown that the language component can be easily extended for the use with reduced keyboards, just by defining key-mapping tables, without needing to change the dictionary or the language model.
Cite as

Johannes Matiasek. The language component of the FASTY predictive typing system. In Efficient Text Entry. Dagstuhl Seminar Proceedings, Volume 5382, p. 1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)

Copy BibTex To Clipboard

@InProceedings{matiasek:DagSemProc.05382.7,
  author =	{Matiasek, Johannes},
  title =	{{The language component of the FASTY predictive typing system}},
  booktitle =	{Efficient Text Entry},
  pages =	{1--1},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2006},
  volume =	{5382},
  editor =	{Karin Harbusch and Kari-Jouko Raiha and Kumiko Tanaka-Ishii},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05382.7},
  URN =		{urn:nbn:de:0030-drops-5165},
  doi =		{10.4230/DagSemProc.05382.7},
  annote =	{Keywords: AAC, Predictive Typing}
}
  • Refine by Type
  • 11 Document/PDF
  • 4 Document/HTML

  • Refine by Publication Year
  • 2 2026
  • 2 2025
  • 7 2006

  • Refine by Author
  • 2 Harbusch, Karin
  • 2 Raiha, Kari-Jouko
  • 2 Tanaka-Ishii, Kumiko
  • 1 Arnott, John L.
  • 1 Defrain, Oscar
  • Show More...

  • Refine by Series/Journal
  • 4 LIPIcs
  • 7 DagSemProc

  • Refine by Classification
  • 2 Mathematics of computing → Enumeration
  • 1 Mathematics of computing → Graph coloring
  • 1 Theory of computation → Computational geometry
  • 1 Theory of computation → Parameterized complexity and exact algorithms

  • Refine by Keyword
  • 2 keystroke saving
  • 2 text input
  • 1 AAC
  • 1 Algorithmic enumeration
  • 1 Ambigous keyboard
  • Show More...

Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2026 Schloss Dagstuhl – LZI GmbH Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact