Le cluster Algorithm complexity - Fast algorithm
| 000283 (1996) | C. W. Kessler [Allemagne] | Scheduling expression DAGs for minimal register need |
| 000216 (2001) | Sébastien Limet [France] ; Pierre Réty [France] ; Helmut Seidl [Allemagne] | Weakly Regular Relations and Applications |
| 000218 (2001) | Valérie Gouranton [France] ; Pierre Réty [France] ; Helmut Seidl [Allemagne] | Synchronized Tree Languages Revisited and New Applications |
| 000240 (1999) | C. W. Kessler [Allemagne] ; H. Seidl [Allemagne] | ForkLight : A control-synchronous parallel programming language |
| 000246 (1998) | Christian Fecht [Allemagne] ; Helmut Seidl [Allemagne] | Propagating differences: An efficient new fixpoint algorithm for distributive constraint systems |
| 000260 (1997) | Thomas Erlebach [Allemagne] ; Klaus Jansen [Allemagne] | Off-line and on-line call-scheduling in stars and trees |
| 000269 (1997) | C. W. Kessler [Allemagne] | Applicability of program comprehension to sparse matrix computations |
| 000277 (1996) | Artur Czumaj [Allemagne] ; Przemysława Kanarek [Pologne] ; Mirosław Kutyłowski [Allemagne] ; Krzysztof Lory [Pologne, Allemagne] | Fast generation of random permutations via networks simulation |
| 000282 (1996) | Christian Fecht [Allemagne] ; Helmut Seidl [Allemagne] | An even faster solver for general systems of equations |
| 000212 (2002) | Flemming Nielson [Danemark] ; Hanne Riis Nielson [Danemark] ; Helmut Seidl [Allemagne] | Automatic Complexity Analysis |
| 000231 (2000) | Helmut Seidl [Allemagne] ; Bernhard Steffen [Allemagne] | Constraint-Based Inter-Procedural Analysis of Parallel Programs |
| 000247 (1998) | Anna Slobodová [Allemagne] | On the composition problem for OBDDs with multiple variable orders |
| 000262 (1997) | Christos Kaklamanis [Grèce] ; Pino Persiano [Italie] ; Thomas Erlebach [Allemagne] ; Klaus Jansen [Allemagne] | Constrained bipartite edge coloring with applications to wavelength routing |
| This area was generated with Dilib version V0.6.31. |  |