The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Mauricio Ayala-Rincón: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Carlos Morra, Jürgen Becker, Mauricio Ayala-Rincón, Reiner W. Hartenstein
    FELIX: Using Rewriting-Logic for Generating Functionally Equivalent Implementations. [Citation Graph (0, 0)][DBLP]
    FPL, 2005, pp:25-30 [Conf]
  2. Azzedine Boukerche, Alba Cristina Magalhaes Alves de Melo, Mauricio Ayala-Rincón, Thomas Mailleux Santana
    Parallel Strategies for Local Biological Sequence Alignment in a Cluster of Workstations. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2005, pp:- [Conf]
  3. Flávio L. C. de Moura, Fairouz Kamareddine, Mauricio Ayala-Rincón
    Second-Order Matching via Explicit Substitutions. [Citation Graph (0, 0)][DBLP]
    LPAR, 2004, pp:433-448 [Conf]
  4. Mauricio Ayala-Rincón, Fairouz Kamareddine
    Unification via se-style of explicit substitution. [Citation Graph (0, 0)][DBLP]
    PPDP, 2000, pp:163-174 [Conf]
  5. Mauricio Ayala-Rincón, Thomas Mailleux Santana
    SAEPTUM: verification of ELAN hardware specifications using the proof assistant PVS. [Citation Graph (0, 0)][DBLP]
    SBCCI, 2006, pp:125-130 [Conf]
  6. Mauricio Ayala-Rincón, Ricardo P. Jacobi, Luis G. A. Carvalho, Carlos H. Llanos, Reiner W. Hartenstein
    Modeling and prototyping dynamically reconfigurable systems for efficient computation of dynamic programming methods by rewriting-logic. [Citation Graph (0, 0)][DBLP]
    SBCCI, 2004, pp:248-253 [Conf]
  7. Daniel M. Muñoz, Carlos H. Llanos, Mauricio Ayala-Rincón, Rudi van Els, Renato P. Almeida
    Implementation of dispatching algorithms for elevator systems using reconfigurable architectures. [Citation Graph (0, 0)][DBLP]
    SBCCI, 2006, pp:32-37 [Conf]
  8. Mauricio Ayala-Rincón, Rodrigo B. Nogueira, Carlos H. Llanos, Ricardo P. Jacobi, Reiner W. Hartenstein
    Modeling a Reconfigurable System for Computing the FFT in Place via Rewriting-Logic. [Citation Graph (0, 0)][DBLP]
    SBCCI, 2003, pp:205-210 [Conf]
  9. Luiz M. R. Gadelha Jr., Mauricio Ayala-Rincón
    An Efficient Strategy for Word-Cycle Completion in Finitely Presented Groups. [Citation Graph (0, 0)][DBLP]
    SCCC, 2001, pp:80-85 [Conf]
  10. Mauricio Ayala-Rincón, Rodrigo B. Nogueira, Carlos H. Llanos, Ricardo P. Jacobi, Reiner W. Hartenstein
    Efficient Computation of Algebraic Operations over Dynamically Reconfigurable Systems Specified by Rewriting-Logic Environments. [Citation Graph (0, 0)][DBLP]
    SCCC, 2003, pp:60-0 [Conf]
  11. Mauricio Ayala-Rincón, Paulo D. Conejo
    A Linear Time Lower Bound on Updating Algorithms for Suffix Trees. [Citation Graph (0, 0)][DBLP]
    SPIRE, 1998, pp:1-6 [Conf]
  12. Azzedine Boukerche, Alba Cristina Magalhaes Alves de Melo, Mauricio Ayala-Rincón, Thomas Mailleux Santana
    Parallel Smith-Waterman Algorithm for Local DNA Comparison in a Cluster of Workstations. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:464-475 [Conf]
  13. Ricardo P. Jacobi, Mauricio Ayala-Rincón, Luis G. A. Carvalho, Carlos H. Llanos, Reiner W. Hartenstein
    Reconfigurable Systems for Sequence Alignment and for General Dynamic Programming. [Citation Graph (0, 0)][DBLP]
    WOB, 2004, pp:25-32 [Conf]
  14. Rodrigo de Castro Miranda, Mauricio Ayala-Rincón
    A Modification of the Landau-Vishkin Algorithm Computing Longest Common Extensions via Suffix Arrays. [Citation Graph (0, 0)][DBLP]
    BSB, 2005, pp:210-213 [Conf]
  15. Mauricio Ayala-Rincón, Paulo D. Conejo
    A Linear Time Lower Bound on McCreight and General Updating Algorithms for Suffix Trees. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2003, v:37, n:3, pp:233-241 [Journal]
  16. Mauricio Ayala-Rincón, Flávio L. C. de Moura, Fairouz Kamareddine
    Comparing and implementing calculi of explicit substitutions with eta-reduction. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2005, v:134, n:1, pp:5-41 [Journal]
  17. Mauricio Ayala-Rincón, Flávio L. C. de Moura, Fairouz Kamareddine
    Comparing Calculi of Explicit Substitutions with Eta-reduction. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2002, v:67, n:, pp:- [Journal]
  18. Mauricio Ayala-Rincón, Rinaldi Maya Neto, Ricardo P. Jacobi, Carlos H. Llanos, Reiner W. Hartenstein
    Applying ELAN Strategies in Simulating Processors over Simple Architectures. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2002, v:70, n:6, pp:- [Journal]
  19. Fairouz Kamareddine, François Monin, Mauricio Ayala-Rincón
    On automating the extraction of programs from proofs using product types. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2002, v:67, n:, pp:- [Journal]
  20. Mauricio Ayala-Rincón, Fairouz Kamareddine
    Unification via the lambda se-Style of Explicit Substitutions. [Citation Graph (0, 0)][DBLP]
    Logic Journal of the IGPL, 2001, v:9, n:4, pp:- [Journal]
  21. Mauricio Ayala-Rincón, Alexsandro F. da Fonseca, Haydée Werneck Poubel, José de Siqueira
    A framework to visualize equivalences between computational models of regular languages. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:84, n:1, pp:5-16 [Journal]
  22. Mauricio Ayala-Rincón, Bruno T. de Abreu, José de Siqueira
    A variant of the Ford-Johnson algorithm that is more space efficient. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:102, n:5, pp:201-207 [Journal]
  23. Flávio L. C. de Moura, Mauricio Ayala-Rincón, Fairouz Kamareddine
    SUBSEXPL: a tool for simulating and comparing explicit substitutions calculi. [Citation Graph (0, 0)][DBLP]
    Journal of Applied Non-Classical Logics, 2006, v:16, n:1-2, pp:119-150 [Journal]
  24. Azzedine Boukerche, Alba Cristina Magalhaes Alves de Melo, Mauricio Ayala-Rincón, Maria Emilia Telles Walter
    Parallel strategies for the local biological sequence alignment in a cluster of workstations. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2007, v:67, n:2, pp:170-185 [Journal]
  25. Mauricio Ayala-Rincón, Ivan E. Tavares Araújo
    Unification Modulo Presburger Arithmetic and Other Decidable Theories. [Citation Graph (0, 0)][DBLP]
    Revista Comlombiana de Computación, 2001, v:2, n:2, pp:- [Journal]
  26. Mauricio Ayala-Rincón, Reiner W. Hartenstein, Rinaldi Maya Neto, Ricardo P. Jacobi, Carlos H. Llanos
    Architectural Specification, Exploration and Simulation Through Rewriting-Logic. [Citation Graph (0, 0)][DBLP]
    Revista Comlombiana de Computación, 2002, v:3, n:2, pp:- [Journal]
  27. Mauricio Ayala-Rincón, César Muñoz
    Explicit Substitions and All That. [Citation Graph (0, 0)][DBLP]
    Revista Comlombiana de Computación, 2000, v:1, n:1, pp:47-71 [Journal]
  28. Fairouz Kamareddine, François Monin, Mauricio Ayala-Rincón
    On Automating the Extraction of Programs from Termination Proofs. [Citation Graph (0, 0)][DBLP]
    Revista Comlombiana de Computación, 2003, v:4, n:2, pp:- [Journal]
  29. Mauricio Ayala-Rincón, Carlos H. Llanos, Ricardo P. Jacobi, Reiner W. Hartenstein
    Prototyping time- and space-efficient computations of algebraic operations over dynamically reconfigurable systems modeled by rewriting-logic. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Design Autom. Electr. Syst., 2006, v:11, n:2, pp:251-281 [Journal]
  30. André L. Galdino, César Muñoz, Mauricio Ayala-Rincón
    Formal Verification of an Optimal Air Traffic Conflict Resolution and Recovery Algorithm. [Citation Graph (0, 0)][DBLP]
    WoLLIC, 2007, pp:177-188 [Conf]
  31. Azzedine Boukerche, Alba Cristina Magalhaes Alves de Melo, Edans Flavius de Oliveira Sandes, Mauricio Ayala-Rincón
    An exact parallel algorithm to compare very long biological sequences in clusters of workstations. [Citation Graph (0, 0)][DBLP]
    Cluster Computing, 2007, v:10, n:2, pp:187-202 [Journal]

  32. Principal Typings for Explicit Substitutions Calculi. [Citation Graph (, )][DBLP]


  33. Hardware Architecture for Particle Swarm Optimization Using Floating-Point Arithmetic. [Citation Graph (, )][DBLP]


  34. Parameterizable floating-point library for arithmetic operations in FPGAs. [Citation Graph (, )][DBLP]


  35. Intersection Type Systems and Explicit Substitutions Calculi. [Citation Graph (, )][DBLP]


  36. Reduction of the Intruder Deduction Problem into Equational Elementary Deduction for Electronic Purse Protocols with Blind Signatures. [Citation Graph (, )][DBLP]


  37. Verification of the Completeness of Unification Algorithms à la Robinson. [Citation Graph (, )][DBLP]


  38. Using Rewriting-Logic Notation for Funcional Verification in Data-Stream Based Reconfigurable Computing. [Citation Graph (, )][DBLP]


  39. A Theory for Abstract Reduction Systems in PVS. [Citation Graph (, )][DBLP]


  40. Principal Typings in a Restricted Intersection Type System for Beta Normal Forms with De Bruijn Indices [Citation Graph (, )][DBLP]


  41. Preface. [Citation Graph (, )][DBLP]


  42. A PVS Theory for Term Rewriting Systems. [Citation Graph (, )][DBLP]


  43. Preface. [Citation Graph (, )][DBLP]


Search in 0.022secs, Finished in 0.025secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002