![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Philip M. Spira
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1980 – 1989
- 1985
- [c7]Philip M. Spira, Carl Hage:
Hardware acceleration of gate array layout. DAC 1985: 359-366 - 1983
- [j9]Robert G. Gallager, Pierre A. Humblet, Philip M. Spira:
A Distributed Algorithm for Minimum-Weight Spanning Trees. ACM Trans. Program. Lang. Syst. 5(1): 66-77 (1983)
1970 – 1979
- 1977
- [c6]Philip M. Spira:
Communication Complexity of Distributed Minimum Spanning Tree Algorithms. Berkeley Workshop 1977: 236- - 1976
- [j8]J. Ian Munro, Philip M. Spira:
Sorting and Searching in Multisets. SIAM J. Comput. 5(1): 1-8 (1976) - 1975
- [j7]Philip M. Spira, A. Pan:
On Finding and Updating Spanning Trees and Shortest Paths. SIAM J. Comput. 4(3): 375-380 (1975) - 1973
- [j6]Philip M. Spira:
A New Algorithm for Finding all Shortest Paths in a Graph of Positive Arcs in Average Time 0(n2 log2n). SIAM J. Comput. 2(1): 28-32 (1973) - [j5]Philip M. Spira:
Computation Times of Arithmetic and Boolean Functions in (d, r) Circuits. IEEE Trans. Computers 22(6): 552-555 (1973) - [c5]Philip M. Spira, A. Pan:
On Finding and Updating Shortest Paths and Spanning Trees. SWAT 1973: 82-84 - 1972
- [j4]Philip M. Spira:
Complete Linear Proofs of Systems of Linear Inequalities. J. Comput. Syst. Sci. 6(3): 205-216 (1972) - 1971
- [j3]Philip M. Spira:
On the Time Necessary to Compute Switching Functions. IEEE Trans. Computers 20(1): 104-105 (1971) - [c4]Philip M. Spira:
Complete Linear Proofs of Systems of Linear Inequalities. SWAT 1971: 202-206 - 1970
- [j2]Philip M. Spira:
On the computational complexity of finite functions and semigroup multiplication. Inf. Sci. 2(1): 35-49 (1970)
1960 – 1969
- 1969
- [j1]Philip M. Spira:
The Time Required for Group Multiplication. J. ACM 16(2): 235-243 (1969) - [c3]Philip M. Spira:
On the Computation Time of Certain Classes of Boolean Functions. STOC 1969: 271-272 - 1968
- [c2]Philip M. Spira:
On the Computation Time of Finite Functions. SWAT 1968: 69-75 - 1967
- [c1]Philip M. Spira, Michael A. Arbib:
Computation Times for Finite Groups, Semigroups and Automata. SWAT 1967: 291-295
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint