Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/ita/ita33.bht:"
download as .bib file
@article{DBLP:journals/ita/Abdeljaouad99,
author = {Ines Abdeljaouad},
title = {Calculs d'invariants primitifs de groupes finis},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {33},
number = {1},
pages = {59--78},
year = {1999},
url = {https://doi.org/10.1051/ita:1999106},
doi = {10.1051/ITA:1999106},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/Abdeljaouad99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/Arnold99,
author = {Andr{\'{e}} Arnold},
title = {p329 The {\(\mathrm{\mu}\)}-calculus alternation-depth hierarchy is
strict on binary trees},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {33},
number = {4/5},
pages = {329--340},
year = {1999},
url = {https://doi.org/10.1051/ita:1999121},
doi = {10.1051/ITA:1999121},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/Arnold99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/BackhouseH99,
author = {Roland Carl Backhouse and
Paul F. Hoogendijk},
title = {Final dialgebras: From categories to allegories},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {33},
number = {4/5},
pages = {401--426},
year = {1999},
url = {https://doi.org/10.1051/ita:1999126},
doi = {10.1051/ITA:1999126},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/BackhouseH99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/BolligLSW99,
author = {Beate Bollig and
Martin L{\"{o}}bbing and
Martin Sauerhoff and
Ingo Wegener},
title = {On the complexity of the hidden weighted bit function for various
{BDD} models},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {33},
number = {2},
pages = {103--116},
year = {1999},
url = {https://doi.org/10.1051/ita:1999108},
doi = {10.1051/ITA:1999108},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/BolligLSW99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/BorchertKS99,
author = {Bernd Borchert and
Dietrich Kuske and
Frank Stephan},
title = {On existentially first-order definable languages and their relation
to {NP}},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {33},
number = {3},
pages = {259--270},
year = {1999},
url = {https://doi.org/10.1051/ita:1999116},
doi = {10.1051/ITA:1999116},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/BorchertKS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/Bradfield99,
author = {Julian C. Bradfield},
title = {Fixpoint alternation: Arithmetic, transition systems, and the binary
tree},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {33},
number = {4/5},
pages = {341--356},
year = {1999},
url = {https://doi.org/10.1051/ita:1999122},
doi = {10.1051/ITA:1999122},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/Bradfield99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/CarrascoO99,
author = {Rafael C. Carrasco and
Jos{\'{e}} Oncina},
title = {Learning deterministic regular grammars from stochastic samples in
polynomial time},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {33},
number = {1},
pages = {1--20},
year = {1999},
url = {https://doi.org/10.1051/ita:1999102},
doi = {10.1051/ITA:1999102},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/CarrascoO99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/CartonM99,
author = {Olivier Carton and
Ram{\'{o}}n Maceiras},
title = {Computing the Rabin Index of a Parity Automaton},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {33},
number = {6},
pages = {495--506},
year = {1999},
url = {https://doi.org/10.1051/ita:1999129},
doi = {10.1051/ITA:1999129},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/CartonM99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/CorradiniG99,
author = {Andrea Corradini and
Fabio Gadducci},
title = {Rewriting on cyclic structures: Equivalence between the operational
and the categorical description},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {33},
number = {4/5},
pages = {467--493},
year = {1999},
url = {https://doi.org/10.1051/ita:1999128},
doi = {10.1051/ITA:1999128},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/CorradiniG99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/CorradiniNL99,
author = {Flavio Corradini and
Rocco De Nicola and
Anna Labella},
title = {A finite axiomatization of nondeterministic regular expressions},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {33},
number = {4/5},
pages = {447--466},
year = {1999},
url = {https://doi.org/10.1051/ita:1999127},
doi = {10.1051/ITA:1999127},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/CorradiniNL99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/Davoren99,
author = {Jennifer M. Davoren},
title = {Topologies, continuity and bisimulations},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {33},
number = {4/5},
pages = {357--382},
year = {1999},
url = {https://doi.org/10.1051/ita:1999123},
doi = {10.1051/ITA:1999123},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/Davoren99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/Frougny99,
author = {Christiane Frougny},
title = {On-line finite automata for addition in some numeration systems},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {33},
number = {1},
pages = {79--101},
year = {1999},
url = {https://doi.org/10.1051/ita:1999107},
doi = {10.1051/ITA:1999107},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/Frougny99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/GeserZ99,
author = {Alfons Geser and
Hans Zantema},
title = {Non-looping string rewriting},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {33},
number = {3},
pages = {279--302},
year = {1999},
url = {https://doi.org/10.1051/ita:1999118},
doi = {10.1051/ITA:1999118},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/GeserZ99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/Grubel99,
author = {Rudolf Gr{\"{u}}bel},
title = {On the median-of-K version of Hoare's selection algorithm},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {33},
number = {2},
pages = {177--192},
year = {1999},
url = {https://doi.org/10.1051/ita:1999112},
doi = {10.1051/ITA:1999112},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/Grubel99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/GurovK99,
author = {Dilian Gurov and
Bruce M. Kapron},
title = {A note on negative tagging for least fixed-point formulae},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {33},
number = {4/5},
pages = {383--392},
year = {1999},
url = {https://doi.org/10.1051/ita:1999124},
doi = {10.1051/ITA:1999124},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ita/GurovK99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/HalavaH99,
author = {Vesa Halava and
Tero Harju},
title = {Undecidability of the equivalence of finite substitutions on regular
language},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {33},
number = {2},
pages = {117--124},
year = {1999},
url = {https://doi.org/10.1051/ita:1999109},
doi = {10.1051/ITA:1999109},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ita/HalavaH99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/Honkala99,
author = {Juha Honkala},
title = {On sequences defined by {D0L} power series},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {33},
number = {2},
pages = {125--132},
year = {1999},
url = {https://doi.org/10.1051/ita:1999110},
doi = {10.1051/ITA:1999110},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/Honkala99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/Hromkovic99,
author = {Juraj Hromkovic},
title = {Communication complexity and lower bounds on multilective computations},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {33},
number = {2},
pages = {193--212},
year = {1999},
url = {https://doi.org/10.1051/ita:1999113},
doi = {10.1051/ITA:1999113},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/Hromkovic99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/HuyL99,
author = {Phan Trung Huy and
Nguyen Huong Lam},
title = {Unavoidable set: extension and reduction},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {33},
number = {3},
pages = {213--226},
year = {1999},
url = {https://doi.org/10.1051/ita:1999114},
doi = {10.1051/ITA:1999114},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/HuyL99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/Matthes99,
author = {Ralph Matthes},
title = {Monotone (co)inductive types and positive fixed-point types},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {33},
number = {4/5},
pages = {309--328},
year = {1999},
url = {https://doi.org/10.1051/ita:1999120},
doi = {10.1051/ITA:1999120},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/Matthes99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/MeinelT99,
author = {Christoph Meinel and
Thorsten Theobald},
title = {On the Influence of the State Encoding on OBDD-Representations of
Finite State Machines},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {33},
number = {1},
pages = {21--32},
year = {1999},
url = {https://doi.org/10.1051/ita:1999103},
doi = {10.1051/ITA:1999103},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/MeinelT99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/MoritaMI99,
author = {Kenichi Morita and
Maurice Margenstern and
Katsunobu Imai},
title = {Universality of Reversible Hexagonal Cellular Automata},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {33},
number = {6},
pages = {535--550},
year = {1999},
url = {https://doi.org/10.1051/ita:1999131},
doi = {10.1051/ITA:1999131},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/MoritaMI99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/PaoliniR99,
author = {Luca Paolini and
Simona Ronchi Della Rocca},
title = {Call-by-value Solvability},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {33},
number = {6},
pages = {507--534},
year = {1999},
url = {https://doi.org/10.1051/ita:1999130},
doi = {10.1051/ITA:1999130},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/PaoliniR99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/PrellerD99,
author = {Anne Preller and
Patrice Duroux},
title = {Normalisation of the Theory {T} of Cartesian Closed Categories and
Conservativity of Extensions T[x] of {T}},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {33},
number = {3},
pages = {227--258},
year = {1999},
url = {https://doi.org/10.1051/ita:1999115},
doi = {10.1051/ITA:1999115},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/PrellerD99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/Redziejowski99,
author = {Roman R. Redziejowski},
title = {Construction of a deterministic -automaton using derivatives},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {33},
number = {2},
pages = {133--158},
year = {1999},
url = {https://doi.org/10.1051/ita:1999111},
doi = {10.1051/ITA:1999111},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/Redziejowski99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/Rothe99,
author = {J{\"{o}}rg Rothe},
title = {Immunity and simplicity for exact counting and other counting classes},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {33},
number = {2},
pages = {159--176},
year = {1999},
url = {https://doi.org/10.1051/ita:1999100},
doi = {10.1051/ITA:1999100},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/Rothe99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/Rutten99,
author = {Jan J. M. M. Rutten},
title = {A note on coinduction and weak bisimilarity for while programs},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {33},
number = {4/5},
pages = {393--400},
year = {1999},
url = {https://doi.org/10.1051/ita:1999125},
doi = {10.1051/ITA:1999125},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/Rutten99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/SeidlN99,
author = {Helmut Seidl and
Damian Niwinski},
title = {On distributive fixed-point expressions},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {33},
number = {4/5},
pages = {427--446},
year = {1999},
url = {https://doi.org/10.1051/ita:1999101},
doi = {10.1051/ITA:1999101},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/SeidlN99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/Selmi99,
author = {Carla Selmi},
title = {Strongly locally testable semigroups with commuting idempotents and
related languages},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {33},
number = {1},
pages = {47--58},
year = {1999},
url = {https://doi.org/10.1051/ita:1999105},
doi = {10.1051/ITA:1999105},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/Selmi99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/SernaX99,
author = {Maria J. Serna and
Fatos Xhafa},
title = {On the Average Case Complexity of Some P-complete Problems},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {33},
number = {1},
pages = {33--46},
year = {1999},
url = {https://doi.org/10.1051/ita:1999104},
doi = {10.1051/ITA:1999104},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/SernaX99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/Szepietowski99,
author = {Andrzej Szepietowski},
title = {There is no complete axiom system for shuffle expressions},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {33},
number = {3},
pages = {271--278},
year = {1999},
url = {https://doi.org/10.1051/ita:1999117},
doi = {10.1051/ITA:1999117},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/Szepietowski99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/Szepietowski99a,
author = {Andrzej Szepietowski},
title = {Lower space bounds for accepting shuffle languages},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {33},
number = {3},
pages = {303--307},
year = {1999},
url = {https://doi.org/10.1051/ita:1999119},
doi = {10.1051/ITA:1999119},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/Szepietowski99a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
retrieved on 2024-05-21 10:31 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
