Works matching IS 01290541 AND DT 1999 AND VI 10 AND IP 4
Results: 11
Parallel Range Minima on Coarse Grained Multicomputers.
- Published in:
- International Journal of Foundations of Computer Science, 1999, v. 10, n. 4, p. 375, doi. 10.1142/S0129054199000277
- By:
- Publication type:
- Article
Deterministic Branch-and-Bound on Distributed Memory Machines.
- Published in:
- International Journal of Foundations of Computer Science, 1999, v. 10, n. 4, p. 391, doi. 10.1142/S0129054199000289
- By:
- Publication type:
- Article
Cluster-Based Task Scheduling for the LogP Model.
- Published in:
- International Journal of Foundations of Computer Science, 1999, v. 10, n. 4, p. 405, doi. 10.1142/S0129054199000290
- By:
- Publication type:
- Article
Sparse Computation with PEI.
- Published in:
- International Journal of Foundations of Computer Science, 1999, v. 10, n. 4, p. 425, doi. 10.1142/S0129054199000307
- By:
- Publication type:
- Article
Distributed Processing in Automata.
- Published in:
- International Journal of Foundations of Computer Science, 1999, v. 10, n. 4, p. 443, doi. 10.1142/S0129054199000319
- By:
- Publication type:
- Article
O(1) Query Time Algorithm for All Pairs Shortest Distances on Interval Graphs.
- Published in:
- International Journal of Foundations of Computer Science, 1999, v. 10, n. 4, p. 465, doi. 10.1142/S0129054199000320
- By:
- Publication type:
- Article
A Measure for the Lexicographically First Maximal Independent Set Problem and its Limits.
- Published in:
- International Journal of Foundations of Computer Science, 1999, v. 10, n. 4, p. 473, doi. 10.1142/S0129054199000332
- By:
- Publication type:
- Article
Simple Flat Languages: A Learnable Class in the Limit from Positive Data.
- Published in:
- International Journal of Foundations of Computer Science, 1999, v. 10, n. 4, p. 483, doi. 10.1142/S0129054199000344
- By:
- Publication type:
- Article
Minimizing Congestion of Layouts for ATM Networks with Faulty Links.
- Published in:
- International Journal of Foundations of Computer Science, 1999, v. 10, n. 4, p. 503, doi. 10.1142/S0129054199000356
- By:
- Publication type:
- Article
Bipartite Graphs Totally Decomposable by Canonical Decomposition.
- Published in:
- International Journal of Foundations of Computer Science, 1999, v. 10, n. 4, p. 513, doi. 10.1142/S0129054199000368
- By:
- Publication type:
- Article
A Note on the Polynomial Representation of Boolean Functions over GF(2).
- Published in:
- International Journal of Foundations of Computer Science, 1999, v. 10, n. 4, p. 535, doi. 10.1142/S012905419900037X
- By:
- Publication type:
- Article