Complexité And NotGuénaël Renault
List of bibliographic references
Number of relevant bibliographic references: 20.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 |
000124 | G. Bonfante [France] ; J.-Y. Marion [France] ; J.-Y. Moyen [France] | Quasi-interpretations a way to control resources |
000275 | Hervé Brönnimann [États-Unis] ; Olivier Devillers [France] ; Vida Dujmovic [Canada] ; Hazel Everett [France] ; Marc Glisse [France] ; Xavier Goaoc [France] ; Sylvain Lazard [France] ; Hyeon-Suk Na [Corée du Sud] ; Sue Whitesides [Canada] | LINES AND FREE LINE SEGMENTS TANGENT TO ARBITRARY THREE-DIMENSIONAL CONVEX POLYHEDRA |
000296 | Dominique Barth [France] ; Johanne Cohen [France] ; Taoufik Faik [France] | On the b-continuity property of graphs |
000467 | Dominique Martinez [France] | Oscillatory synchronization requires precise and balanced feedback inhibition in a model of the insect antennal lobe |
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 |
000642 | Damien Stehle [France] ; Paul Zimmermann [France] | A binary recursive Gcd algorithm |
000662 | Karell Bertet [France] ; Jens Gustedt [France] ; Michel Morvan [France] | Weak-order extensions of an order |
000680 | Michaël Rusinowitch [France] ; Mathieu Turuani [France] | Protocol insecurity with a finite number of sessions and composed keys is NP-complete |
000685 | F. Laroussinie [France] ; Ph. Schnoebelen [France] ; M. Turuani [France] | On the expressivity and complexity of quantitative branching-time temporal logics |
000686 | Sylvain Salvati [France] ; Philippe De Groote [France] | On the complexity of higher-order matching in the linear λ-Calculus |
000697 | Assefaw Hadish Gebremedhin [Norvège] ; Isabelle Guerin Lassous [France] ; Jens Gustedt [France] ; Jan Arne Telle [Norvège] | Graph coloring on coarse grained multicomputers |
000735 | N. N. Pisaruk [France] | A fully combinatorial 2-approximation algorithm for precedence-constrained scheduling a single machine to minimize average weighted completion time |
000797 | Serge Grigorieff [France] ; Jean-Yves Marion [France] | Kolmogorov complexity and non-determinism |
000892 | Laurent Alonso [France] ; René Schott [France] | On the tree inclusion problem |
000954 | Proof-search in Type-theoretic Languages | |
000959 | Miki Hermann [France] ; Phokion G. Kolaitis [États-Unis] | Unification algorithms cannot be combined in polynomial time |
000A70 | A. Durand [France] ; M. Hermann [France] ; L. Juban [France] | On the complexity of recognizing the Hilbert basis of a linear Diophantine system |
000D86 | R. Mohr ; T. C. Henderson ; A. Mackworth | Arc and path consistency revisited |
This area was generated with Dilib version V0.6.33. |