Cristóbal Pareja-Flores

Orcid: 0000-0001-7739-0236

According to our database1, Cristóbal Pareja-Flores authored at least 30 papers between 1994 and 2022.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
A Spark Parallel Betweenness Centrality Computation and its Application to Community Detection Problems.
J. Univers. Comput. Sci., 2022

2019
Introducing MOOC-like methodologies in a face-to-face undergraduate course: a detailed case study.
Interact. Learn. Environ., 2019

2014
FLOP: A User-Friendly System for Automated Program Assessment.
J. Univers. Comput. Sci., 2014

Student perception and usage of an automated programming assessment tool.
Comput. Hum. Behav., 2014

2012
FLOP, a free laboratory of programming.
Proceedings of the 12th Koli Calling International Conference on Computing Education Research, 2012

2008
An approach to effortless construction of program animations.
Comput. Educ., 2008

A gentle introduction to mutual recursion.
Proceedings of the 13th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, 2008

Testing-Based Automatic Grading: A Proposal from Bloom's Taxonomy.
Proceedings of the 8th IEEE International Conference on Advanced Learning Technologies, 2008

2007
WinHIPE: an IDE for functional programming based on rewriting and visualization.
ACM SIGPLAN Notices, 2007

An Instructor's Guide to Design Web-Based Algorithm Animations.
Proceedings of the Advances in Web Based Learning, 2007

2005
Program Execution and Visualization on the Web.
Proceedings of the Encyclopedia of Information Science and Technology (5 Volumes), 2005

2002
A system to generate electronic books on programming exercises.
Electron. Libr., 2002

Approaches to comprehension-preserving graphical reduction of program visualizations.
Proceedings of the 2002 ACM Symposium on Applied Computing (SAC), 2002

Electronic books for programming education: a review and future prospects.
Proceedings of the 7th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, 2002

2001
Toward Friendly, Dialog-based Construction of Algorithm Visualizations and Animations.
Proceedings of the IASTED International Conference on Visualization, 2001

EXercita: automatic web publishing of programming exercises.
Proceedings of the 6th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, 2001

Adding Traces to a Lazy Monadic Evaluator.
Proceedings of the Computer Aided Systems Theory, 2001

EXercita. A System for Archiving and Publishing Programming Exercises.
Proceedings of the Computers and Education. Towards an Interconnected Society, 2001

2000
Local versus comprehensive assignments: two complementary approaches.
ACM SIGCSE Bull., 2000

Optimizing Eden by Program Transformation.
Proceedings of the 9th International Workshop on Functional and Logic Programming, 2000

Optimising Eden by transformation.
Proceedings of the Selected papers from the 2nd Scottish Functional Programming Workshop (SFP00), 2000

1999
Calculating Encoding and Decoding Functions for Prefix Codes.
ACM SIGPLAN Notices, 1999

1997
The locker metaphor to teach dynamic memory.
Proceedings of the 28th SIGCSE Technical Symposium on Computer Science Education, 1997

Visual HIPE: a prototype for the graphical visualization of functional expressions (demonstration).
Proceedings of the supplemental proceedings of the conference on Integrating technology into computer science education: working group reports and supplemental proceedings, 1997

Synthesis of Functions by Transformations and Constraints.
Proceedings of the 1997 ACM SIGPLAN International Conference on Functional Programming (ICFP '97), 1997

1996
Graphical visualization of the evaluation of functional programs.
Proceedings of the 1st Annual Conference on Integrating Technology into Computer Science Education, 1996

Functional Skeletons Generate Process Topologies in Eden.
Proceedings of the 1996 Joint Conf. on Declarative Programming, 1996

1995
A gentle introduction to algorithm complexity for CS1 with nine variations on a theme by Fibonacci.
ACM SIGCSE Bull., 1995

A Tabulation Transformation Tactic Using Haskell Arrays.
Proceedings of the 1995 Joint Conference on Declarative Programming, 1995

1994
Non Homomorphic Reductions of Data Structures.
Proceedings of the 1994 Joint Conference on Declarative Programming, 1994


  Loading...