| 
| |  | |  |
Window-Accumulated Subsequence Matching Problem is Linear
Note: Links lead to the DBLP on the Web.
Irène Guessarian
27
Luc Boasson
,
Patrick Cegielski
, Irène Guessarian,
Yuri Matiyasevich
: Window-Accumulated Subsequence Matching Problem is Linear.
PODS 1999
: 327-336
26
N. Bensaou
, Irène Guessarian: Transforming Constraint Logic Programs.
TCS 206
(1-2): 81-125 (1998)
25
Foto N. Afrati
, Irène Guessarian,
Michel de Rougemont
: The Expressiveness of Datalog Circuits (DAC).
MFCS 1997
: 119-128
24
Irène Guessarian,
Jean-Eric Pin
: Linearizing Some Recursive Logic Programs.
TKDE 7
(1): 137-149 (1995)
23
Jozef Gruska
, Irène Guessarian: Correctness of Basic Systolic Systems Transformations.
IFIP Congress, Vol. 1 1994
: 315-321
22
N. Bensaou
, Irène Guessarian: An Extended Transformation System for CLP Programs.
LOPSTR 1994
: 17-35
21
N. Bensaou
, Irène Guessarian: Transforming Constraint Logic Programs.
STACS 1994
: 33-46
20
Irène Guessarian,
Marcos Veloso Peixoto
: About Boundedness for Some Datalog and Datalog
neg
Programs.
Journal of Logic and Computation 4
(4): 375-403 (1994)
19
Irène Guessarian,
Marcos Veloso Peixoto
: About Boundedness for some DATALOG and DATALOG_neg Programs.
MFCS 1992
: 284-297
18
Irène Guessarian: Deciding Boundedness for Uniformly Connected Datalog Programs.
ICDT 1990
: 395-405
17
Irène Guessarian: Improving Fixpoint Toole for Computer Science.
IFIP 1989
: 1109-1114
16
Georges Gardarin
, Irène Guessarian,
Christophe de Maindreville
: Translation of Logic Programs into Functional Fixpoint Equations.
TCS 63
(3): 253-274 (1989)
15
Irène Guessarian,
Wafaa Niar-Dinedane
: An Automaton Characterization of Fairness in SCCS.
STACS 1988
: 356-372
14
Irène Guessarian,
Lutz Priese
: On the Minimal Number of * Operators to Model Regularity in Fair SCCS.
IPL 29
(6): 297-300 (1988)
13
Irène Guessarian: Equational Axiomatizations of If-Then-Else.
CTRS 1987
: 98-110
12
Hajnal Andréka
, Irène Guessarian,
István Németi
: A Unifying Theorem for Algebraic Semantics and Dynamic Logics.
Information and Computation 72
(1): 31-45 (1987)
11
David B. Benson
, Irène Guessarian: Algebraic Solutions to Recursion Schemes.
JCSS 35
(3): 365-400 (1987)
10
Irène Guessarian,
José Meseguer
: On the Axiomatization of ``If-Then-Else''.
SIAM J. Comput. 16
(2): 332-357 (1987)
9
Irène Guessarian: Pushdown Tree Automata.
Mathematical Systems Theory 16
(4): 237-263 (1983)
8
Irène Guessarian: On Pushdown Tree Automata.
CAAP 1981
: 211-223
7
Werner Damm
, Irène Guessarian: Combining T and level-N.
MFCS 1981
: 262-270
6
F. Ermine
, Irène Guessarian: About Program Termination and Simplification.
Symposium on Programming 1980
: 123-135
5
Irène Guessarian: Program Transformations and Algebraic Semantics.
TCS 9
: 39-65 (1979)
4
Irène Guessarian: Some Applications of Algebraic Semantics.
MFCS 1978
: 257-266
3
Bruno Courcelle
, Irène Guessarian: On Some Classes of Interpretations.
JCSS 17
(3): 406-431 (1978)
2
Irène Guessarian: Tests et leur Caractérisation Syntaxique.
ITA 11
(2): 133-156 (1977)
1
Irène Guessarian: Semantic Equivalence of Program Schemes and its Syntactic Characterization.
ICALP 1976
: 189-200
Copyright(C) 2000 ACM | | | | | | |
