Filter your results
- 798
- 613
- 591
- 541
- 111
- 58
- 39
- 26
- 21
- 9
- 5
- 4
- 3
- 1
- 1
- 1
- 38
- 1085
- 354
- 56
- 31
- 15
- 13
- 8
- 6
- 4
- 1
- 1
- 25
- 20
- 20
- 1
- 1
- 18
- 10
- 16
- 21
- 93
- 98
- 104
- 93
- 76
- 76
- 77
- 94
- 107
- 107
- 83
- 72
- 61
- 28
- 27
- 22
- 10
- 5
- 15
- 4
- 6
- 11
- 6
- 16
- 11
- 4
- 4
- 3
- 7
- 1
- 3
- 3
- 3
- 1
- 1
- 6
- 2
- 1
- 1
- 2
- 1303
- 107
- 1
- 1411
- 222
- 120
- 65
- 51
- 49
- 45
- 44
- 41
- 38
- 36
- 32
- 31
- 31
- 30
- 27
- 26
- 26
- 22
- 21
- 21
- 20
- 19
- 19
- 17
- 16
- 16
- 13
- 12
- 12
- 12
- 11
- 11
- 10
- 10
- 9
- 9
- 9
- 9
- 9
- 9
- 8
- 8
- 8
- 7
- 7
- 7
- 7
- 7
- 6
- 6
- 6
- 6
- 6
- 6
- 6
- 6
- 6
- 6
- 5
- 5
- 5
- 5
- 5
- 5
- 5
- 5
- 5
- 5
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 87
- 54
- 51
- 51
- 50
- 47
- 44
- 41
- 39
- 37
- 36
- 35
- 35
- 34
- 30
- 30
- 28
- 28
- 27
- 24
- 23
- 21
- 21
- 20
- 20
- 20
- 20
- 20
- 19
- 19
- 17
- 16
- 16
- 16
- 16
- 16
- 16
- 15
- 15
- 15
- 15
- 15
- 14
- 14
- 14
- 14
- 14
- 13
- 13
- 13
- 13
- 13
- 13
- 12
- 12
- 12
- 12
- 12
- 12
- 12
- 11
- 11
- 11
- 11
- 11
- 11
- 11
- 11
- 10
- 10
- 10
- 10
- 10
- 10
- 10
- 10
- 10
- 10
- 10
- 10
- 9
- 9
- 9
- 9
- 9
- 9
- 9
- 9
- 9
- 9
- 8
- 8
- 8
- 8
- 8
- 8
- 8
- 8
- 8
- 8
|
On graphs with no induced subdivision of K4Journal of Combinatorial Theory, Series B, 2012, 102, pp.924-947. ⟨10.1016/j.jctb.2012.04.005⟩
Journal articles
lirmm-00736503v1
|
||
|
NLC-2 graph recognition and isomorphismGraph-Theoretic Concepts in Computer Science 33rd International Workshop, WG 2007, Dornburg, Germany, June 21-23, 2007., Jun 2007, Dornburg, Germany. pp.86-98, ⟨10.1007/978-3-540-74839-7_9⟩
Conference papers
hal-00134605v1
|
||
Analysis of HFE from a BDD point of viewCCC'03, 2003, China
Conference papers
hal-00081341v1
|
|||
|
Noncommutative symmetric functions IV : Quantum linear groups and Hecke algebras at q = 0Journal of Algebraic Combinatorics, 1997, 6, (4), pp.339-376
Journal articles
hal-00018539v1
|
||
Trees and algebraic semanticsPodelski Nivat. Trees, Automata and Languages, pp.291-310, 1992
Book sections
hal-00020731v1
|
|||
Correctness of basic systolic systems transformations1994, pp.315-321
Conference papers
hal-00020698v1
|
|||
Iterative and recursive matrix theoriesJournal of Algebra, 1984, 86, pp.302-314
Journal articles
hal-00020942v1
|
|||
|
Distribution of Avalanches on the (n,k)-wheelFPSAC/SFCA'03, 2003, Linkoping, Sweden
Conference papers
hal-00016372v1
|
||
|
Utilisation de l'algèbre linéaire en théorie des automates1er Colloque AFCET-SMF de Mathématiques Appliquées, Sep 1978, Palaiseau, France. pp.85-92
Conference papers
hal-00340773v1
|
||
The equational theory of omega-terms for finite R-trivial semigroupsProc. of Semigroups and Languages, 2004, Portugal. pp.1--23
Conference papers
hal-00306424v1
|
|||
|
The growth ratio of synchronous rational relations is uniqueTheoretical Computer Science, 2007, 376, pp.52-59
Journal articles
hal-00160891v1
|
||
|
Challenges in Timed Languages: From Applied Theory to Basic TheoryBulletin- European Association for Theoretical Computer Science, 2004, 83, pp.106-120
Journal articles
hal-00157685v1
|
||
|
Propositional Dynamic Logic with Recursive ProgramsJournal of Logic and Algebraic Programming, 2007, 73 (1-2), pp.51-69. ⟨10.1016/j.jlap.2006.11.003⟩
Journal articles
hal-00153571v1
|
||
On alpha-adic expansions in Pisot basesTheoretical Computer Science, 2007, 380, pp.238-250
Journal articles
hal-00159691v1
|
|||
|
Complexity of pebble tree-walking automata16th International Symposium on Fundamentals of Computation Theory, Aug 2007, Budapest, Hungary
Conference papers
hal-00158716v1
|
||
|
Bidimensional Sand Pile and Ice Pile Models2007
Preprints, Working Papers, ...
hal-00159487v1
|
||
Distributed programming for dummies: A shifting transformation technique.SRDS, Oct 2003, Florence, Italy. pp.349-360
Conference papers
hal-00154853v1
|
|||
(Almost) All Objects Are Universal in Message Passing SystemsDISC, Sep 2005, Cracow, Poland. pp.184-198
Conference papers
hal-00154869v1
|
|||
|
Parameterized Reachability Analysis of the IEEE 1394 Root Contention Protocol using TReXProceedings of the Real-Time Tools Workshop (RT TOOLS'01), Aug 2001, Aalborg, Denmark. pp.1-20
Conference papers
hal-00110454v1
|
||
|
A topological approach to transductionsTheoretical Computer Science, 2005, 340, pp.443-456
Journal articles
hal-00112837v1
|
||
Window Subsequence Problem for Compressed TextsLecture Notes in Computer Science, 2006, 3697, pp.127-136
Journal articles
hal-00095714v1
|
|||
Representing Partitive Crossing Families and Union-Difference Families, with Application to Sesquimodular DecompositionRR-07031, 2007
Reports
lirmm-00199916v1
|
|||
|
A variant of the tandem duplication - random loss model of genome rearrangementTheoretical Computer Science, 2009, 410 (8-10), pp.847-858. ⟨10.1016/j.tcs.2008.11.017⟩
Journal articles
hal-00206178v1
|
||
|
Competitive Graph SearchesRR-07017, 2007
Reports
lirmm-00132103v3
|
||
|
Cycle time of stochastic max-plus linear systemsElectronic Journal of Probability, 2008, 13 (2008), Paper 12, 322-340
Journal articles
hal-00197850v2
|
||
|
Longest Common Separable Pattern between PermutationsCombinatorial Pattern Matching, 18th Annual Symposium, CPM 2007, London, Canada, July 9-11, 2007, 2007, London, Canada. pp.316-327
Conference papers
hal-00128750v1
|
||
Dyson's rank, overpartitions, and weak Maass formsInternational Mathematics Research Notices, 2007, pp.Articel ID rnm063
Journal articles
hal-00173915v1
|
|||
|
On a conjecture of Schnoebelen2003, pp.35--54
Conference papers
hal-00112692v1
|
||
The number of Z-convex polyominoes2006, pp.221-232
Conference papers
hal-00159319v1
|
|||
|
Abstract Regular Model CheckingInternational Conference on Computer Aided Verification 2004, 2004, Boston, United States. pp.372-386
Conference papers
hal-00159512v1
|