-
1
-
-
0002272792
-
The Muse or-parallel Prolog model and its performance
-
MIT Press
-
Ali, K. A. M. and Karlsson, R., "The Muse Or-parallel Prolog Model and its Performance," in 1990 North American Conf. on Logic Programming, MIT Press, pp. 757-776, 1990.
-
(1990)
1990 North American Conf. on Logic Programming
, pp. 757-776
-
-
Ali, K.A.M.1
Karlsson, R.2
-
2
-
-
0025549296
-
Full Prolog and scheduling or-parallelism in Muse
-
Ali, K. A. M. and Karlsson, R., "Full Prolog and Scheduling Or-parallelism in Muse," International Journal of Parallel Programming, 19(6), pp. 445-475, 1991.
-
(1991)
International Journal of Parallel Programming
, vol.19
, Issue.6
, pp. 445-475
-
-
Ali, K.A.M.1
Karlsson, R.2
-
3
-
-
0003012944
-
Scheduling speculative work in or-parallel Prolog systems
-
MIT Press
-
Beaumont, T. and Warren, D. H. D., "Scheduling Speculative Work in Or-Parallel Prolog Systems," in 10th International Conf. on Logic Programming, MIT Press, pp. 135-149, 1993.
-
(1993)
10th International Conf. on Logic Programming
, pp. 135-149
-
-
Beaumont, T.1
Warren, D.H.D.2
-
4
-
-
0002257927
-
What is a pointer machine?
-
DIKU, University of Copenhagen
-
Ben-Amram, A. M., "What is a Pointer Machine?," Technical report, DIKU, University of Copenhagen, 1995.
-
(1995)
Technical Report
-
-
Ben-Amram, A.M.1
-
5
-
-
0022812206
-
On the single-operation worst-case time complexity of the disjoint set union problem
-
Blum, N., "On the single-operation worst-case time complexity of the disjoint set union problem," SIAM Journal on Computing, 15(4), pp. 1021-1024, 1986.
-
(1986)
SIAM Journal on Computing
, vol.15
, Issue.4
, pp. 1021-1024
-
-
Blum, N.1
-
6
-
-
0001610841
-
Restricted AND-parallelism execution model with side-effects
-
Ewing L. Lusk and Ross A. Overbeek, eds.
-
Chang, S-E. and Chiang, Y-P., "Restricted AND-Parallelism Execution Model with Side-Effects," in Proc. of the North American Conf. on Logic Programming (Ewing L. Lusk and Ross A. Overbeek, eds.), pp. 350-368, 1989.
-
(1989)
Proc. of the North American Conf. on Logic Programming
, pp. 350-368
-
-
Chang, S.-E.1
Chiang, Y.-P.2
-
7
-
-
0024018076
-
A functional approach to data structures and its use in multidimensional searching
-
Chazelle, B.., "A Functional Approach to Data Structures and its Use in Multidimensional Searching, SIAM Journal of Computing, 17(3), pp. 427-462, 1988.
-
(1988)
SIAM Journal of Computing
, vol.17
, Issue.3
, pp. 427-462
-
-
Chazelle, B.1
-
9
-
-
0024860011
-
The cell probe complexity of dynamic data structures
-
ACM
-
Fredman, M. L. and Saks, M. E., "The Cell Probe Complexity of Dynamic Data Structures," in Proc. of 21st ACM Symp. on Theory of Computing, ACM, pp. 345-354, 1989.
-
(1989)
Proc. of 21st ACM Symp. on Theory of Computing
, pp. 345-354
-
-
Fredman, M.L.1
Saks, M.E.2
-
10
-
-
85030568489
-
Data structures for weighted matching and nearest common ancestor
-
Gabow, H. N., "Data structures for weighted matching and nearest common ancestor," in ACM Symp. on Discrete Algorithms, pp. 434-443, 1990.
-
(1990)
ACM Symp. on Discrete Algorithms
, pp. 434-443
-
-
Gabow, H.N.1
-
12
-
-
0030127333
-
Cuts and side-effects in and/or parallel Prolog
-
Gupta, G. and Santos Costa, V., "Cuts and Side-effects in And/Or Parallel Prolog," Journal of Logic Programming, 27(1), pp. 45-71, 1996.
-
(1996)
Journal of Logic Programming
, vol.27
, Issue.1
, pp. 45-71
-
-
Gupta, G.1
Santos Costa, V.2
-
13
-
-
0040267590
-
Shared paged binding arrays: A universal data-structure for parallel logic programming
-
University of Oregon, Mar.
-
Gupta, G., Santos Costa, V. and Pontelli, E., "Shared Paged Binding Arrays: A Universal Data-structure for Parallel Logic Programming," in Proc. NSF/ICOT Workshop on Parallel Logic Programming and its Environments, CIS-94-04, University of Oregon, Mar. 1994.
-
(1994)
Proc. NSF/ICOT Workshop on Parallel Logic Programming and Its Environments, CIS-94-04
-
-
Gupta, G.1
Santos Costa, V.2
Pontelli, E.3
-
14
-
-
0002381368
-
ACE: And/or-parallel copying-based execution of logic programs
-
MIT Press
-
Gupta, G., Pontelli, E., Hermenegildo, H. and Santos Costa, V., "ACE: And/Or-parallel Copying-based Execution of Logic Programs," in Proc. ICLP'94, MIT Press, pp. 93-109, 1994.
-
(1994)
Proc. ICLP'94
, pp. 93-109
-
-
Gupta, G.1
Pontelli, E.2
Hermenegildo, H.3
Santos Costa, V.4
-
15
-
-
0027659656
-
Analysis of or-parallel execution models
-
Gupta, G. and Jayaraman, B., "Analysis of or-parallel execution models," ACM TOPLAS, 15(4), pp. 659-680, 1993.
-
(1993)
ACM TOPLAS
, vol.15
, Issue.4
, pp. 659-680
-
-
Gupta, G.1
Jayaraman, B.2
-
16
-
-
0021426157
-
Fast algorithms for finding nearest common ancestor
-
Harel, D. and Tarjan, R. E., "Fast Algorithms for Finding Nearest Common Ancestor," SIAM Journal of Computing, 13(2), pp. 338-355, 1984.
-
(1984)
SIAM Journal of Computing
, vol.13
, Issue.2
, pp. 338-355
-
-
Harel, D.1
Tarjan, R.E.2
-
17
-
-
0002093906
-
Kernel Andorra Prolog and its computation model
-
MIT Press
-
Haridi, S. and Janson, S., "Kernel Andorra Prolog and its Computation Model," in Proc. 7th International Conf. on Logic Programming, MIT Press, pp. 31-46, 1990.
-
(1990)
Proc. 7th International Conf. on Logic Programming
, pp. 31-46
-
-
Haridi, S.1
Janson, S.2
-
18
-
-
0002093043
-
Cut and side-effects in or-parallel Prolog
-
Tokyo, Nov.
-
Hausman, B., Ciepielewski, A. and Calderwood, A., "Cut and Side-Effects in Or-Parallel Prolog," in International Conf. on Fifth Generation Computer Systems, Tokyo, pp. 831-840, Nov. 1988.
-
(1988)
International Conf. on Fifth Generation Computer Systems
, pp. 831-840
-
-
Hausman, B.1
Ciepielewski, A.2
Calderwood, A.3
-
19
-
-
0002767863
-
&-Prolog and its performance: Exploiting independent and-parallelism
-
MIT Press, Jun.
-
Hermenegildo, M. and Greene, K., "&-Prolog and its Performance: Exploiting Independent And-Parallelism," in 1990 International Conf. on Logic Programming, MIT Press, pp. 253-268, Jun. 1990.
-
(1990)
1990 International Conf. on Logic Programming
, pp. 253-268
-
-
Hermenegildo, M.1
Greene, K.2
-
20
-
-
0028515405
-
Parallel logic programming systems
-
Kergommeaux, J. C. and Codognet, P., "Parallel logic programming systems," ACM Computing Surveys, 26(3), pp. 295-336, 1994.
-
(1994)
ACM Computing Surveys
, vol.26
, Issue.3
, pp. 295-336
-
-
Kergommeaux, J.C.1
Codognet, P.2
-
22
-
-
0030082304
-
Lower bounds for the union-find and the split-find problem on pointer machines
-
LaPoutré, H., "Lower Bounds for the Union-Find and the Split-Find Problem on Pointer Machines," Journal of Computer and System Sciences, 52, pp. 87-99, 1996.
-
(1996)
Journal of Computer and System Sciences
, vol.52
, pp. 87-99
-
-
LaPoutré, H.1
-
24
-
-
0000670670
-
The Aurora or-parallel Prolog system
-
Lusk, E. et al., "The Aurora Or-parallel Prolog System," New Generation Computing, 7(2/3), 1990.
-
(1990)
New Generation Computing
, vol.7
, Issue.2-3
-
-
Lusk, E.1
-
26
-
-
0031100714
-
Pure versus impure Lisp
-
Pippenger, N., "Pure versus Impure Lisp," ACM Transactions on Programming Languages and Systems, 19(2), pp. 223-238, 1997.
-
(1997)
ACM Transactions on Programming Languages and Systems
, vol.19
, Issue.2
, pp. 223-238
-
-
Pippenger, N.1
-
27
-
-
0029237793
-
&ACE: A high-performance parallel Prolog system
-
Santa Barbara, CA, IEEE Computer Society, Apr.
-
Pontelli, E., Gupta, G. and Hermenegildo, M., "&ACE: A High-performance Parallel Prolog System," in International Parallel Processing Symp., Santa Barbara, CA, IEEE Computer Society, pp. 564-571, Apr. 1995.
-
(1995)
International Parallel Processing Symp.
, pp. 564-571
-
-
Pontelli, E.1
Gupta, G.2
Hermenegildo, M.3
-
28
-
-
84949226830
-
On the complexity of parallel implementation of logic programs
-
Springer-Verlag
-
Pontelli, E., Ranjan, D. and Gupta, G., "On the Complexity of Parallel Implementation of Logic Programs," in Proc. of the International Conf. on Foundations of Software Technology and Theoretical Computer Science, Springer-Verlag, pp. 123-137, 1997.
-
(1997)
Proc. of the International Conf. on Foundations of Software Technology and Theoretical Computer Science
, pp. 123-137
-
-
Pontelli, E.1
Ranjan, D.2
Gupta, G.3
-
29
-
-
84947759555
-
The complexity of late-binding in dynamic object-oriented languages
-
Springer-Verlag
-
Pontelli, E., Ranjan, D. and Gupta, G., "The Complexity of Late-binding in Dynamic Object-Oriented Languages," in Proc. of the International Symp. on Programming Languages, Implementations, Logic, and Languages (PLILP), Springer-Verlag, pp. 213-229, 1998.
-
(1998)
Proc. of the International Symp. on Programming Languages, Implementations, Logic, and Languages (PLILP)
, pp. 213-229
-
-
Pontelli, E.1
Ranjan, D.2
Gupta, G.3
-
30
-
-
0345092892
-
Dynamic data structures in advanced programming languages implementation
-
Dept. Computer Science, New Mexico State University
-
Ranjan, D., Pontelli, E. and Gupta, G., "Dynamic Data Structures in Advanced Programming Languages Implementation," Technical report, Dept. Computer Science, New Mexico State University, 1997.
-
(1997)
Technical Report
-
-
Ranjan, D.1
Pontelli, E.2
Gupta, G.3
-
31
-
-
84918983692
-
A machine oriented logic based on the resolution principle
-
Jan.
-
Robinson, J. A., "A Machine Oriented Logic Based on the Resolution Principle," Journal of the ACM, 12(23), pp. 23-41, Jan. 1965.
-
(1965)
Journal of the ACM
, vol.12
, Issue.23
, pp. 23-41
-
-
Robinson, J.A.1
-
32
-
-
0000371259
-
Storage modification machines
-
Aug.
-
Schönhage, A., "Storage Modification Machines," SIAM Journal of Computing, 9(3), pp. 490-508, Aug. 1980.
-
(1980)
SIAM Journal of Computing
, vol.9
, Issue.3
, pp. 490-508
-
-
Schönhage, A.1
-
34
-
-
0020766586
-
A data structure for dynamic trees
-
Sleator, D. D. and Tarjan, R. E., "A data structure for dynamic trees," Journal of Computer and System Sciences, 26, pp. 362-391, 1983.
-
(1983)
Journal of Computer and System Sciences
, vol.26
, pp. 362-391
-
-
Sleator, D.D.1
Tarjan, R.E.2
-
35
-
-
0004278308
-
-
MIT Press, Cambridge, MA
-
Sterling, L. and Shapiro, E. Y., The Art of Prolog, MIT Press, Cambridge, MA, 1994.
-
(1994)
The Art of Prolog
-
-
Sterling, L.1
Shapiro, E.Y.2
-
36
-
-
0011739689
-
Performance analysis of the Aurora or-parallel Prolog system
-
MIT Press, Oct.
-
Szeredi, P., "Performance Analysis of the Aurora Or-Parallel Prolog System," in 1989 North American Conf. on Logic Programming, MIT Press, pp. 713-732, Oct. 1989.
-
(1989)
1989 North American Conf. on Logic Programming
, pp. 713-732
-
-
Szeredi, P.1
-
37
-
-
0018455018
-
A class of algorithms which require nonlinear time to mantain disjoint sets
-
Tarjan, R. E., "A Class of Algorithms which Require Nonlinear Time to Mantain Disjoint Sets," Journal of Computer and System Sciences, 2(18), pp. 110-127, 1979.
-
(1979)
Journal of Computer and System Sciences
, vol.2
, Issue.18
, pp. 110-127
-
-
Tarjan, R.E.1
-
38
-
-
0023842642
-
The nearest common ancestor in a dynamic tree
-
Tsakalidis, A. K., "The Nearest Common Ancestor in a Dynamic Tree," ACTA Informatica, 25, 1988.
-
(1988)
ACTA Informatica
, vol.25
-
-
Tsakalidis, A.K.1
-
39
-
-
0023594545
-
The PEPSys model: Combining backtracking, AND-and OR-Parallelism
-
Westphal, H. and Robert, P., "The PEPSys Model: Combining Backtracking, AND-and OR-Parallelism," in IEEE Internatinal Symp. on Logic Programming, pp. 436-448, 1987.
-
(1987)
IEEE Internatinal Symp. on Logic Programming
, pp. 436-448
-
-
Westphal, H.1
Robert, P.2
|