The following pages link to Neil D. Jones (Q1179697):
Displaying 50 items.
- Static semantics, types, and binding time analysis (Q1179698) (← links)
- Space-bounded reducibility among combinatorial problems (Q1221749) (← links)
- Complete problems for deterministic polynomial time (Q1235982) (← links)
- Complexity of some problems in Petri nets (Q1238999) (← links)
- Corrigendum: Space-bounded reducibility among combinatorial problems (Q1239725) (← links)
- A note on linear time simulation of deterministic two-way pushdown automata (Q1245694) (← links)
- TEMPO: A unified treatment of binding time and parameter passing concepts in programming languages (Q1249938) (← links)
- LOGSPACE and PTIME characterized by programming languages (Q1575880) (← links)
- Computational complexity via programming languages: Constant factors do matter (Q1587302) (← links)
- Compiler optimization correctness by temporal logic (Q1768477) (← links)
- Transformation by interpreter specialisation (Q1887680) (← links)
- The expressive power of higher-order types or, life without CONS (Q2740986) (← links)
- Programs=data=first-class citizens in a computational world (Q2941589) (← links)
- A flow calculus of <i>mwp</i> -bounds for complexity analysis (Q2946585) (← links)
- A method for detecting structure in polyhedra (Q3219149) (← links)
- Asymptotic Speedups, Bisimulation and Distillation (Work in Progress) (Q3455068) (← links)
- Proving the Correctness of Unfold/Fold Program Transformations Using Bisimulation (Q3457978) (← links)
- Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time (Q3507419) (← links)
- Call-by-value Termination in the Untyped lambda-calculus (Q3518269) (← links)
- (Q3657413) (← links)
- (Q3709872) (← links)
- (Q3787457) (← links)
- (Q3826542) (← links)
- Complexity of some problems concerningL systems (Q3896507) (← links)
- A Note on the Complexity of General $D0L$ Membership (Q3902531) (← links)
- (Q3922128) (← links)
- (Q3939216) (← links)
- (Q4010358) (← links)
- (Q4038724) (← links)
- (Q4041559) (← links)
- New problems complete for nondeterministic log space (Q4109298) (← links)
- Even Simple Programs Are Hard To Analyze (Q4131614) (← links)
- (Q4134928) (← links)
- (Q4138164) (← links)
- The Complexity of Finite Memory Programs with Recursion (Q4147590) (← links)
- Recognition of deterministic ETOL languages in logarithmic space (Q4151735) (← links)
- (Q4153609) (← links)
- (Q4159038) (← links)
- Corrigendum: Context free languages and rudimentary attributes (Q4166239) (← links)
- Parsers for indexed grammars (Q4187334) (← links)
- (Q4222767) (← links)
- (Q4259964) (← links)
- (Q4265595) (← links)
- (Q4265618) (← links)
- A positive supercompiler (Q4339016) (← links)
- (Q4440317) (← links)
- (Q4511266) (← links)
- (Q4529769) (← links)
- (Q4537517) (← links)
- (Q4539593) (← links)
