Travelled to:
5 × USA
Collaborated with:
S.Horwitz T.W.Reps J.Riely D.W.Palmer W.Wang J.Huan J.Yang J.Liu Q.Zhang L.McMillan
Talks about:
program (4) graph (2) data (2) dissimilar (1) transform (1) subgraph (1) parallel (1) frequent (1) adequaci (1) version (1)
Person: Jan Prins
DBLP: Prins:Jan
Contributed to:
Wrote 6 papers:
- KDD-2006-LiuZWMP #clustering #difference #order #set
- Clustering pair-wise dissimilarity data into partially ordered sets (JL, QZ, WW, LM, JP), pp. 637–642.
- KDD-2004-HuanWPY #database #graph #mining #named
- SPIN: mining maximal frequent subgraphs from graph databases (JH, WW, JP, JY), pp. 581–586.
- SAS-2000-RielyP
- Flattening Is an Improvement (JR, JP), pp. 360–376.
- PPoPP-1993-PrinsP #source code
- Transforming High-Level Data-Parallel Programs into Vector Operations (JP, DWP), pp. 119–128.
- POPL-1988-HorwitzPR #source code
- Integrating Non-Interfering Versions of Programs (SH, JP, TWR), pp. 133–145.
- POPL-1988-HorwitzPR88a #dependence #graph #on the #representation #source code
- On the Adequacy of Program Dependence Graphs for Representing Programs (SH, JP, TWR), pp. 146–157.