Robert Glück

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Zenjiro Konishi

> Home > Persons > Robert Glück

Publications

2002
[c33]
- view
  authority control:
- export record
  dblp key:
  - conf/birthday/FutamuraKG02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/birthday/FutamuraKG02
Yoshihiko Futamura, Zenjiro Konishi, Robert Glück:
WSDFU: Program Transformation System Based on Generalized Partial Computation. The Essence of Computation 2002: 358-378
[c32]
- view
  authority control:
- export record
  dblp key:
  - conf/pepm/FutamuraKG02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/pepm/FutamuraKG02
Yoshihiko Futamura, Zenjiro Konishi, Robert Glück:
Automatic generation of efficient string matching algorithms by generalized partial computation. ASIA-PEPM 2002: 1-8
2001
[j11]
- view
  authority control:
- export record
  dblp key:
  - journals/ngc/FutamuraKG01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ngc/FutamuraKG01
Yoshihiko Futamura, Zenjiro Konishi, Robert Glück:
Program Transformation System Based on Generalized Partial Computation. New Gener. Comput. 20(1): 75-100 (2001)
2000
[c26]
- no documents available
  - no references & citations available
- export record
  dblp key:
  - conf/aplas/FutamuraKG00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/aplas/FutamuraKG00
Yoshihiko Futamura, Zenjiro Konishi, Robert Glück:
Automatic Generation of Very Efficient Programs by Generalized Partial Computation. APLAS 2000: 183-191

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.