Eric Robinson 

tivadar@gmail.com 

Home 

(617) 953-8953 (cell, day and eve.) 

12 Winter Street, #6 

Somerville, MA 02144 

Work 

(617) 373-7127 

High Performance Computing Lab 

College of Computer and Information Science 

Northeastern University, West Village H 

Boston, MA 02115 

Objective 

 

 

Education 

 

2002 - present        Northeastern University        Boston, MA

Ph.D. in Computer Science 

  • High-Performance Computing Laboratory 

 

2002 - 2004        Northeastern University        Boston, MA

Masters in Computer Science 

  • Focus in High-Performance Computing 

 

1998 - 2002        LaSalle University        Philadelphia, PA

Bachelor of Science, Computer Sciences and Mathematics 

  • Honors Student 

  • Major GPA 3.9 

Summary of qualifications       

 

  • Systems Experience (Linux/Unix and Windows) 

  • Experience in GW, Q, and Visual Basic 

  • Mastery of C and C++ in both Windows and Unix/Linux 

  • Expertise in Java and knowledge of the Java API 

  • Ability in HTML, Java script, Flash, and ASP for web site creation 

  • Ability with hardware installation; assembly of computers 

  • Use of database, web design, digital art, and other applications 

  • Knowledge of MPI Standard and application in large projects 

  • Work with Parallel Environments (LFS, MPI, Performance Analysis, …) 

  • Resource Intensive Program Development using 32 processors, 10 TB distributed disks, and 16 GB distributed memory 

Work experience 

 

2002 - present        Northeastern University        Boston, MA

Teaching Assistant/Instructor of Record 

  • Ran labs and graded for Computer Science courses 

  • Developed curriculum and taught sophomore level programming class 

  • Taught engineering programming class 

2006 - 2007, Summer        MIT Lincoln Labs        Lexington, MA

Summer Internship 

  • Designed algorithms for SSCA#2, graph clustering using sparse matrix representation 

  • Implemented SSCA#2 algorithm in PMatlab 

  • Created linear algebra formulation for fast betweenness centrality algorithm 

2005 - 2007        ASAP for Kids        Boston, MA

After school Workshop 

  • Planned and ran a semester-long game design workshop 

2003 - 2006        Emagination Computer Camps        Boston, MA

Summer Camp Counselor 

  • Assistant Director for planning weekend and nighttime events 

  • Monitored campers at overnight camp 

  • Ran Computer Science workshops 

  • Developed curriculums for workshops before the start of camp 

2001 - 2002        Precision Systems, Inc.        Horsham, PA

Software Engineer 

  • Design and implement embedded real-time operating systems for electrical, pharmaceutical and other high tech industries 

1998 - 2002        LaSalle University        Philadelphia, PA

Lab Assistant/Tutor 

  • Maintain PC’s and install software in LaSalle's student computer labs 

  • Help students with math and computer science courses and labs 

2000, Fall        Ecal Corporation        Philadelphia, PA

Web Programmer 

  • Program an online scheduler utilizing HTML, java script, and ASP 

Awards 

 

2001 - 2002        La Salle University        Philadelphia, PA

NSF/CIS Scholarship 

  • Exceptional student in Computer Sciences 

2001 - 2002        LaSalle University        Philadelphia, PA

J. R. Cullen Sr. Scholarship 

  • Outstanding performance as a Computer Science major at La Salle 

2000, Summer        LaSalle University        Philadelphia, PA

Visual Basic Project 

  • Link an MS Access database to a VB interface for academic records 

1998 - 2002        LaSalle University        Philadelphia, PA

Founders Scholarship 

  • Excellence in high school academics and extracurricular activities 

Publications 

 

Eric Robinson, Dan Kunkle, and Gene Cooperman, A Comparative Analysis of Parallel Disk-based Methods for Enumerating Implicit Graphs, Proc. of International Workshop on Parallel Symbolic Computation (PASCO '07), ACM Press, 2007, pp. 78—87, 13 of 15 papers accepted

  • A survey of techniques available for large search and enumeration problems 

  • Includes previously unavailable analysis of runtime of techniques to provide a fair comparison between them 

Eric Robinson, Juergen Mueller, and Gene Cooperman, A Disk-Based Parallel Implementation for Direct Condensation of Large Permutation Modules, Proc. of International Symposium on Symbolic and Algebraic Computation (ISSAC '07), ACM Press, 2007, pp. 315—322, 50 of 98 papers accepted

  • Distributed disk-based algorithms for computing orbit counting matrices for groups with large orbits (e.g.  Fischer 23, orbit containing 11 billion vectors, using 500 gigabytes distributed storage)

Eric Robinson, Large Search Space Generation:  Overcoming Memory and Disk Limitations, Thesis Proposal, Northeastern University, Northeastern University, 2006

  • Hierarchy for search space enumeration techniques with a natural tradeoff between space required and number of computations. 

  • New algorithm for search space enumeration requiring a large amount of space (disk), but with very little computation. 

Eric Robinson and Gene Cooperman, A Parallel Architecture for Disk-Based Computing over the Baby Monster and other Large Finite Simple Groups, Proc. of International Symposium on Symbolic and Algebraic Computation (ISSAC '06), ACM Press, 2006, pp. 298—305, 48 of 97 papers accepted

  • Distributed algorithms for very high degree permutation group discovery (e.g. Baby Monster: permutations over 14 billion points; using 10 terabytes distributed storage) 

  • The Baby Monster group is the next sporadic simple group in a natural ladder of computational challenge program 

Gene Cooperman and Eric Robinson, Memory-Based and Disk-Based Algorithms for Very High Degree Permutation Groups, Proc. of International Symposium on Symbolic and Algebraic Computation (ISSAC '03), ACM Press, 2003, pp. 66—73, 36 of 68 papers accepted

  • Effective algorithms for large degree permutation group discovery 

Ph.D. Research 

 

2004 - present        Northeastern University        Boston, MA

Distributed Disk-Based Enumeration Software 

  • Adapted previous work for a generic distributed algorithm to enumerate very large implicit graphs 

  • Developed API for Enumeration Techniques 

  • Current implementation includes 3 search techniques and 2 problem applications in computational group theory and game state enumeration 

  • Future application to software verification applications 

2006 - 2007        Northeastern University        Boston, MA

Computation of Orbit Counting Matrices (dimension 6486) for Fischer 23 

  • Performed distributed disk-based search to enumerate orbit 

  • Designed parallel condensation technique on orbit data 

  • Used cluster with 64 nodes 

  • Used 50 gigabytes of memory, 500 gigabytes of disk, all distributed in the cluster 

  • Previously unsolved problem required four days of computation 

2003 - 2006        Northeastern University        Boston, MA

Construction of Permutation Representation of Baby Monster (from Matrix Generators) 

  • Computation building tree with 14 billion nodes 

  • Used cluster with 32 nodes 

  • Used 16 gigabytes of memory, 10 terabytes of disk space, all distributed in the cluster 

  • Emphasized balance of disk, network, memory, and CPU time for practical completion time 

  • Previously unsolved problem estimated computation in two weeks 

2002 - 2003        Northeastern University        Boston, MA

Construction of Thompson Group (Permutation Group) 

  • Computation building tree with 140 million nodes 

  • Used 5 gigabytes on a shared memory system 

  • Traded CPU time for reduced memory time in a memory-bound application 

  • Previously unsolved problem computed in one hour