Jens P. Secher

According to our database, Jens P. Secher authored at least 8 papers between 1997 and 2002.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2002

From checking to inference via driving and dag grammars.

Jens P. Secher, Morten Heine Sørensen

Proceedings of the 2002 ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation (PEPM '02), 2002

From Type Inference to Configuration.

Morten Heine Sørensen, Jens P. Secher

Proceedings of the Essence of Computation, Complexity, Analysis, 2002

2001

Driving in the Jungle.

Jens P. Secher

Proceedings of the Programs as Data Objects, Second Symposium, 2001

2000

Word encoding tree connectivity works.

Stephen Alstrup, Jens P. Secher, Mikkel Thorup

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

1999

On Perfect Supercompilation.

Jens P. Secher, Morten Heine Sørensen

Proceedings of the Perspectives of System Informatics, 1999

Perfect supercompilation - master's thesis.

Jens Peter Secher

PhD thesis, 1999

1998

C-MIX: Specialization of C Programs.

Arne J. Glenstrup, Henning Makholm, Jens P. Secher

Proceedings of the Partial Evaluation - Practice and Theory, DIKU 1998 International Summer School, Copenhagen, Denmark, June 29, 1998

1997

Optimal On-Line Decremental Connectivity in Trees.

Stephen Alstrup, Jens P. Secher, Maz Spork

Inf. Process. Lett., 1997