Pascal and Francis Bibliographic Databases

Help

Search results

Your search

cc.\*:("001D02A08")

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 6385

  • Page / 256
Export

Selection :

  • and

Accepting splicing systems with permitting and forbidding wordsARROYO, Fernando; CASTELLANOS, Juan; DASSOW, Jürgen et al.Acta informatica. 2013, Vol 50, Num 1, pp 1-14, issn 0001-5903, 14 p.Article

New proof for the undecidability of the circular PCPHALAVA, Vesa; HARJU, Tero.Acta informatica. 2013, Vol 50, Num 5-6, pp 331-341, issn 0001-5903, 11 p.Article

Distinguishing and relating higher-order and first-order processes by expressivenessXIAN XU.Acta informatica. 2012, Vol 49, Num 7-8, pp 445-484, issn 0001-5903, 40 p.Article

Prefix-primitive annihilators of languages under some operationsFAN, Chen-Ming; HUANG, Cheng-Chih; CHRISTINE CHIFEN TSENG et al.Acta informatica. 2012, Vol 49, Num 5, pp 281-293, issn 0001-5903, 13 p.Article

A COUNTEREXAMPLE TO STRONG PARALLEL REPETITION : Foundation of Computer ScienceRAZ, Ran.SIAM journal on computing (Print). 2011, Vol 40, Num 3, pp 771-777, issn 0097-5397, 7 p.Article

A NEAR-OPTIMAL SEPARATION OF REGULAR AND GENERAL RESOLUTIONURQUHART, Alasdair.SIAM journal on computing (Print). 2011, Vol 40, Num 1, pp 107-121, issn 0097-5397, 15 p.Article

A note on an identity-based ring signature scheme with signer verifiabilityJUNG YEON HWANG.Theoretical computer science. 2011, Vol 412, Num 8-10, pp 796-804, issn 0304-3975, 9 p.Article

Abelian complexity of infinite words associated with quadratic Parry numbersBALKOVA, L'ubomíra; BRINDA, Karel; TUREK, Ondřej et al.Theoretical computer science. 2011, Vol 412, Num 45, pp 6252-6260, issn 0304-3975, 9 p.Article

Automated verification and refinement for physical-layer protocolsBROWN, Geoffrev M; PIKE, Lee.Formal aspects of computing. 2011, Vol 23, Num 3, pp 243-266, issn 0934-5043, 24 p.Article

Efficient traceable signatures in the standard modelLIBERT, Benoît; YUNG, Moti.Theoretical computer science. 2011, Vol 412, Num 12-14, pp 1220-1242, issn 0304-3975, 23 p.Article

From control law diagrams to Ada via CircusCAVALCANTI, Ana; CLAYTON, Phil; O'HALLORAN, Colin et al.Formal aspects of computing. 2011, Vol 23, Num 4, pp 465-512, issn 0934-5043, 48 p.Article

On the superimposition of Christoffel wordsPAQUIN, Geneviève; REUTENAUER, Christophe.Theoretical computer science. 2011, Vol 412, Num 4-5, pp 402-418, issn 0304-3975, 17 p.Article

Popular matchings with variable item copiesKAVITHA, Telikepalli; NASRE, Meghana.Theoretical computer science. 2011, Vol 412, Num 12-14, pp 1263-1274, issn 0304-3975, 12 p.Article

Restricted ambiguity of erasing morphismsREIDENBACH, Daniel; SCHNEIDER, Johannes C.Theoretical computer science. 2011, Vol 412, Num 29, pp 3510-3523, issn 0304-3975, 14 p.Article

Return time complexity of Sturmian sequencesHAN KIM, Dong.Theoretical computer science. 2011, Vol 412, Num 29, pp 3413-3417, issn 0304-3975, 5 p.Article

VDM semantics of programming languages: combinators and monadsMOSSES, Peter D.Formal aspects of computing. 2011, Vol 23, Num 2, pp 221-238, issn 0934-5043, 18 p.Article

TERRAIN GUARDING IS NP-HARDKING, James; KROHN, Erik.SIAM journal on computing (Print). 2011, Vol 40, Num 5, pp 1316-1339, issn 0097-5397, 24 p.Article

THE CYCLICITY PROBLEM FOR THE IMAGES OF Q-RATIONAL SERIESHONKALA, Juha.Informatique théorique et applications (Imprimé). 2011, Vol 45, Num 4, pp 375-381, issn 0988-3754, 7 p.Article

ICTCS 09Informatique théorique et applications (Imprimé). 2011, Vol 45, Num 1, issn 0988-3754, 181 p.Conference Proceedings

Algorithmic Learning Theory 5ALT 2009LUGOSI, Gábor; ZILLES, Sandra.Theoretical computer science. 2011, Vol 412, Num 19, issn 0304-3975, 100 p.Serial Issue

Selected Papers from the 7th International Conference on Computational Methods in Systems BiologyDEGANO, Pierpaolo.Theoretical computer science. 2011, Vol 412, Num 21, issn 0304-3975, 128 p.Serial Issue

Combinatorics on Words (WORDS 2009)CARPI, Arturo; DE FELICE, Clelia.Theoretical computer science. 2011, Vol 412, Num 27, issn 0304-3975, 126 p.Serial Issue

An algorithmic framework for network reconstructionDURZINSKY, Markus; WAGLER, Annegret; WEISMANTEL, Robert et al.Theoretical computer science. 2011, Vol 412, Num 26, pp 2800-2815, issn 0304-3975, 16 p.Article

Algorithms and ComputationDU, Ding-Zhu; DONG, Yingfei; ZHANG, Zhao et al.Theoretical computer science. 2011, Vol 412, Num 32, issn 0304-3975, 155 p.Conference Proceedings

Stabilization, Safety, and Security of Distributed Systems (SSS 2009)DATTA, Ajoy K; PETIT, Franck; GUERRAOUI, Rachid et al.Theoretical computer science. 2011, Vol 412, Num 33, issn 0304-3975, 147 p.Conference Proceedings

  • Page / 256