Sylvie Hamel

Orcid: 0000-0002-8941-2284

Affiliations:
  • Université de Montréal, Canada


According to our database1, Sylvie Hamel authored at least 43 papers between 2000 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Consensus task interaction trace recommender to guide developers' software navigation.
Empir. Softw. Eng., November, 2024

Optimal Majority Rules and Quantitative Condorcet Properties of Setwise Kemeny Voting Schemes.
Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, 2024

2023
Space reduction techniques for the 3-wise Kemeny problem.
CoRR, 2023

2021
Automedian sets of permutations: direct sum and shuffle.
Theor. Comput. Sci., 2021

2020
Space reduction constraints for the median of permutations problem.
Discret. Appl. Math., 2020

Order in Chaos: Prioritizing Mobile App Reviews using Consensus Algorithms.
Proceedings of the 44th IEEE Annual Computers, Software, and Applications Conference, 2020

2019
Unshuffling Permutations: Trivial Bijections and Compositions.
Proceedings of the Theory and Applications of Models of Computation, 2019

2018
Exploring the median of permutations problem.
J. Discrete Algorithms, 2018

Median of 3 Permutations, 3-Cycles and 3-Hitting Set Problem.
Proceedings of the Combinatorial Algorithms - 29th International Workshop, 2018

Nearest constrained circular words.
Proceedings of the Annual Symposium on Combinatorial Pattern Matching, 2018

2017
Heuristic, Branch-and-Bound Solver and Improved Space Reduction for the Median of Permutations Problem.
Proceedings of the Combinatorial Algorithms - 28th International Workshop, 2017

2016
Evaluating the impact of design pattern and anti-pattern dependencies on changes and faults.
Empir. Softw. Eng., 2016

Medians of Permutations: Building Constraints.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2016

2015
Rank aggregation with ties: Experiments and Analysis.
Proc. VLDB Endow., 2015

2014
Detecting asynchrony and dephase change patterns by mining software repositories.
J. Softw. Evol. Process., 2014

2013
Analysing Anti-patterns Static Relationships with Design Patterns.
Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2013

Mining the relationship between anti-patterns dependencies and fault-proneness.
Proceedings of the 20th Working Conference on Reverse Engineering, 2013

On the Relationship between Program Evolution and Fault-Proneness: An Empirical Study.
Proceedings of the 17th European Conference on Software Maintenance and Reengineering, 2013

2012
An Efficient Method for Exploring the Space of Gene Tree/Species Tree Reconciliations in a Probabilistic Framework.
IEEE ACM Trans. Comput. Biol. Bioinform., 2012

An Algorithmic View on Multi-Related-Segments: A Unifying Model for Approximate Common Interval.
Proceedings of the Theory and Applications of Models of Computation, 2012

ADvISE: Architectural Decay in Software Evolution.
Proceedings of the 16th European Conference on Software Maintenance and Reengineering, 2012

2011
A new algorithm for aligning nested arc-annotated sequences under arbitrary weight schemes.
Theor. Comput. Sci., 2011

An Exploratory Study of Macro Co-changes.
Proceedings of the 18th Working Conference on Reverse Engineering, 2011

Using Medians to Generate Consensus Rankings for Biological Data.
Proceedings of the Scientific and Statistical Database Management, 2011

Using Kendall-τ Meta-Bagging to Improve Protein-Protein Docking Predictions.
Proceedings of the Pattern Recognition in Bioinformatics, 2011

Change Impact Analysis: An Earthquake Metaphor.
Proceedings of the 19th IEEE International Conference on Program Comprehension, 2011

A seismology-inspired approach to study change propagation.
Proceedings of the IEEE 27th International Conference on Software Maintenance, 2011

2010
Identification of design motifs with pattern matching algorithms.
Inf. Softw. Technol., 2010

Comparing RNA Structures with Biologically Relevant Operations Cannot Be Done without Strong Combinatorial Restrictions.
Proceedings of the WALCOM: Algorithms and Computation, 4th International Workshop, 2010

IDS: An Immune-Inspired Approach for the Detection of Software Design Smells.
Proceedings of the Quality of Information and Communications Technology, 2010

2009
Space of Gene/Species Trees Reconciliations and Parsimonious Models.
J. Comput. Biol., 2009

2008
Comparing RNA structures using a full set of biologically relevant edit operations is intractable
CoRR, 2008

Algorithms for Exploring the Space of Gene Tree/Species Tree Reconciliations.
Proceedings of the Comparative Genomics, International Workshop, 2008

2007
A New and Faster Method of Sorting by Transpositions.
Proceedings of the Combinatorial Pattern Matching, 18th Annual Symposium, 2007

2006
A Study of Some Easily Parallellizable Automata.
Proceedings of the 2006 Joint Conference on Information Sciences, 2006

Efficient Identification of Design Patterns with Bit-vector Algorithm.
Proceedings of the 10th European Conference on Software Maintenance and Reengineering (CSMR 2006), 2006

2005
An Edit Distance Between RNA Stem-Loops.
Proceedings of the String Processing and Information Retrieval, 2005

2004
From cascade decompositions to bit-vector algorithms.
Theor. Comput. Sci., 2004

On The Palindromic Complexity Of Infinite Words.
Int. J. Found. Comput. Sci., 2004

2002
Vector Algorithms for Approximate String Matching.
Int. J. Found. Comput. Sci., 2002

2001
Cascade Decompositions are Bit-Vector Algorithms.
Proceedings of the Implementation and Application of Automata, 2001

2000
Intersection of modules related to Macdonald's polynomials.
Discret. Math., 2000

Fast Implementations of Automata Computations.
Proceedings of the Implementation and Application of Automata, 2000


  Loading...