Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Computation theory")

Filter

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 14264

  • Page / 571
Export

Selection :

  • and

Une condition impliquant toutes les identités rationnelles = A condition implying all rational identitiesBOFFA, M.Informatique théorique et applications (Imprimé). 1995, Vol 29, Num 6, pp 515-518, issn 0988-3754Article

Grammar-oriented enumeration of binary treesXIANG, L; TANG, C; USHIJIMA, K et al.Computer journal (Print). 1997, Vol 40, Num 5, pp 278-291, issn 0010-4620Article

Modelling causality via action dependencies in branching time semanticsGOLTZ, U; WEHRHEIM, H.Information processing letters. 1996, Vol 59, Num 4, pp 179-184, issn 0020-0190Article

Entropy generation in a model of reversible computationDE FALCO, Diego; TAMASCELLI, Dario.Informatique théorique et applications (Imprimé). 2006, Vol 40, Num 2, pp 93-105, issn 0988-3754, 13 p.Article

A note on finitely ambiguous distance automata = Une note sur les automates à distance infiniment ambiguëLEUNG, H.Information processing letters. 1992, Vol 44, Num 6, pp 329-331, issn 0020-0190Article

Translating logic programs into conditional rewriting systemsVAN RAAMSDONK, F.Report - Probability, networks and algorithms. 1998, Num 3, pp 1-21, issn 1386-3711Article

Machine induction without revolutionary changes in hypothesis sizeCASE, J; JAIN, S; SHARMA, A et al.Information and computation (Print). 1996, Vol 128, Num 2, pp 73-86, issn 0890-5401Article

Splicing systems with targets are computationally universalPAUN, G.Information processing letters. 1996, Vol 59, Num 3, pp 129-133, issn 0020-0190Article

A Post-Processing Integral Formulation for the Computation of Magnetic Field in ConductorsGUIBERT, A; COULOMB, J.-L; CHADEBEC, O et al.IEEE transactions on magnetics. 2011, Vol 47, Num 5, pp 1334-1337, issn 0018-9464, 4 p.Conference Paper

Web, education, and computational physics; good, bad, and uglyLANDAU, R. H.Computer physics communications. 1999, Vol 121-22, pp 550-556, issn 0010-4655Conference Paper

Opérateurs de mise en mémoire et types ∀-positifs = Storage operators and ∀-positive typesNOUR, K.Informatique théorique et applications (Imprimé). 1996, Vol 30, Num 3, pp 261-293, issn 0988-3754Article

Expressive flexibility of a constraint-oriented notationBOLOGNESI, T.Computer journal (Print). 1997, Vol 40, Num 5, pp 259-277, issn 0010-4620Article

Orthogonalising Pseudo-Potentials in electronic structure calculationsMITROY, J; RYZHIKH, G. G.Computer physics communications. 1999, Vol 123, Num 1-3, pp 103-113, issn 0010-4655Article

Axiomatizing probabilistic processes : ACP with generative probabilitiesBAETEN, J. C. M; BERGSTRA, J. A.Information and computation (Print). 1995, Vol 121, Num 2, pp 234-255, issn 0890-5401Article

Sensitivity analysis in the context of uncertainty analysis for computationally intensive modelsHOFER, E.Computer physics communications. 1999, Vol 117, Num 1-2, pp 21-34, issn 0010-4655Conference Paper

Why tricategories?POWER, A. J.Information and computation (Print). 1995, Vol 120, Num 2, pp 251-262, issn 0890-5401Article

The Collaborative Computational Project on surfaces : CCP3GRIMLEY, T. B; INGLESFIELD, J. E.Computer physics communications. 2001, Vol 137, Num 1, pp 1-3, issn 0010-4655Article

Computational physics and the undergraduate curriculumGOULD, H.Computer physics communications. 2000, Vol 127, Num 1, pp 6-10, issn 0010-4655Conference Paper

Modern Trends in Computational Physics, MTCP 98, Dubna, 15-20 June 1998MORGAN, David L; PUZYNIN, Igor V; SHAHBAGHYAN, Ruben R et al.Computer physics communications. 2000, Vol 126, Num 1-2, issn 0010-4655, 192 p.Conference Proceedings

The complexity of approximating a nonlinear programBELLARE, M; ROGAWAY, P.Mathematical programming. 1995, Vol 69, Num 3, pp 429-441, issn 0025-5610Article

Succinct iterative characterizations of primitive computable unary functionsMAZZANTI, S.Information processing letters. 1995, Vol 56, Num 6, pp 315-319, issn 0020-0190Article

Constructing exactly conservative scheme in a non-conservative formTANAKA, R; NAKAMURA, T; YABE, T et al.Computer physics communications. 2000, Vol 126, Num 3, pp 232-243, issn 0010-4655Article

Computation of photoelectron and Auger-electron diffraction. I. Preparation of input data for the cluster calculation PAD1CHEN, X; SALDIN, D. K.Computer physics communications. 1998, Vol 112, Num 1, pp 67-79, issn 0010-4655Article

On the relation between BDDs and FDDsBECKER, B; DRECHSLER, R; WERCHNER, R et al.Information and computation (Print). 1995, Vol 123, Num 2, pp 185-197, issn 0890-5401Article

The physics of informationPLENIO, M. B.Contemporary physics. 2001, Vol 42, Num 4, pp 251-253, issn 0010-7514Article

  • Page / 571