Skip to Main content Skip to Navigation

inria-00098986v1  Journal articles
Miki HermannPhokion G. Kolaitis. Computational Complexity of Simultaneous Elementary Matching Problems
Journal of Automated Reasoning, Springer Verlag, 1999, 23 (2), pp.107-136
inria-00098851v1  Journal articles
David PlaistedGregory Kucherov. The complexity of some complementation problems
Information Processing Letters, Elsevier, 1999, 71 (3-4), pp.159-165
inria-00099222v1  Journal articles
Miki HermannPhokion G. Kolaitis. Unification Algorithms Cannot Be Combined in Polynomial Time
Information and Computation, Elsevier, 2000, 162 (1-2), pp.24-42
inria-00100446v1  Journal articles
Rakesh VermaMichaël RusinowitchDenis Lugiez. Algorithms and Reductions for Rewriting Problems
Fundamenta Informaticae, Polskie Towarzystwo Matematyczne, 2001, 46 (3), pp.257-276
inria-00100887v1  Journal articles
Pankaj K. AgarwalThérèse BiedlSylvain LazardSteve RobbinsSubhash Suri et al.  Curvature-Constrained Shortest Paths in a Convex Polygon
SIAM Journal on Computing, Society for Industrial and Applied Mathematics, 2002, 31 (6), pp.1814-1851. ⟨10.1137/S0097539700374550⟩
inria-00100846v1  Journal articles
Elias DahlhausJens GustedtRoss M. Mcconnell. Partially complemented representations of digraphs
Discrete Mathematics and Theoretical Computer Science, DMTCS, 2002, 5, pp.147-168
inria-00101008v1  Journal articles
Egidio AstesianoMichel BidoitHélène KirchnerBernd Krieg-BrücknerPeter D. Mosses et al.  CASL: The Common Algebraic Specification Language
Theoretical Computer Science, Elsevier, 2002, 286 (2), pp.153-196
inria-00100889v1  Journal articles
Thérèse BiedlErik DemaineMartin DemaineSylvain LazardAnna Lubiw et al.  A Note on Reconfiguring Tree Linkages: Trees can Lock
Discrete Applied Mathematics, Elsevier, 2002, 117 (1-3), pp.293-297. ⟨10.1016/S0166-218X(01)00229-3⟩
inria-00100710v1  Journal articles
Arnaud DurandMiki HermannLaurent Juban. On the Complexity of Recognizing the Hilbert Basis of a Linear Diophantine System
Theoretical Computer Science, Elsevier, 2002, 270 (1-2), pp.625-642
hal-00005087v1  Journal articles
Laurent AlonsoPhilippe ChassaingFlorent GilletSvante JansonEdward M. Reingold et al.  Quicksort with unreliable comparisons: a probabilistic analysis
Combinatorics, Probability and Computing, Cambridge University Press (CUP), 2004, 13 (4-5), pp.419-449. ⟨10.1017/S0963548304006297⟩
hal-00164624v1  Journal articles
Laurent RomaryNancy Ide. International Standard for a Linguistic Annotation Framework
Natural Language Engineering, Cambridge University Press (CUP), 2004, 10 (3-4), pp.211-225
hal-00076735v1  Journal articles
Didier GalmicheDaniel MéryDavid Pym. The semantics of BI and resource tableaux
Mathematical Structures in Computer Science, Cambridge University Press (CUP), 2005, 15, pp.1033-1088
inria-00000141v1  Journal articles
Nicolas P. RougierDavid C. NoelleTodd S. BraverJohn D. CohenRandall C. O'Reilly. Prefrontal Cortex and Flexible Cognitive Control: Rules Without Symbols
Proceedings of the National Academy of Sciences of the United States of America , National Academy of Sciences, 2005, 102 (20), pp.7338-7343
inria-00000384v1  Journal articles
Hervé BrönnimannHazel EverettSylvain LazardFrank SottileSue Whitesides. Transversals to line segments in three-dimensional space
Discrete and Computational Geometry, Springer Verlag, 2005, 34 (3), pp.381 - 390. ⟨10.1007/s00454-005-1183-1⟩
inria-00103923v1  Journal articles
Olivier DevillersHazel EverettSylvain LazardMaria PentchevaSteve Wismath. Drawing Kn in Three Dimensions with One Bend per Edge
Journal of Graph Algorithms and Applications, Brown University, 2006, 10 (2), pp.287-295
inria-00000598v1  Journal articles
Hervé BrönnimannOlivier DevillersSylvain LazardFrank Sottile. Lines tangent to four triangles in three-dimensional space
Discrete and Computational Geometry, Springer Verlag, 2007, 37 (3), pp.369-380. ⟨10.1007/s00454-006-1278-3⟩
inria-00192927v1  Journal articles
Olivier DevillersVida DujmovicHazel EverettSamuel HornusSue Whitesides et al.  Maintaining Visibility Information of Planar Point Sets with a Moving Viewpoint
International Journal of Computational Geometry and Applications, World Scientific Publishing, 2007, 17 (4), pp.297-304. ⟨10.1142/S0218195907002343⟩
inria-00103916v1  Journal articles
Hervé BrönnimannOlivier DevillersVida DujmovicHazel EverettMarc Glisse et al.  Lines and free line segments Tangent to Arbitrary Three-dimensional Convex Polyhedra
SIAM Journal on Computing, Society for Industrial and Applied Mathematics, 2007, 37 (2), pp.522-551. ⟨10.1137/S0097539705447116⟩
inria-00169183v1  Journal articles
Laurent AlonsoEdward M. Reingold. Average-Case Lower Bounds for the Plurality Problem
ACM Transactions on Algorithms, Association for Computing Machinery, 2008, 4 (3), pp.27:1,27:17. ⟨10.1145/1367064.1367067⟩
inria-00169184v1  Journal articles
Laurent AlonsoEdward M. Reingold. Determining Plurality
ACM Transactions on Algorithms, Association for Computing Machinery, 2008, 4 (3), pp.26:1,26:19. ⟨10.1145/1367064.1367066⟩
inria-00430781v1  Journal articles
Carmel DomshlakJoerg HoffmannAshish Sabharwal. Friends or Foes? On Planning as Satisfiability and Abstract CNF Encodings
Journal of Artificial Intelligence Research, Association for the Advancement of Artificial Intelligence, 2009, 36, pp.415-469. ⟨10.1613/jair.2817⟩
inria-00325044v1  Journal articles
Laurent AlonsoEdward M. Reingold. Average-Case Analysis of Some Plurality Algorithms
ACM Transactions on Algorithms, Association for Computing Machinery, 2009, 5 (2), ⟨10.1145/1497290.1497293⟩
inria-00547936v1  Journal articles
Yang LiuWenping WangBruno LévyFeng SunDong-Ming Yan et al.  On Centroidal Voronoi Tessellation--Energy Smoothness and Fast Computation
ACM Transactions on Graphics, Association for Computing Machinery, 2009, 28 (4), pp.Article 101. ⟨10.1145/1559755.1559758⟩
inria-00437121v1  Journal articles
Muhammad Imran RazzakS.A. HussainAbdel BelaïdMuhammad Sher. Multi-font Numerals Recognition for Urdu Script based Languages
International Journal of Recent Trends in Engineering (IJRTE), Academy publisher, 2009