Pascal and Francis Bibliographic Databases

Help

Search results

Your search

is.\*:("TCSCDI")

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 7607

  • Page / 305
Export

Selection :

  • and

Approximating edge dominating set in dense graphsSCHMIED, Richard; VIEHMANN, Claus.Theoretical computer science. 2012, Vol 414, Num 1, pp 92-99, issn 0304-3975, 8 p.Article

A linear process-algebraic format with data for probabilistic automataKATOEN, Joost-Pieter; VAN DE POL, Jaco; STOELINGA, Mariëlle et al.Theoretical computer science. 2012, Vol 413, Num 1, pp 36-57, issn 0304-3975, 22 p.Article

A game-theoretic characterization of Boolean grammarsKOUNTOURIOTIS, Vassilis; NOMIKOS, Christos; RONDOGIANNIS, Panos et al.Theoretical computer science. 2011, Vol 412, Num 12-14, pp 1169-1183, issn 0304-3975, 15 p.Article

A new algorithm for aligning nested arc-annotated sequences under arbitrary weight schemesOUANGRAOUA, Aïda; GUIGNON, Valentin; HAMEL, Sylvie et al.Theoretical computer science. 2011, Vol 412, Num 8-10, pp 753-764, issn 0304-3975, 12 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

A simple and efficient Union-Find-Delete algorithmBEN-AMRAM, Amir; YOFFE, Simon.Theoretical computer science. 2011, Vol 412, Num 4-5, pp 487-492, issn 0304-3975, 6 p.Article

A subdivision method for computing nearest gcd with certificationCHEZE, Guillaume; GALLIGO, André; MOURRAIN, Bernard et al.Theoretical computer science. 2011, Vol 412, Num 35, pp 4493-4503, issn 0304-3975, 11 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

An exact algorithm for the Boolean connectivity problem for k-CNFMAKINO, Kazuhisa; TAMAKI, Suguru; YAMAMOTO, Masaki et al.Theoretical computer science. 2011, Vol 412, Num 35, pp 4613-4618, issn 0304-3975, 6 p.Article

An improved lower bound on the sensitivity complexity of graph propertiesXIAOMING SUN.Theoretical computer science. 2011, Vol 412, Num 29, pp 3524-3529, issn 0304-3975, 6 p.Article

Applications of dimensionality reduction and exponential sums to graph automorphismMANJUNATH, Madhusudan; SHARMA, Vikram.Theoretical computer science. 2011, Vol 412, Num 29, pp 3639-3649, issn 0304-3975, 11 p.Article

Büchi context-free languagesESIK, Zoltán; IVAN, Szabolcs.Theoretical computer science. 2011, Vol 412, Num 8-10, pp 805-821, issn 0304-3975, 17 p.Article

Comparing and aggregating partially resolved treesBANSAL, Mukul S; DONG, Jianrong; FERNANDEZ-BACA, David et al.Theoretical computer science. 2011, Vol 412, Num 48, pp 6634-6652, issn 0304-3975, 19 p.Article

Computing bond orders in molecule graphsBÖCKER, S; BUI, Q. B. A; TRUSS, A et al.Theoretical computer science. 2011, Vol 412, Num 12-14, pp 1184-1195, issn 0304-3975, 12 p.Article

Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphsHEGGERNES, Pinar; MEISTER, Daniel; PROSKUROWSKI, Andrzej et al.Theoretical computer science. 2011, Vol 412, Num 12-14, pp 1275-1297, issn 0304-3975, 23 p.Article

Dynamic FTSS in asynchronous systems: The case of unisonDUBOIS, Swan; POTOP-BUTUCARU, Maria; TIXEUIL, Sébastien et al.Theoretical computer science. 2011, Vol 412, Num 29, pp 3418-3439, issn 0304-3975, 22 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

Embedding two edge-disjoint Hamiltonian cycles into locally twisted cubesHUNG, Ruo-Wei.Theoretical computer science. 2011, Vol 412, Num 35, pp 4747-4753, issn 0304-3975, 7 p.Article

Equational tree transformationsBOZAPALIDIS, Symeon; FÜLÖP, Zoltán; RAHONIS, George et al.Theoretical computer science. 2011, Vol 412, Num 29, pp 3676-3692, issn 0304-3975, 17 p.Article

Equivalences for a biological process algebraGALPIN, Vashti.Theoretical computer science. 2011, Vol 412, Num 43, pp 6058-6082, issn 0304-3975, 25 p.Article

Evolutionary algorithms and dynamic programmingDOERR, Benjamin; EREMEEV, Anton; NEUMANN, Frank et al.Theoretical computer science. 2011, Vol 412, Num 43, pp 6020-6035, issn 0304-3975, 16 p.Article

Exact and approximate equilibria for optimal group network formationANSHELEVICH, Elliot; CASKURLU, Bugra.Theoretical computer science. 2011, Vol 412, Num 39, pp 5298-5314, issn 0304-3975, 17 p.Article

Expressive power of LL(k) Boolean grammarsOKHOTIN, Alexander.Theoretical computer science. 2011, Vol 412, Num 39, pp 5132-5155, issn 0304-3975, 24 p.Article

Fault-tolerant routing: k-inconnected many-to-one routing in wireless networksDEYING LI; YUEXUAN WANG; QINGHUA ZHU et al.Theoretical computer science. 2011, Vol 412, Num 3, pp 209-216, issn 0304-3975, 8 p.Article

Hardness of preorder checking for basic formalismsBOZZELLI, Laura; LEGAY, Axel; PINCHINAT, Sophie et al.Theoretical computer science. 2011, Vol 412, Num 49, pp 6795-6808, issn 0304-3975, 14 p.Article

  • Page / 305