default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRobert Strandh
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c34]Robert Strandh:
Creating a Common Lisp Implementation. ELS 2022: 2- [c33]Robert Strandh, Irène Durand:
A CLOS protocol for lexical environments. ELS 2022: 20-26 - 2021
- [c32]Robert Strandh:
Call-site optimization for Common Lisp. ELS 2021: 72-78 - 2020
- [c31]Robert Strandh:
Omnipresent and low-overhead application debugging. ELS 2020: 8-15 - [c30]Robert Strandh:
Representing method combinations. ELS 2020: 60-67
2010 – 2019
- 2019
- [c29]Irène Durand, Robert Strandh:
MAKE-METHOD-LAMBDA Revisited. ELS 2019: 20-23 - [c28]Irène Durand, Robert Strandh:
Bootstrapping Common Lisp Using Common Lisp. ELS 2019: 56-63 - 2018
- [c27]Irène Durand, Robert Strandh:
Incremental Parsing of Common Lisp Code. ELS 2018: 16-22 - [c26]Irène Durand, Robert Strandh:
Partial Inlining Using Local Graph Rewriting. ELS 2018: 102-109 - 2017
- [c25]Irène Durand, Robert Strandh:
Fast, Maintainable, and Portable Sequence Functions. ELS 2017: 64-71 - [c24]Irène Durand, Robert Strandh:
Removing Redundant Tests by Replicating Control Paths. ELS 2017: 106-112 - 2016
- [c23]Robert Strandh:
A CLOS Protocol for Editor Buffers. ELS 2016: 21-28 - [c22]Robert Strandh:
A Modern Implementation of the LOOP Macro. ELS 2016: 49-55 - 2015
- [c21]Irène Durand, Robert Strandh:
Processing Lisp Elements in Reverse Order. ELS 2015: 39-46 - [c20]Robert Strandh:
First-Class Global Environments in Common Lisp. ELS 2015: 79-86 - 2014
- [c19]Robert Strandh:
Fast Generic Dispatch for Common Lisp. ILC 2014: 89 - [c18]Robert Strandh:
An Improvement to Sliding Garbage Collection. ILC 2014: 97 - [c17]Robert Strandh:
Resolving Metastability Issues During Bootstrapping. ILC 2014: 103 - 2011
- [c16]Robert Strandh, Matthieu Villeneuve:
SICL: Building Blocks for Implementers of Common Lisp. ELS 2011: 34-38
2000 – 2009
- 2009
- [c15]Thomas Rocher, Matthias Robine, Pierre Hanna, Robert Strandh:
Dynamic Chord Analysis for Symbolic Music. ICMC 2009 - 2008
- [j5]Christof Lutteroth
, Robert Strandh, Gerald Weber:
Domain Specific High-Level Constraints for User Interface Layout. Constraints An Int. J. 13(3): 307-342 (2008) - [j4]Christophe Rhodes, Robert Strandh:
Gsharp, un éditeur de partitions de musique interactif et personnalisable. Document Numérique 11(3-4): 9-28 (2008) - 2007
- [c14]Robert Strandh, John Hamer, Gilbert Baumann:
Using Stealth Mixins to Achieve Modularity. ASWEC 2007: 111-116 - [c13]Myriam Desainte-Catherine, Sylvain Marchand, Pierre Hanna, Mathieu Lagrange, Matthias Robine, Martin Raspaud, Robert Strandh, Antoine Allombert, Guillaume Meurisse, Joan Mouba, Jean Louis Di Santo, Gyorgy Kurtag:
Scrime Studio Report. ICMC 2007 - [c12]Robert Strandh, David Murray, Troels Henriksen, Christophe Rhodes:
ESA: a CLIM library for writing Emacs-Style Applications. ILC 2007: 24 - 2005
- [c11]Myriam Desainte-Catherine, Pierre Hanna, Christophe Havel, Gyorgy Kurtag, Mathieu Lagrange, Sylvain Marchand, Edgar Nicouleau, Martin Raspaud, Matthias Robine, Robert Strandh:
Scrime Studio Report. ICMC 2005 - 2004
- [j3]Achille J.-P. Braquelaire, Robert Strandh:
A color model for rendering linear passive graphic 2D objects. Graph. Model. 66(2): 71-88 (2004)
1990 – 1999
- 1999
- [c10]Sylvain Marchand, Robert Strandh:
InSpect and ReSpect: Spectral Modeling, Analysis and Real-time Synthesis Software Tools for Researchers and Composers. ICMC 1999 - 1997
- [c9]Alain Miniussi, Robert Strandh:
An Efficient Algorithm for Recognizing the Forward-Branching Class of Term-Rewriting Systems. APPIA-GULP-PRODE 1997: 445-456 - [c8]Bruno Salinier, Robert Strandh:
Simulating Forward-Branching Systems with Constructor Systems. TAPSOFT 1997: 153-164 - 1996
- [j2]Bruno Salinier, Robert Strandh:
Efficient Simulation of Forward-Branching Systems with Constructor Systems. J. Symb. Comput. 22(4): 381-399 (1996) - 1994
- [c7]Timo Metzemakers, Alain Miniussi, David J. Sherman, Robert Strandh:
Improving Arithmetic Performance using Fine-Grain Unfolding. PLILP 1994: 324-339 - 1992
- [c6]David J. Sherman, Robert Strandh:
Call Unfolding Strategies for Equational Logic Programs. PEPM 1992: 48-53 - 1991
- [c5]David J. Sherman, Robert Strandh, Irène Durand:
Optimization of Equational Programs Using Partial Evaluation. PEPM 1991: 72-82 - [c4]Irène Durand, David J. Sherman, Robert Strandh:
Partial Evaluation of an Intermediate Language for Equational Programs. JTASPEFT/WSA 1991: 98-106 - [c3]Srecko Brlek, Pierre Castéran, Robert Strandh:
On Addition Schemes. TAPSOFT, Vol.2 1991: 379-393
1980 – 1989
- 1989
- [c2]Robert Strandh:
Classes of Equational Programs that Compile into Efficient Machine Code. RTA 1989: 449-461 - 1987
- [c1]Robert Strandh:
Optimizing Equational Programs. RTA 1987: 13-24 - 1985
- [j1]Christoph M. Hoffmann, Michael J. O'Donnell, Robert Strandh:
Implementation of an Interpreter for Abstract Equations. Softw. Pract. Exp. 15(12): 1185-1204 (1985)
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-26 01:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
