• Search: "ACM: F.: Theory of Computation"

Showing 221 - 240 of 1,805

221

Forcing MSO on Infinite Words in Weak MSO
Riba, Colin ; Laboratoire de l'Informatique du Parallélisme (LIP) ; École normale supérieure de Lyon (ENS de Lyon) ; et al.
28th Annual ACM/IEEE Symposium on Logic in Computer Science. :448-457

New Orleans, United Stat... Monadic Second Order Log... Forcing Buchi automata McNaughton Theorem Feferman-Vaught Composit... …
Conference
Save to List
222

A Homotopical Completion Procedure with Applications to Coherence of Monoids
Guiraud, Yves ; Malbos, Philippe ; Mimram, Samuel ; et al.
RTA - 24th International Conference on Rewriting Techniques and Applications - 2013. :223-238

Eindhoven, Netherlands higher-dimensional rewri... presentation of monoid Knuth-Bendix completion Tietze transformation low-dimensional homotopy... …
Conference
Save to List
223

Unifying Nominal Unification
Calvès, Christophe ; Formal islands: foundations and applications (PAREO) ; Centre Inria de l'Université de Lorraine ; et al.
RTA 2013 - 24th International Conference on Rewriting Techniques and Applications. :143-157

Eindhoven, Netherlands ACM: F.: Theory of Compu... F.4: MATHEMATICAL LOGIC... F.4.2: Grammars and Othe... F.4.2.0: Decision proble... [INFO.INFO-FL]Computer S... …
Conference
Save to List
224

The Abstract Domain of Segmented Ranking Functions
Urban, Caterina ; Abstract Interpretation and Static Analysis (ABSTRACTION) ; Département d'informatique - ENS-PSL (DI-ENS) ; et al.
Static Analysis. :43-62

Seattle, United States ACM: D.: Software D.2: SOFTWARE ENGINEERIN... D.2.4: Software Program Verification D.2.4.3: Formal methods …
Conference
Save to List
225

An explicit formula for the intersection of two polynomials of regular languages
Pin, Jean-Eric ; Laboratoire d'informatique Algorithmique : Fondements et Applications (LIAFA) ; Université Paris Diderot - Paris 7 (UPD7)-Centre National de la Recherche Scientifique (CNRS) ; et al.
Developments in Language Theory. :31-45

Champs sur Marne, France Regular language intersection polynomial closure MSC 68Q70, 68R15 ACM: F.: Theory of Compu... …
Conference
Save to List
226

Approximating Multidimensional Subset Sum and the Minkowski Decomposition of Polygons
Emiris, Ioannis, Z. ; Karasoulou, Anna ; Tzovas, Charilaos ; et al.
Mathematics in Computer Science. 11:35-48

ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo... ACM: G.: Mathematics of... G.2: DISCRETE MATHEMATIC... G.2.1: Combinatorics …
Journal
Save to List
227

Verification of population protocols
Esparza, Javier ; Ganty, Pierre ; Leroux, Jérôme ; et al.
Acta Informatica. 54(2):191-215

ACM: C.: Computer System... C.2: COMPUTER-COMMUNICAT... C.2.2: Network Protocols ACM: D.: Software D.2: SOFTWARE ENGINEERIN... D.2.4: Software …
Journal
Save to List
228

A Hybrid Linear Logic for Constrained Transition Systems
Despeyroux, Joelle ; Chaudhuri, Kaustuv ; Usage-centered design, analysis and improvement of information systems (AxIS) ; et al.
TYPES 2013 - 19th International Conference on Types for Proofs and Programs. :150-168

Toulouse, France adequacy focusing stochastic pi-calculus hybrid logic linear logic …
Conference
Save to List
229

Concurrent Flexible Reversibility
Lanese, Ivan ; Lienhardt, Michaël ; Mezzina, Claudio, Antares ; et al.
22nd European Symposium on Programming. :370-390

Rome, Italy ACM: F.: Theory of Compu... ACM: D.: Software D.3: PROGRAMMING LANGUAG... D.3.3: Language Construc... D.3.3.2: Concurrent prog... …
Conference
Save to List
230

Some mathematical remarks on the polynomial selection in NFS
Barbulescu, Razvan ; Lachand, Armand ; Cryptology, arithmetic : algebraic methods for better algorithms (CARAMBA) ; et al.
Mathematics of Computation. 86:397-418

ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo... [INFO.INFO-CR]Computer S... Cryptography and Securit... [MATH.MATH-NT]Mathematic... …
Journal
Save to List
231

Accurate self-correction of errors in long reads using de Bruijn graphs
Salmela, Leena ; Walve, Riku ; Rivals, Eric ; et al.
Bioinformatics. 33(6):799-806

substitution Sequence analysis PacBio DNA NGS de Bruijn …
Journal
Save to List
232

A Penalized Best-Response Algorithm for Non-Linear Single-Path Routing Problems
Brun, Olivier ; Prabhu, Balakrishna ; Vallet, Josselin ; et al.
Networks. 69(1):52-66

Approximation algorithms best response single-path routing game theory non-linear programming Nash equilibrium …
Journal
Save to List
233

Leader election on two-dimensional periodic cellular automata
Bacquey, Nicolas ; Equipe AMACC - Laboratoire GREYC - UMR6072 ; Groupe de Recherche en Informatique, Image et Instrumentation de Caen (GREYC) ; et al.
Theoretical Computer Science. 659:36-52

uniform computation equivalence classes cellular automata leader election bi-periodical configurat... ACM: F.: Theory of Compu... …
Journal
Save to List
234

Periodicity in optimal hierarchical checkpointing schemes for adjoint computations
Aupy, Guillaume ; Herrmann, Julien ; Topology-Aware System-Scale Data Management for High-Performance Computing (TADAAM) ; et al.
Optimization Methods and Software. 32(3):594-624

Automatic differentiatio... Program reversal Adjoint computation Checkpointing Asymptotic optimality Online …
Journal
Save to List
235

Proper Hamiltonian Cycles in Edge-Colored Multigraphs
Águeda, Raquel ; Borozan, Valentin ; Díaz, Raquel ; et al.
Discrete Mathematics. 340(8):1897-1902

ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... ACM: G.: Mathematics of... [INFO.INFO-DM]Computer S... Discrete Mathematics [cs... [INFO.INFO-DS]Computer S... …
Journal
Save to List
236

Ambivalent Types for Principal Type Inference with GADTs
Garrigue, Jacques ; Rémy, Didier ; Graduate School of Mathematics [Nagoya] ; et al.
APLAS 2013 - 11th Asian Symposium on Programming Languages and Systems. :257-272

Melbourne, Australia GADT Type Inference Prin... ACM: F.: Theory of Compu... F.3: LOGICS AND MEANINGS... F.3.3: Studies of Progra... F.3.3.4: Type structure …
Conference
Save to List
237

Compact Proof Certificates for Linear Logic
Chaudhuri, Kaustuv ; Proof search and reasoning with logic specifications (PARSIFAL) ; Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX) ; et al.
Second International Conference on Certified Programs and Proofs. :208-223

Kyoto, Japan sequent calculus deep inference proof certificates ACM: F.: Theory of Compu... F.4: MATHEMATICAL LOGIC... …
Conference
Save to List
238

LFP – A Logical Framework with External Predicates
Honsell, Furio ; Lenisa, Marina ; Liquori, Luigi ; et al.
7th International Workshop on Logical Frameworks and Meta-languages: Theory and Practice - LFMTP 2012. Copenhagen. :13-22

Copenhagen, Denmark Type theory Logical frameworks ACM: F.: Theory of Compu... F.3: LOGICS AND MEANINGS... F.3.1: Specifying and Ve... …
Conference
Save to List
239

Church-Rosser Properties of Normal Rewriting
Jouannaud, Jean-Pierre ; Li, Jian-Qi ; Formal Methods for Embedded Systems (FORMES) ; et al.
Computer Science Logic. :350-365

Fontainebleau, France abstract positional rewr... normal rewriting higher-order rewriting Church-Rosser property ACM: F.: Theory of Compu... …
Conference
Save to List
240

Parametricity in an Impredicative Sort
Keller, Chantal ; Lasson, Marc ; Types, Logic and computing (TYPICAL) ; et al.
CSL - 26th International Workshop/21st Annual Conference of the EACSL - 2012. :381-395

Fontainebleau, France Calculus of Inductive Co... parametricity impredicativity Coq universes …
Conference
Save to List
Search Tools: Get RSS Feed Email this Search Save Search

Filter