Skip to content

Guillem Godoy

Publication record assembled from the DBLP archive of ranked conferences.

Papers indexed

20

Venues

12

Active years

1999–2014

Best venue rank

A*

Where they publish

Papers

20 indexed papers, newest first.

YearVenueTitleAuthors
2014SATAutomatic Evaluation of Reductions between NP-Complete Problems.Carles Creus, Pau Fernndez, Guillem Godoy
2012LICSThe HOM Problem is EXPTIME-Complete.Carles Creus, Adri Gascn, Guillem Godoy, Lander Ramos
2011CSEDULearning Theory through Videos - A Teaching Experience in a Theoretical Course based on Self-learning Videos and Problem-solving Sessions.Marta Arias, Carles Creus, Adri Gascn, Guillem Godoy
2010LICSThe Emptiness Problem for Tree Automata with Global Constraints.Luis Bargu, Carles Creus, Guillem Godoy, Florent Jacquemard, Camille Vacher
2010STOCThe HOM problem is decidable.Guillem Godoy, Omer Gimnez, Lander Ramos, Carme lvarez
2009LICSNon-linear Rewrite Closure and Weak Normalization.Carles Creus, Guillem Godoy, Francesc Massanes, Ashish Tiwari
2009SASInvariant Checking for Programs with Procedure Calls.Guillem Godoy, Ashish Tiwari
2008FOSSACSClasses of Tree Homomorphisms with Decidable Preservation of Regularity.Guillem Godoy, Sebastian Maneth, Sophie Tison
2008LICSContext Matching for Compressed Terms.Adri Gascn, Guillem Godoy, Manfred Schmidt-Schau
2007CADEOn the Normalization and Unique Normalization Properties of Term Rewrite Systems.Guillem Godoy, Sophie Tison
2005CADETermination of Rewrite Systems with Shallow Right-Linear, Collapsing, and Right-Ground Rules.Guillem Godoy, Ashish Tiwari
2005CSLConfluence of Shallow Right-Linear Rewrite Systems.Guillem Godoy, Ashish Tiwari
2005LPARRecursive Path Orderings Can Also Be Incremental.Mirtha-Lina Fernndez, Guillem Godoy, Albert Rubio
2004CADEDeciding Fundamental Properties of Right-(Ground or Variable) Rewrite Systems by Rewrite Closure.Guillem Godoy, Ashish Tiwari
2003STACSOn the Confluence of Linear Shallow Term Rewrite Systems.Guillem Godoy, Ashish Tiwari, Rakesh M. Verma
2001FOCSThe Confluence of Ground Term Rewrite Systems is Decidable in Polynomial Time.Hubert Comon, Guillem Godoy, Robert Nieuwenhuis
2001ICALPOn the Completeness of Arbitrary Selection Strategies for Paramodulation.Miquel Bofill, Guillem Godoy
2001LICSOn Ordering Constraints for Deduction with Built-In Abelian Semigroups, Monoids and Groups.Guillem Godoy, Robert Nieuwenhuis
2000LICSParamodulation with Built-in Abelian Groups.Guillem Godoy, Robert Nieuwenhuis
1999LICSParamodulation with Non-Monotonic Orderings.Miquel Bofill, Guillem Godoy, Robert Nieuwenhuis, Albert Rubio