Pascal and Francis Bibliographic Databases

Help

Search results

Your search

jo.\*:(%22River research and applications %28Print%29%22)

Filter

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Origin

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 893772

  • Page / 35751
Export

Selection :

  • and

Pipelined decomposable bsp computersBERAN, Martin.Theoretical informatics and applications. 2002, Vol 36, Num 1, pp 43-65Article

Semantics of value recursion for monadic input/outputERKÖK, Levent; LAUNCHBURY, John; MORAN, Andrew et al.Theoretical informatics and applications. 2002, Vol 36, Num 2, pp 155-180, 26 p.Conference Paper

A coalgebraic semantics of subtypingPOLL, Erik.Theoretical informatics and applications. 2001, Vol 35, Num 1, pp 61-81Article

A conjecture on the concatenation productPIN, Jean-Eric; WEIL, Pascal.Theoretical informatics and applications. 2001, Vol 35, Num 6, pp 597-618Article

A generalisation of entity and referential integrity in relational databasesLEVENE, Mark; LOIZOU, George.Theoretical informatics and applications. 2001, Vol 35, Num 2, pp 113-127Article

Atoms and partial orders of infinite languagesKUICH, Werner; SAUER, N. W.Theoretical informatics and applications. 2001, Vol 35, Num 4, pp 389-401Article

Automata-based representations for infinite graphsLA TORRE, Salvatore; NAPOLI, Margherita.Theoretical informatics and applications. 2001, Vol 35, Num 4, pp 311-330Article

Free burnside semigroupsPEREIRA DO LAGO, Alair; SIMON, Imre.Theoretical informatics and applications. 2001, Vol 35, Num 6, pp 579-595Article

On graph products of automatic monoidsVELOSO DA COSTA, A.Theoretical informatics and applications. 2001, Vol 35, Num 5, pp 403-417Article

Towards parametrizing word equationsABDULRAB, H; GORALCK, P; MAKANIN, G. S et al.Theoretical informatics and applications. 2001, Vol 35, Num 4, pp 331-350Article

Closure under union and composition of iterated rational transductionsSIMPLOT, D; TERLUTTE, A.Theoretical informatics and applications. 2000, Vol 34, Num 3, pp 183-212Article

Density of critical factorizationsHARJU, Tero; NOWOTKA, Dirk.Theoretical informatics and applications. 2002, Vol 36, Num 3, pp 315-327, 13 p.Article

On multiplicatively dependent linear numeration systems, and periodic pointsFROUGNY, Christiane.Theoretical informatics and applications. 2002, Vol 36, Num 3, pp 293-314, 22 p.Article

On the size of one-way quantum finite automata with periodic behaviorsMEREGHETTI, Carlo; PALANO, Beatrice.Theoretical informatics and applications. 2002, Vol 36, Num 3, pp 277-291, 15 p.Article

Words over an ordered alphabet and suffix permutationsDUVAL, Jean-Pierre; LEFEBVRE, Arnaud.Theoretical informatics and applications. 2002, Vol 36, Num 3, pp 249-259, 11 p.Article

An exercise on fibonacci representationsBERSTEL, Jean.Theoretical informatics and applications. 2001, Vol 35, Num 6, pp 491-498Article

Commutative images of rational languages and the Abelian Kernel of a monoidDELGADO, Manuel.Theoretical informatics and applications. 2001, Vol 35, Num 5, pp 419-435Article

Depth lower bounds for monotone semi-unbounded fan-in circuitsJOHANNSEN, Jan.Theoretical informatics and applications. 2001, Vol 35, Num 3, pp 277-286Article

Division in logspace-uniform NCCHIU, Andrew; DAVIDA, George; LITOW, Bruce et al.Theoretical informatics and applications. 2001, Vol 35, Num 3, pp 259-276Article

PAC learning under helpful distributionsDENIS, Francois; GILLERON, Rémi.Theoretical informatics and applications. 2001, Vol 35, Num 2, pp 129-148Article

Restricted nondeterministic read-once branching programs and an exponential lower bound for integer multiplicationBOLLIG, Beate.Theoretical informatics and applications. 2001, Vol 35, Num 2, pp 149-162Article

Computing the prefix of an automatonBEAL, Marie-Pierre; CARTON, Olivier.Theoretical informatics and applications. 2000, Vol 34, Num 6, pp 503-514Article

Finite presentability of strongly finite dilatorsTAKAKI, Osamu.Theoretical informatics and applications. 2000, Vol 34, Num 6, pp 425-431Article

Return words in Sturmian and Episturmian wordsJUSTIN, Jacques; VUILLON, Laurent.Theoretical informatics and applications. 2000, Vol 34, Num 5, pp 343-356Article

Polypodic codesBOZAPALIDIS, Symeon; LOUSCOU-BOZAPALIDOU, Olympia.Theoretical informatics and applications. 2002, Vol 36, Num 1, pp 5-28Article

  • Page / 35751