| Ident. | Authors (with country if any) | Title |
|---|
| 000101 |
A. Bellanger [France] ; A. Janiak [Pologne] ; M. Y. Kovalyov [Biélorussie] ; A. Oulamara [France] | Scheduling an unbounded batching machine with job processing time compatibilities |
| 000122 |
Didier Galmiche [France] ; Yakoub Salhi [France] | Sequent calculi and decidability for intuitionistic hybrid logic |
| 000124 |
G. Bonfante [France] ; J.-Y. Marion [France] ; J.-Y. Moyen [France] | Quasi-interpretations a way to control resources |
| 000125 |
Isabelle Gnaedig [France] ; Hélène Kirchner [France] | Proving weak properties of rewriting |
| 000127 |
D. Jamet [France] ; G. Paquin [France] ; G. Richomme [France] ; L. Vuillon [France] | On the fixed points of the iterated pseudopalindromic closure operator |
| 000134 |
S. Chevillard [France] ; J. Harrison [États-Unis] ; M. Joldes [France] ; Ch. Lauter [France] | Efficient and accurate computation of upper bounds of approximation errors |
| 000135 |
Mouhebeddine Berrima [Tunisie] ; Narjes Ben Rajeb [Tunisie] ; Véronique Cortier [France] | DECIDING KNOWLEDGE IN SECURITY PROTOCOLS UNDER SOME E-VOTING THEORIES |
| 000138 |
Christopher Lynch [États-Unis] ; Silvio Ranise [Italie] ; Christophe Ringeissen [France] ; Duc-Khanh Tran [Namibie] | Automatic decidability and combinability |
| 000168 |
Yannick Chevalier [France] ; Michael Rusinowitch [France] | Symbolic protocol analysis in the union of disjoint intruder theories: Combining decision procedures |
| 000170 |
Guillaume Burel [France] ; Claude Kirchner [France] | Regaining cut admissibility in deduction modulo using abstract completion |
| 000179 |
Yannick Chevalier [France] ; Michaël Rusinowitch [France] | Compiling and securing cryptographic protocols |
| 000237 |
Damien Jamet [France] ; Jean-Luc Toutant [France] | Minimal arithmetic thickness connecting discrete planes |
| 000251 |
Mathieu Baudet [France] ; Véronique Cortier [France] ; Steve Kremer [France] | Computationally sound implementations of equational theories against passive adversaries |
| 000268 |
S. Brlek [Canada] ; D. Jamet [France] ; G. Paquin [Canada] | Smooth words on 2-letter alphabets having same parity |
| 000271 |
Elias P. Tsigaridas [France] ; Ioannis Z. Emiris [Grèce] | On the complexity of real root isolation using continued fractions |
| 000276 |
Jérome Besombes [France] ; Jean-Yves Marion [France] | LEARNING DISCRETE CATEGORIAL GRAMMARS FROM STRUCTURES |
| 000280 |
Yannick Chevalier [France] ; Michael Rusinowitch [France] | Hierarchical combination of intruder theories |
| 000296 |
Dominique Barth [France] ; Johanne Cohen [France] ; Taoufik Faik [France] | On the b-continuity property of graphs |
| 000298 |
Laurent Fousse [France] | Multiple-precision correctly rounded newton-cotes quadrature |
| 000301 |
Jérome Besombes [France] ; Jean-Yves Marion [France] | Learning tree languages from positive examples and membership queries |
| 000302 |
Pierre Arnoux [France] ; Valérie Berthe [France] ; Thomas Fernique [France] ; Damien Jamet [France] | Functional stepped surfaces, flips, and generalized substitutions |
| 000331 |
| Combining logical systems |
| 000348 |
Alexander Knapp [Allemagne] ; Stephan Merz [France] ; Martin Wirsing [Allemagne] ; Julia Zappe [Allemagne, France] | Specification and refinement of mobile systems in MTLA and mobile UML |
| 000362 |
Johanne Cohen [France] ; Fedor Fomin [Norvège] ; Pinar Heggemes [Norvège] ; Dieter Kratsch [France] ; Gregory Kucherov [France] | Optimal linear arrangement of interval graphs |
| 000369 |
Harald Ganzinger [Allemagne] ; Viorica Sofronie-Stokkermans [Allemagne] ; Uwe Waldmann [Allemagne] | Modular proof systems for partial functions with Evans equality |
| 000376 |
Olivier Bournez [France] ; Felipe Cucker [Hong Kong] ; Paulin Jacobe De Naurois [France] ; Jean-Yves Marion [France] | Implicit complexity over an arbitrary structure : Quantifier alternations |
| 000382 |
Abdessamad Imine [France] ; Michaël Rusinowitch [France] ; Gérald Oster [France] ; Pascal Molli [France] | Formal design and verification of operational transformation algorithms for copies convergence |
| 000383 |
Dominique Cansell [France] ; Dominique Méry [France] | Formal and incremental construction of distributed algorithms : On the distributed reference counting algorithm |
| 000384 |
Didier Galmiche [France] ; Dominique Larchey-Wendling [France] | Expressivity properties of boolean BI through relational models |
| 000388 |
Marco Bozzano [Italie] ; Roberto Bruttomesso [Italie] ; Alessandro Cimatti [Italie] ; Tommi Junttila [Finlande] ; Silvio Ranise [France] ; Peter Van Rossum [Pays-Bas] ; Roberto Sebastiani [Italie] | Efficient theory combination via boolean search |
| 000395 |
TING ZHANG [États-Unis] ; Henny B. Sipma [États-Unis] ; Zohar Manna [États-Unis] | Decision procedures for term algebras with integer constraints |
| 000396 |
Manin Abadi [États-Unis] ; Véronique Cortier [France] | Deciding knowledge in security protocols under equational thoories |
| 000401 |
Véronique Cortier [France] ; Steve Kremer [France] ; Ralf Kusters [Suisse] ; Bogdan Warinschi [France] | Computationally sound symbolic secrecy in the presence of hash functions |
| 000402 |
Michael Backes [Allemagne] ; Anupam Datta [États-Unis] ; Ante Derek [États-Unis] ; John C. Mitchell [États-Unis] ; Mathieu Turuani [France] | Compositional analysis of contract-signing protocols |
| 000407 |
JIA MENG [États-Unis] ; Claire Quigley [États-Unis] ; Lawrence C. Paulson [États-Unis] | Automation for interactive proof : First prototype |
| 000411 |
Nachum Dershowitz [Israël] ; Claude Kirchner [France] | Abstract canonical presentations |
| 000417 |
Franz Baader [Allemagne] ; Silvio Ghilardi [Italie] ; Cesare Tinelli [États-Unis] | A new combination procedure for the word problem that generalizes fusion decidability results in modal logics |
| 000448 |
Hazel Everett [France] ; Celina M. H. De Figueiredo [Brésil] ; Sulamita Klein [Brésil] ; Bruce Reed [Canada] | The perfection and recognition of bull-reducible Berge graphs |
| 000449 |
Clara Bertolissi [France] | The graph rewriting calculus : Confluence and expressiveness |
| 000450 |
Peter Bürgisser [Allemagne] ; Felipe Cucker [Hong Kong] ; Paulin Jacobé De Naurois [France] | The complexity of semilinear problems in succinct representation |
| 000484 |
Isabelle Debled-Rennesson [France] ; Jean-Luc Remy [France] ; Jocelyne Rouyer-Degli [France] | Linear segmentation of discrete curves into blurred segments |
| 000499 |
Olivier Bournez [France] ; Emmanuel Hainry [France] | Elementarily computable functions over the real numbers and R-sub-recursive functions |
| 000514 |
Mathilde Bouvel [France] ; Vladimir Grebinski [États-Unis] ; Gregory Kucherov [France] | Combinatorial search on graphs motivated by bioinformatics applications : A brief survey |
| 000515 |
Siva Anantharaman [France] ; Paliath Narendran [États-Unis] ; Michael Rusinowitch [France] | Closure properties and decision problems of dag automata |
| 000523 |
Y. Gerard [France] ; I. Debled-Rennesson [France] ; P. Zimmermann [France] | An elementary digital plane recognition algorithm |
| 000525 |
Yannick Chevalier [France] ; Ralf Küsters [Allemagne] ; Michaël Rusinowitch [France] ; Mathieu Turuani [France] | An NP decision procedure for protocol insecurity with XOR |
| 000555 |
| Implicit computational complexity |
| 000562 |
René Schott [France] ; Jean-Claude Spehner [France] | Two optimal parallel algorithms on the commutation class of a word |
| 000563 |
Laurent Alonso [France] ; Philippe Chassaing [France] ; Edward M. Reingold [États-Unis] ; René Schott [France] | The worst-case chip problem |
| 000567 |
Patrick Baillot [France] | Stratified coherence spaces: a denotational semantics for light linear logic |
| 000568 |
Yves Lafont [France] | Soft linear logic and polynomial time |
| 000569 |
S. Bellantoni [Canada] ; I. Oitavem [Portugal] | Separating NC along the δ axis |
| 000576 |
M. Hofmann [Allemagne] ; P. J. Scott [Canada] | Realizability models for BLL-like languages |
| 000584 |
L. Kristiansen [Norvège] ; K.-H. Niggl [Allemagne] | On the computational complexity of imperative programming languages |
| 000585 |
James S. Royer [États-Unis] | On the computational complexity of Longley's H functional |
| 000586 |
A. S. Murawski [Royaume-Uni] ; C.-H. L. Ong [Royaume-Uni] | On an interpretation of safe recursion in light affine logic |
| 000591 |
N. Danner [États-Unis] ; C. Pollett [États-Unis] | Minimization and NP multifunctions |
| 000595 |
Jean-Pierre Duval [France] ; Roman Kolpakov [Royaume-Uni] ; Gregory Kucherov [France] ; Thierry Lecroq [France] ; Arnaud Lefebvre [France] | Linear-time computation of local periods |
| 000597 |
Daniel Leivant [États-Unis] | Intrinsic reasoning about functional programs II: unipolar induction and primitive-recursion |
| 000625 |
Ralph Benzinger [États-Unis] | Automated higher-order complexity analysis |
| 000629 |
Klaus Aehlig [Allemagne] ; Ulrich Berger [Royaume-Uni] ; Martin Hofinann [Allemagne] ; Helmut Schwichtenberg [Allemagne] | An arithmetic for non-size-increasing polynomial-time computation |
| 000638 |
Damien Eveillard [France] ; Delphine Ropers [France] ; Hidde De Jong [France] ; Christiane Branlant [France] ; Alexander Bockmayr [France] | A multi-scale constraint programming model of alternative splicing regulation |
| 000680 |
Michaël Rusinowitch [France] ; Mathieu Turuani [France] | Protocol insecurity with a finite number of sessions and composed keys is NP-complete |
| 000723 |
J. Y. Marion [France] | Analysing the implicit complexity of programs |
| 000728 |
Jens Gustedt [France] ; Jan Arne Telle [Norvège] | A work-optimal coarse-grained PRAM algorithm for Lexicographically First Maximal Independent Set |
| 000729 |
Nicolas Biri [France] ; Didier Galmiche [France] | A separation logic for resource distribution |
| 000732 |
Alessandro Armando [Italie] ; Silvio Ranise [Italie, France] ; Michaël Rusinowitch [France] | A rewriting approach to satisfiability procedures |
| 000962 |
V. D. Blondel [Belgique] ; O. Bournez [France] ; P. Koiran [France] ; J. N. Tsitsiklis [États-Unis] | The stability of saturated linear dynamical systems is undecidable |
| 000979 |
C. Banderier [France] ; P. Flajolet [France] ; G. Schaeffer [France] ; M. Soria [France] | Planar maps and Airy phenomena |
| 000980 |
G. Kucherov [France] ; M. Rusinowitch [France] | Patterns in words versus patterns in trees : A brief survey and new results |
| 000984 |
O. Bournez [France] ; O. Maler [France] | On the representation of timed polyhedra |
| 000990 |
P. De Groote [France] | Linear higher-order matching is NP-complete |
| 000997 |
Assefaw Hadish Gebremedhin [Norvège] ; Isabelle Guérin Lassous [France] ; Jens Gustedt [France] ; Jan Arne Telle [Norvège] | Graph coloring on a coarse grained multiprocessor : (Extended abstract) |
| 000A02 |
S. Cavallar [Pays-Bas] ; B. Dodson [États-Unis] ; A. K. Lenstra [États-Unis] ; W. Lioen [Pays-Bas] ; P. L. Montgomery [États-Unis] ; B. Murphy [Australie] ; H. Te Riele [Pays-Bas] ; K. Aardal [Pays-Bas] ; J. Gilchrist [Canada] ; G. Guillerm [France] ; P. Leyland [Royaume-Uni] ; J. Marchand [France] ; F. Morain [France] ; A. Muffett [Royaume-Uni] ; C. Putman [États-Unis] ; C. Putnam [États-Unis] ; P. Zimmermann [France] | Factorization of a 512-bit RSA modulus |
| 000A32 |
C. Castro [France] ; E. Monfroy [Pays-Bas] | A control language for designing constraint solvers |
| 000A66 |
D. Galmiche [France] ; D. Larchey-Wendling [France] | Structural sharing and efficient proof-search in propositional intuitionistic logic |
| 000A68 |
P. Narendran [États-Unis] ; M. Rusinowitch [France] ; R. Verma [États-Unis] | RPO constraint solving is in NP |
| 000A69 |
P. De Groote [France] | On the strong normalisation of natural deduction with permutation-conversions |
| 000A76 |
H. Kirchner [France] ; P.-E. Moreau [France] | Non-deterministic computations in ELAN |
| 000A82 |
G. Dowek [France] ; T. Hardin [France] ; C. Kirchner [France] | Hol-λσ : An intentional first-order expression of higher-order logic |
| 000A92 |
V. Cortier [France] ; H. Ganzinger [Allemagne] ; F. Jacquemard [France] ; M. Veanes [Allemagne] | Decidable fragments of simultaneous rigid reachability |
| 000A97 |
G. Bonfante [France] ; A. Cichon [France] ; J. Y. Marion [France] ; H. Touzet [France] | Complexity classes and rewrite systems with polynomial interpretation |
| 000B02 |
H. Kirchner [France] ; P. D. Mosses [États-Unis] | Algebraic specifications, higher-order types, and set-theoretic models |
| 000B38 |
M. Hermann [France] ; G. Salzer [Autriche] | On the word, subsumption, and complement problem for recurrent term schematizations |
| 000B40 |
R. Kolpakov [France] ; G. Kucherov [France] ; Yu. Tarannikov [Russie] | On repetition-free binary words of minimal density |
| 000B41 |
N. Berregeb [France] ; A. Bouhoula [France] ; M. Rusinowitch [France] | Observational proofs with critical contexts |
| 000B44 |
B. Gramlich [France] | Modular aspects of rewrite-based specifications |
| 000B55 |
H. Touzet [France] | Encoding the Hydra battle as a rewrite system |
| 000B56 |
T. Genet [France] | Decidable approximations of sets of descendants and sets of normal forms |
| 000B71 |
H. Touzet [France] | A complex example of a simplifying rewrite system |
| 000C06 |
T. Genet [France] ; I. Gnaedig [France] | Termination proofs using gpo ordering constraints |
| 000C08 |
A. Bouhoula [États-Unis, France] ; J.-P. Jouannaud [États-Unis, France] ; J. Meseguer [États-Unis] | Specification and proof in membership equational logic |
| 000C09 |
A. Amaniss [France] ; M. Hermann ; D. Lugiez | Set operations for recurrent term schematizations |
| 000C12 |
C. Ringeissen [France] | Prototyping combination of unification algorithms with the ELAN rule-based programming language |
| 000C13 |
S. Malecki [France] | Proofs in system Fω can be done in system Fω 1 |
| 000C14 |
D. Leivant [États-Unis] ; J.-Y. Marion [France] | Predicative functional recurrence and poly-space |
| 000C15 |
C. Retore [France] | Pomset logic : A non-commutative extension of classical linear logic |
| 000C19 |
M. Hermann [France] ; P. G. Kolaitis [États-Unis] | On the complexity of unification and disunification in commutative idempotent semigroups |
| 000C22 |
R. Kolpakov [Russie] ; G. Kucherov [France] | Minimal letter frequency in n-th power-free binary words |
| 000C25 |
C. Kirchner [France] ; C. Ringeissen [France] | Higher-order equational unification via explicit substitutions |
| 000C38 |
J.-Y. Marion [France] | Case study : Additive linear logic and lattices |
| 000C44 |
P. De Groote [France] | An algebraic correctness criterion for intuitionistic proof-nets |
| 000C49 |
D. Bechet [France] ; P. De Groote [France] ; C. Retore [France] | A complete axiomatisation for the inclusion of series-parallel partial orders |
| 000D66 |
N. Doggaz ; C. Kirchner | Completion for unification |
