Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
7
click to vote
RTA
2010
Springer
favorite
Email
discuss
report
114
views
Theoretical Computer Science
»
more
RTA 2010
»
An Efficient Nominal Unification Algorithm
13 years 8 months ago
Download
www.iiia.csic.es
Jordi Levy, Mateu Villaret
Real-time Traffic
RTA 2010
|
Theoretical Computer Science
|
claim paper
Related Content
»
Equivariant Unification
»
Nominal Unification by Recursive Descent with Triangular Substitutions
»
MemoryEfficient and ThreadSafe QuasiDestructive Graph Unification
»
Supporting and Optimizing Full Unification in a Forward Chaining Rule System
»
Structure Sharing Problem And Its Solution In Graph Unification
»
A GrammarBased Unification of Several Alignment and Folding Algorithms
»
Antiunification Algorithms and Their Applications in Program Analysis
»
Efficient skyline querying with variable user preferences on nominal attributes
»
Numbering matters firstorder canonical forms for secondorder recursive types
more »
Post Info
More Details (n/a)
Added
16 Aug 2010
Updated
16 Aug 2010
Type
Conference
Year
2010
Where
RTA
Authors
Jordi Levy, Mateu Villaret
Comments
(0)
Researcher Info
Theoretical Computer Science Study Group
Computer Vision