Peter B. Henderson
- 1 AHO, A V, HIRSCHBERG, D, AND ULLMAN, J D Bounds on the complexity of the longest common subsequence problem J A CM 23, 1 (Jan 1976), 1-12 Google Scholar
- 2 CERF, V G Multlprocessors, semaphores, and a graph model of computation Ph D Th, U of California at Los Angeles, Los Angeles, Cahf, 1972 Google Scholar
- 3 COURTOIS, P J, HEYMANS, F, AND PARNAS, D L Concurrent control with "readers" and "writers" Comm A CM 14, 10 (Oct 1971), 667-668 Google Scholar
- 4 DIJKSTRA, E W Cooperatmg sequential processes. In Programming Languages, F Genuys, Ed, Academic Press, New York, 1968, pp 43-112Google Scholar
- 5 DIJKSTRA, E W Hierarchical ordenng of sequenual processes. In Operating Systems Techmques, C A R Hoare and R H Perrot, Eds, Academic Press, New York, 1972, pp. 72-93Google Scholar
- 6 DOLEV, D Abstract characterization of slices of vanous synchronization pnmmves Dept of Applied Mathematics, Welzmann institute of Science, Rehovot, Israel, Sept 1976Google Scholar
- 7 DOLEV, D Local characterization of models of synchromzauon pnmmves Proc of Waterloo Conference on Theoretical Computer Science, U of Waterloo, Waterloo, Ontario, Canada, Aug. 1977, pp 53-60Google Scholar
- 8 DOLEV, D, AND SHAMIR, E Commutation relations of slices characterize some synchronization prlmRives Inform Proc Letters 7 (1978), 7-9Google Scholar
- 9 EILENBERG, S Automata, Languages and Machmes Academic Press, New York, 1974 Google Scholar
- 10 HENDERSON, P B Synthesis ofsynchromzaUon systems for fimte languages Proc 1978 Conf on Informauon Sciences and Systems, Johns Hopkms U, Baltimore, Md, Aprd 1978, pp 500-504Google Scholar
- 11 HENDERSON, P B, AND ZALCSTEIN, Y Characterization of the synchromzatton languages for PV systems Proc Seventeenth Ann IEEE Symp on Foundauons of Computer Science, Houston, Texas, Oct 1976, pp 9-18Google Scholar
- 12 HENDERSON, P B, AND ZALCSTE|N, Y A graph theoretic characterization of the PVehunk class of synchromzatlon pnmmves SIAM J Comptng. 6 (1977), 88-108Google Scholar
- 13 HOLT, A W, AND COMMONER, F Events and conditions Project MAC Conf on Concurrent Systems and Parallel Computation, Woods Hole, Mass., Dec. 1970, pp 3-52, also Tech Rep, Applied Data Research, Inc, Pnnceton, N J, 1970Google Scholar
- 14 HOPCROFT, J, AND ULLMAN, J D Formal Languages and Their Relation to Automata Addison-Wesley, Reading, Mass, 1969 Google Scholar
- 15 Hu,S T Threshold Logw U of Cahfornla Press, Berkeley, Cahf, 1965Google Scholar
- 16 KARP, R M, AND MILLER, R E Parallel program schemata J Comptr. Syst. Scl. 3, 2 (1969), 145-195.Google Scholar
- 17 KNUTH, D E The Art of Computer Programmmg, Vol 2 Addison-Wesley, Reading, Mass, 1968 Google Scholar
- 18 LIPTON, R J On synchronization prunmve systems Tech Rep No 22, Yale U, New Haven, Corm, 1973Google Scholar
- 19 LIPTON, R J Limitations of synchronization prtmmves with conditional branching and global variables Proc Sixth ACM Symp on Theory of Computmg, Seattle, Wash, 1974, pp 230-241 Google Scholar
- 20 LIPTON, R J, SNYDER, L, AND ZALCSTEIN, Y A comparatwe study of models of parallel computation Conf Record of Fifteenth Annual IEEE SWAT Symp, 1974, pp 145-155Google Scholar
- 21 PATIL, S Limitations and capabdmes of Dljkstra's semaphore primitives for coordination among processes Memo No 57, Project MAC Computational Structures Group, M I T, Cambridge, Mass, 1971.Google Scholar
- 22 VANTILBORGH, H, AND VAN LAMSWEERDE, A On an extension of Dljkstra's semaphore prtmmves Inform. Proc Letters 1 (1972), 181-186Google Scholar
- 23 WODON, P Still another system for controllmg cooperating algorithms Tech Rep, Carnegie-Mellon U, PRtsburgh, Pa, 1972Google Scholar
- 24 LIPTON, R J, SNYDER, L, AND ZALCSTEIN, Y Evaluation cntena for process synchronization Proc IEEE Sagamore Conf on Parallel Processing, 1975, pp 245-250Google Scholar
Index Terms
- Synchronization Problems Solvable by Generalized PV Systems
Recommendations
Battery management for grid-connected PV systems with a battery
ISLPED '12: Proceedings of the 2012 ACM/IEEE international symposium on Low power electronics and designPhotovoltaic (PV) power generation systems are one of the most promising renewable power sources to reduce carbon footprint. Grid-connected PV power systems do not generally have a battery to store the excess charge. However, due to severe imbalance ...
Counting Complexity of Solvable Black-Box Group Problems
We place many computational problems over solvable black-box groups in the counting complexity classes SPP or LWPP\@. The classes SPP and LWPP are considered classes of low counting complexity. In particular, SPP is low (powerless when used as oracles) ...
Solvable Group Isomorphism Is (Almost) in NP ∩ coNP
The Group Isomorphism problem consists in deciding whether two input groups G1 and G2 given by their multiplication tables are isomorphic. We first give a 2-round Arthur-Merlin protocol for the Group Nonisomorphism problem such that on input groups (G1, ...
Comments