nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A branching time logic with past operators
|
Kaminski, Michael |
|
1994 |
49 |
2 |
p. 223-246 24 p. |
artikel |
2 |
A linear-time near-optimum-length triangulation algorithm for convex polygons
|
Kantabutra, Vitit |
|
1994 |
49 |
2 |
p. 325-333 9 p. |
artikel |
3 |
A three-valued semantics for deductive databases and logic programs
|
You, Jia-Huai |
|
1994 |
49 |
2 |
p. 334-361 28 p. |
artikel |
4 |
Dynamic dictionary matching
|
Amir, Amihood |
|
1994 |
49 |
2 |
p. 208-222 15 p. |
artikel |
5 |
Efficient inference of partial types
|
Kozen, Dexter |
|
1994 |
49 |
2 |
p. 306-324 19 p. |
artikel |
6 |
Hardness vs randomness
|
Nisan, Noam |
|
1994 |
49 |
2 |
p. 149-167 19 p. |
artikel |
7 |
Invariant sets for substitution
|
Nishida, Taishin |
|
1994 |
49 |
2 |
p. 168-174 7 p. |
artikel |
8 |
Learning with discrete multivalued neurons
|
Obradović, Zoran |
|
1994 |
49 |
2 |
p. 375-390 16 p. |
artikel |
9 |
Listing graphs that satisfy first-order sentences
|
Goldberg, Leslie Ann |
|
1994 |
49 |
2 |
p. 408-424 17 p. |
artikel |
10 |
Measures of nondeterminism for pushdown automata
|
Salomaa, Kai |
|
1994 |
49 |
2 |
p. 362-374 13 p. |
artikel |
11 |
Non-deterministic communication complexity with few witnesses
|
Karchmer, Mauricio |
|
1994 |
49 |
2 |
p. 247-257 11 p. |
artikel |
12 |
On computing serial dependency relations
|
Krishnakumar, Narayanan |
|
1994 |
49 |
2 |
p. 175-188 14 p. |
artikel |
13 |
Robust gift wrapping for the three-dimensional convex hull
|
Sugihara, Kokichi |
|
1994 |
49 |
2 |
p. 391-407 17 p. |
artikel |
14 |
The translation power of top-down tree-to-graph transducers
|
Engelfriet, Joost |
|
1994 |
49 |
2 |
p. 258-305 48 p. |
artikel |
15 |
Vacillatory learning of nearly minimal size grammars
|
Case, John |
|
1994 |
49 |
2 |
p. 189-207 19 p. |
artikel |