SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Journal of Computer and System Sciences

Volumn 48, Issue 2, 1994, Pages 231-254

Exact lower time bounds for computing Boolean functions on CREW PRAMs

(3) Dietzfelbinger, Martin a Kutyłowski, Mirosław b Reischuk, Rüdiger c

a TU DORTMUND UNIVERSITY (Germany)

b UNIVERSITY OF WROC AW (Poland)

c DARMSTADT UNIVERSITY OF TECHNOLOGY (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; ERRORS; MATHEMATICAL MODELS; PARALLEL PROCESSING SYSTEMS; POLYNOMIALS; PROBABILITY; RANDOM ACCESS STORAGE;

CONCURRENT READ EXCLUSIVE WRITE; EXACT LOWER BOUNDS; PARALLEL RANDOM ACCESS MACHINES; TIME COMPLEXITY;

BOOLEAN FUNCTIONS;

EID: 0028407027 PISSN: 00220000 EISSN: 10902724 Source Type: Journal
DOI: 10.1016/S0022-0000(05)80003-0 Document Type: Article

Times cited : (33)

References (31)

1
- 0023825836
- Limits on the power of concurrent-write parallel machines
- (1988) Inform. and Comput. , vol.76 , pp. 13-28
- Beame¹

2
- 84912924552
- P. Beame and N. Nisan, personal communication.

3
- 0023564748
- Generic oracles and oracle classes
- (1987) Proceedings, 28th IEEE Sympos. Found. of Computer Sci. , pp. 118-126
- Blum¹ Impagliazzo²

4
- 0000313642
- Harmonic analysis of polynomial threshold functions
- (1990) SIAM Journal on Discrete Mathematics , vol.3 , pp. 168-177
- Bruck¹

5
- 0025554839
- 0 functions, and spectral norms
- (1990) Proceedings, 31st IEEE Sympos. Found. of Computer Sci. , pp. 632-641
- Bruck¹ Smolensky²

6
- 0023011526
- Properties of complexity measures for PRAMs and WRAMs
- (1986) Theoret. Comput. Sci. , vol.48 , pp. 53-73
- Bublitz¹ Schürfeld² Voigt³ Wegener⁴

7
- 0022662878
- Upper and lower time bounds for parallel random access machines without simultaneous writes
- (1986) SIAM J. Comput. , vol.15 , pp. 87-97
- Cook¹ Dwork² Reischuk³

8
- 84912931650
- Realistic Time-Optimal Algorithms for Boolean Functions on Exclusive-Write PRAMs
- December, (Journal version to appear in SIAM J. Comput.), Fachbereich Mathematik-Informatik, Universität-Gesamthochschule-Paderborn
- (1991) Technical Report 96
- Dietzfelbinger¹ Kutyłowski² Reischuk³

9
- 85034245340
- Parallel retrieval of scattered information
- Lecture Notes in Computer Science, Springer-Verlag, Germany
- (1989) Proceedings, 16th International Colloquium on Automata, Languages and Programming , vol.372 , pp. 439-450
- Hagerup¹ Nowak²

10
- 0025694477
- On the power of randomness in the decision tree model
- (1990) Proceedings, 5th Structure in Complexity Theory Conference , pp. 66-77
- Hajnal¹

11
- 84912918049
- One-Way Functions, Robustness, and Nonisomorphism of NP-Complete Sets
- Dept. of Computer Science, Cornell University, Berlin
- (1987) Report DCS TR86-796
- Hartmanis¹ Hemachandra²

12
- 0024140061
- The influence of variables on boolean functions
- (1988) Proceedings, 29th IEEE Sympos. Found. of Computer Sci. , pp. 68-80
- Kahn¹ Kalai² Linial³

13
- 0026239588
- Time complexity of Boolean functions on CREW PRAMs
- (1991) SIAM Journal on Computing , vol.20 , pp. 824-833
- Kutyłowski¹

14
- 5344245307
- Evaluating Formulas on Parallel Machines without Simultaneous Writes
- January, Institut für Theoretische Informatik, Technische Hochschule Darmstadt, Ithaca, NY
- (1990) Technical Report
- Kutyłowski¹ Reischuk²

15
- 0003305133
- Harmonic analysis of switching functions
- A. Mukhopadhyay, Academic Press, Germany
- (1971) Recent Developments in Switching Theory , pp. 121-228
- Lechner¹

16
- 0024771052
- Constant depth circuits Fourier transform and learnability
- (1989) Proceedings, 30th IEEE Sympos. Found. of Computer Sci. , pp. 574-579
- Linial¹ Mansour² Nisan³

17
- 0004290881
- MIT Press, New York
- (1969) Perceptrons
- Minsky¹ Papert²

18
- 0026389757
- CREW PRAMs and decision trees
- (1991) SIAM J. Comput. , vol.20 , pp. 999-1007
- Nisan¹

19
- 0026999436
- On the degree of boolean functions as real polynomials
- (1992) Proceedings, 24th ACM Sympos. Theory of Computing , pp. 462-467
- Nisan¹ Szegedy²

20
- 0026104904
- Improved upper and lower time bounds for parallel random access machines without simultaneous writes
- (1991) SIAM J. Comput. , vol.20 , pp. 88-99
- Parberry¹ Yan²

21
- 0026993996
- On the degree of polynomials that approximate symmetric boolean functions
- (1992) Proceedings, 24th ACM Sympos. Theory of Computing , pp. 468-474
- Paturi¹

22
- 0000883554
- Lower bounds on the size of bounded depth networks over a complete basis with logical addition
- English transl., Math. Notes 41 No. 4 1987 333 338
- (1987) Mat. Zametki , vol.41 , Issue.4 , pp. 598-607
- Razborov¹

23
- 9144245836
- A class of multiple error-correcting codes and the decoding scheme
- (1954) IRE Professional Group on Information Theory , vol.4 IT , pp. 38-49
- Reed¹

24
- 0001069485
- On recognizing graph properties from adjacency matrices
- (1976) Theoret. Comput. Sci. , vol.3 , pp. 371-384
- Rivest¹ Vuillemin²

25
- 0022863767
- Probabilistic boolean decision trees and the complexity of evaluating game trees
- (1986) Proceedings, 27th IEEE Sympos. Found of Computer Sci. , pp. 29-38
- Saks¹ Wigderson²

26
- 0346870067
- A tight ω(log log n) bound on the time for parallel RAM's to compute nondegenerate Boolean functions
- (1982) Inform. and Control , vol.55 , pp. 102-107
- Simon¹

27
- 0023570259
- Algebraic methods in the theory of lower bounds for Boolean circuit complexity
- (1987) Proceedings, 19th ACM Sympos. Theory of Computing , pp. 77-82
- Smolensky¹

28
- 0022104026
- On parallel searching
- (1985) SIAM J. Comput. , vol.14 , pp. 688-708
- Snir¹

29
- 0010833566
- Algebraic Methods in Lower Bounds for Computational Models with Limited Communication
- University of Chicago, Cambridge, MA
- (1989) Ph.D. dissertation
- Szegedy¹

30
- 0001517258
- A by a random oracle A?
- (1989) Combinatorica , vol.9 , pp. 385-392
- Tardos¹

31
- 0004203012
- Wiley-Teubner
- (1987) The Complexity of Boolean Functions
- Wegener¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.