Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Rafael Casas

dblp:75/658 · DBLP profile ↗
← Back
7ranked-venue papers
3as first author
0since 2021 · last 2019
0000-0002-7977-9840ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 6 · 3 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Robot manipulation · 100%
Theoretical computer science
2 papers
Algorithms and data structures · 94% Combinatorics and discrete mathematics · 6%

Topics — the 6 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Robotics › Robot manipulation › wearable robotics
exoskeleton
0.412019
An Elbow Exoskeleton for Upper Limb Rehabilitation With Series Elastic Actuator and Cable-Driven Differential · IEEE Trans. Robotics 2019
Robotics › Robot manipulation › medical robotics
rehabilitation robotics
0.412019
An Elbow Exoskeleton for Upper Limb Rehabilitation With Series Elastic Actuator and Cable-Driven Differential · IEEE Trans. Robotics 2019
Robotics › Robot manipulation › actuator design › compliant actuator
series elastic actuator
0.412019
An Elbow Exoskeleton for Upper Limb Rehabilitation With Series Elastic Actuator and Cable-Driven Differential · IEEE Trans. Robotics 2019
Algorithms and data structures › analysis of algorithms
average-case analysis
0.011992
On the Average Size of the Intersection of Binary Trees · SIAM J. Comput. 1992
Algorithms and data structures › data structure design › search structures › search trees
binary search trees
0.011992
On the Average Size of the Intersection of Binary Trees · SIAM J. Comput. 1992
Algorithms and data structures › analysis of algorithms
random trees
0.011991
Static on Random Trees · ICALP 1991

Methods — techniques the papers use, named apart from their topics

torque control · 0.4impedance control · 0.4integral equations · 0.0bessel functions · 0.0average-case analysis · 0.0
YearPublicationVenuePosition
2019 An Elbow Exoskeleton for Upper Limb Rehabilitation With Series Elastic Actuator and Cable-Driven Differential
abstract
Movement impairments resulting from neurologic injuries, such as stroke, can be treated with robotic exoskeletons that assist with movement retraining. Exoskeleton designs benefit from low impedance and accurate torque control. We designed a 2 degree-of-freedom tethered exoskeleton that can provide independent torque control on elbow flexion/extension and forearm supination/pronation. Two identical series elastic actuators (SEAs) are used to actuate the exoskeleton. The two SEAs are coupled through a novel cable-driven differential. The exoskeleton is compact and lightweight, with a mass of 0.9 kg. Applied RMS torque errors were less than 0.19 Nm. Benchtop tests demonstrated a torque rise time of approximately 0.1 s, a torque control bandwidth of 3.7 Hz and an impedance of less than 0.03 Nm/deg at 1 Hz. The controller can simulate a stable maximum wall stiffness of 0.45 Nm/deg. The overall performance is adequate for robotic therapy applications and the novelty of the design is discussed.
Tianyao Chen, Rafael Casas, Peter S. Lum
IEEE Trans. Robotics2
1993 Average-Case Analysis of Unification Algorithms
Luc Albert, Rafael Casas, François Fages
Theor. Comput. Sci.2
1993 Average-Case Analysis on Simple Families of Trees Using a Balanced Probability Model
Rafael Casas, Josep Díaz, Conrado Martínez
Theor. Comput. Sci.1
1992 On the Average Size of the Intersection of Binary Trees
abstract
The average-case analysis of algorithms for binary search trees yields very different results from those obtained under the uniform distribution. The analysis itself is more complex and replaces algebraic equations by integral equations. In this work this analysis is carried out for the computation of the average size of the intersection of two binary trees. The development of this analysis involves Bessel functions that appear in the solutions of partial differential equations, and the result has an average size of $O(n^{2\sqrt 2 - 2} /\sqrt {\log n} )$, contrasting with the size $O(1)$ obtained when considering a uniform distribution.
Ricardo Baeza-Yates, Rafael Casas, Josep Díaz, Conrado Martínez
SIAM J. Comput.2
1991 Static on Random Trees
Rafael Casas, Josep Díaz, Conrado Martínez
ICALP1
1991 Average Case Analysis of Unification Algorithms
Luc Albert, Rafael Casas, François Fages, A. Torrecillas, Paul Zimmermann 0001
STACS2
1989 Average-Case Analysis of Robinson's Unification Algorithm with Two Different Variables
Rafael Casas, Josep Díaz, Jean-Marc Steyaert
Inf. Process. Lett.1