Pages that link to "Item:Q5096319"
From MaRDI portal
The following pages link to LATIN '95: Theoretical Informatics (Q5096319):
Displayed 37 items.
- Visibility graphs of 2-spiral polygons (Extended abstract) (Q5096320) (← links)
- Random generation of colored trees (Q5096321) (← links)
- Space filling curves and their use in the design of geometric data structures (Q5096322) (← links)
- Tight bounds for finding degrees from the adjacency matrix (Q5096323) (← links)
- Lower bounds for modular counting by circuits with modular gates (Q5096324) (← links)
- On the relation between BDDs and FDDs (Q5096325) (← links)
- On dynamical properties of generalized toggle automata (Q5096326) (← links)
- Free shuffle algebras in language varieties extended abstract (Q5096327) (← links)
- Lower bounds for the matrix chain ordering problem (Q5096328) (← links)
- Off-line electronic cash based on secret-key certificates (Q5096329) (← links)
- Recognizable sets of numbers in nonstandard bases (Q5096330) (← links)
- On weak growing context-sensitive grammars (Q5096331) (← links)
- Logic of plotkin continuous domain (Q5096332) (← links)
- (Probabilistic) recurrence relations revisited (Q5096333) (← links)
- On linear-time alphabet-independent 2-dimensional pattern matching (Q5096334) (← links)
- Reversible cellular automaton able to simulate any other reversible one using partitioning automata (Q5096335) (← links)
- Nearest neighbour graph realizability is NP-hard (Q5096336) (← links)
- Linear-time algorithms for parametric minimum spanning tree problems on planar graphs (Q5096337) (← links)
- Paging more than one page (Q5096338) (← links)
- On edge-colouring indifference graphs (Q5096339) (← links)
- On the approximability of some maximum spanning tree problems (Q5096340) (← links)
- Unbounded search and recursive graph problems (Q5096341) (← links)
- On the complexity of computing the greatest common divisor of several univariate polynomials (Q5096342) (← links)
- State complexity of SBTA languages (Q5096343) (← links)
- Pushdown automata with bounded nondeterminism and bounded ambiguity (Q5096344) (← links)
- Multihead two-way probabilistic finite automata (Q5096345) (← links)
- Non-erasing turing machines: A new frontier between a decidable halting problem and universality (Q5096346) (← links)
- Cyclic automata networks on finite graphs (Q5096347) (← links)
- Multiple alignment of biological sequences with gap flexibility (Q5096348) (← links)
- Lower bounds for the modular communication complexity of various graph accessibility problems (Q5096349) (← links)
- On monotonous oracle machines (Q5096350) (← links)
- On using learning automata for fast graph partitioning (Q5096351) (← links)
- Solution of a problem of yekutieli and mandelbrot (Q5096352) (← links)
- A rewrite approach for constraint logic programming (Q5096353) (← links)
- Simulations between cellular automata on cayley graphs (Q5096354) (← links)
- A temporal logic for real-time partial-ordering with named transactions (Q5096355) (← links)
- A new approach for routing in arrangement graphs and its performance evaluation (Q5096356) (← links)