The following pages link to Giora Slutzki (Q235683):
Displaying 50 items.
- PS\textsc{pace} tableau algorithms for acyclic modalized \({\mathcal{ALC}}\) (Q352965) (← links)
- Factoring a graph in polynomial time (Q579285) (← links)
- (Q593417) (redirect page) (← links)
- A scheme to construct distance-three codes using Latin squares, with applications to the \(n\)-cube (Q672019) (← links)
- Deterministic top-down tree transducers with iterated look-ahead (Q673068) (← links)
- Multi-valued logic programming semantics An algebraic approach (Q673383) (← links)
- Tight comparison bounds for the string prefix-matching problem (Q685487) (← links)
- Parallel searching of multidimensional cubes (Q685702) (← links)
- (Q759007) (redirect page) (← links)
- On the non-compactness of the class of program schemas (Q759008) (← links)
- A linear algorithm for finding Hamiltonian cycles in 4-connected maximal planar graphs (Q788489) (← links)
- A counter example to a monotonicity property of k-d trees (Q789903) (← links)
- Parametric multiple sequence alignment and phylogeny construction (Q876718) (← links)
- An optimal time bound for oblivious routing (Q908701) (← links)
- Dynamic fractional cascading (Q908708) (← links)
- An algorithm to find all paths between two nodes in a graph (Q916679) (← links)
- Purely top-down updating algorithms for stratified search trees (Q1057067) (← links)
- New NP-hard and NP-complete polynomial and integer divisibility problems (Q1062447) (← links)
- Extended macro grammars and stack controlled machines (Q1064075) (← links)
- Alternating tree automata (Q1077932) (← links)
- The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs (Q1099628) (← links)
- On domination problems for permutation and other graphs (Q1100915) (← links)
- Cyclic automata (Q1100919) (← links)
- (Q1104759) (redirect page) (← links)
- The interchange or pump (di)lemmas for context-free languages (Q1104760) (← links)
- An efficient parallel algorithm for planarity (Q1114415) (← links)
- A representation of recursively enumerable languages by two homomorphisms and a quotient (Q1115633) (← links)
- Tree transducers, L systems, and two-way machines (Q1136239) (← links)
- Finite state relational programs (Q1169287) (← links)
- A regular characterization of graph languages definable in monadic second-order logic (Q1177179) (← links)
- On the power of white pebbles (Q1180416) (← links)
- Optimal canonization of all substrings of a string (Q1183603) (← links)
- Graph theory applications (Q1189421) (← links)
- Connected domination and Steiner set on weighted permutation graphs (Q1190520) (← links)
- On the complexity of recognizing tough graphs (Q1313820) (← links)
- A note on the equivalence of a set of egds to a set of FDs (Q1318738) (← links)
- The complexity of optimizing finite-state transducers (Q1329734) (← links)
- The infinite 2-star height hierarchy of extended regular languages of star degree at most two (Q1341774) (← links)
- Polynomial algorithms for linear programming over the algebraic numbers (Q1343466) (← links)
- Linear-time algorithms for parametric minimum spanning tree problems on planar graphs (Q1391297) (← links)
- Bounds for parametric sequence comparison (Q1602688) (← links)
- Graph complexity (Q1823693) (← links)
- A duality theory for bilattices (Q1866803) (← links)
- The complexity of graph languages generated by hyperedge replacement (Q2277851) (← links)
- Ranking participants in generalized tournaments (Q2487968) (← links)
- Scoring of web pages and tournaments-axiomatizations (Q2500743) (← links)
- (Q2723941) (← links)
- A Conceptual Framework for Secrecy-preserving Reasoning in Knowledge Bases (Q2946749) (← links)
- (Q3049835) (← links)
- Optimal Parametric Search on Graphs of Bounded Tree-Width (Q3128194) (← links)
