Pascal-Francis CNRS

Pascal and Francis Bibliographic Databases

Help

Search results

Your search

is.\*:("INFCEC")

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

Origin

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

Results 1 to 25 of 1751

  • Page / 71
Export

Selection :

  • and

A black box for online approximate pattern matchingCLIFFORD, Raphael; EFREMENKO, Klim; PORAT, Benny et al.Information and computation (Print). 2011, Vol 209, Num 4, pp 731-736, issn 0890-5401, 6 p.Article

Reactive automataCROCHEMORE, Maxime; GABBAY, Dov M.Information and computation (Print). 2011, Vol 209, Num 4, pp 692-704, issn 0890-5401, 13 p.Article

Two-way unary automata versus logarithmic spaceGEFFERT, Viliam; PIGHIZZINI, Giovanni.Information and computation (Print). 2011, Vol 209, Num 7, pp 1016-1025, issn 0890-5401, 10 p.Article

Unprovability of the logical characterization of bisimulationTERRAF, Pedro Sanchez.Information and computation (Print). 2011, Vol 209, Num 7, pp 1048-1056, issn 0890-5401, 9 p.Article

Infinitary Combinatory Reduction SystemsKETEMA, Jeroen; SIMONSEN, Jakob Grue.Information and computation (Print). 2011, Vol 209, Num 6, pp 893-926, issn 0890-5401, 34 p.Article

Probabilistic coherence spaces as a model of higher-order probabilistic computationDANOS, Vincent; EHRHARD, Thomas.Information and computation (Print). 2011, Vol 209, Num 6, pp 966-991, issn 0890-5401, 26 p.Article

Unbounded-error quantum computation with small space boundsYAKARYILMAZ, Abuzer; CEM SAY, A. C.Information and computation (Print). 2011, Vol 209, Num 6, pp 873-892, issn 0890-5401, 20 p.Article

Intuitionistic Modal Logic and Applications (IMLA 2008)DE PAIVA, Valeria; PIENTKA, Brigitte.Information and computation (Print). 2011, Vol 209, Num 12, issn 0890-5401, 103 p.Serial Issue

Sequent calculi and decidability for intuitionistic hybrid logicGALMICHE, Didier; SALHI, Yakoub.Information and computation (Print). 2011, Vol 209, Num 12, pp 1447-1463, issn 0890-5401, 17 p.Article

Constructive linear-time temporal logic: Proof systems and Kripke semanticsKOJIMA, Kensuke; IGARASHI, Atsushi.Information and computation (Print). 2011, Vol 209, Num 12, pp 1491-1503, issn 0890-5401, 13 p.Article

A classification of the expressive power of well-structured transition systemsAZIZ ABDULLA, Parosh; DELZANNO, Giorgio; VAN BEGIN, Laurent et al.Information and computation (Print). 2011, Vol 209, Num 3, pp 248-279, issn 0890-5401, 32 p.Conference Paper

Descriptional and computational complexity of finite automata—A surveyHOLZER, Markus; KUTRIB, Martin.Information and computation (Print). 2011, Vol 209, Num 3, pp 456-470, issn 0890-5401, 15 p.Conference Paper

Efficiency of the symmetry bias in grammar acquisitionMATOBA, Ryuichi; NAKAMURA, Makoto; TOJO, Satoshi et al.Information and computation (Print). 2011, Vol 209, Num 3, pp 536-547, issn 0890-5401, 12 p.Conference Paper

Finite identification from the viewpoint of epistemic updateDEGREMONT, Cedric; GIERASIMCZUK, Nina.Information and computation (Print). 2011, Vol 209, Num 3, pp 383-396, issn 0890-5401, 14 p.Conference Paper

Model-checking games for fixpoint logics with partial order modelsGUTIERREZ, Julian; BRADFIELD, Julian.Information and computation (Print). 2011, Vol 209, Num 5, pp 766-781, issn 0890-5401, 16 p.Conference Paper

Teaching randomized learners with feedbackBALBACH, Frank J; ZEUGMANN, Thomas.Information and computation (Print). 2011, Vol 209, Num 3, pp 296-319, issn 0890-5401, 24 p.Conference Paper

An efficient simulation algorithm based on abstract interpretationRANZATO, Francesco; TAPPARO, Francesco.Information and computation (Print). 2010, Vol 208, Num 1, pp 1-22, issn 0890-5401, 22 p.Article

Bad news on decision problems for patternsFREYDENBERGER, Dominik D; REIDENBACH, Daniel.Information and computation (Print). 2010, Vol 208, Num 1, pp 83-96, issn 0890-5401, 14 p.Article

Effective symbolic dynamics, random points, statistical behavior, complexity and entropyGALATOLO, Stefano; HOYRUP, Mathieu; ROJAS, Cristóbal et al.Information and computation (Print). 2010, Vol 208, Num 1, pp 23-41, issn 0890-5401, 19 p.Article

The expressive power of the shuffle productBERSTEL, Jean; BOASSON, Luc; CARTON, Olivier et al.Information and computation (Print). 2010, Vol 208, Num 11, pp 1258-1272, issn 0890-5401, 15 p.Article

Complexity of deciding bisimilarity between normed BPA and normed BPPJANCAR, Petr; KNOT, Martin; SAWA, Zdenek et al.Information and computation (Print). 2010, Vol 208, Num 10, pp 1193-1205, issn 0890-5401, 13 p.Article

Deriving structural labelled transitions for mobile ambientsRATHKE, Julian; SOBOCINSKI, Paweł.Information and computation (Print). 2010, Vol 208, Num 10, pp 1221-1242, issn 0890-5401, 22 p.Article

Presenting functors on many-sorted varieties and applicationsKURZ, Alexander; PETRISAN, Daniela.Information and computation (Print). 2010, Vol 208, Num 12, pp 1421-1446, issn 0890-5401, 26 p.Conference Paper

Asynchronous sequential processesCAROMEL, Denis; HENRIO, Ludovic; SERPETTE, Bernard Paul et al.Information and computation (Print). 2009, Vol 207, Num 4, pp 459-495, issn 0890-5401, 37 p.Article

Improving the round complexity of VSS in point-to-point networksKATZ, Jonathan; KOO, Chiu-Yuen; KUMARESAN, Ranjit et al.Information and computation (Print). 2009, Vol 207, Num 8, pp 889-899, issn 0890-5401, 11 p.Article

  • Page / 71