default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeter Weiner
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1970 – 1979
- 1976
[j10]Sam L. Savage, Peter Weiner, A. Bagchi:
Neighborhood Search Algorithms for Guaranteeing Optimal Traveling Salesman Tours Must Be Inefficient. J. Comput. Syst. Sci. 12(1): 25-35 (1976)- 1973
- [j9]Leonard Y. Liu, Peter Weiner:
An Infinite Hierarchy of Intersections of Context-Free Language. Math. Syst. Theory 7(2): 185-192 (1973) - [c6]Peter Weiner:
The file transmission problem. AFIPS National Computer Conference 1973: 453 - [c5]Peter Weiner:
Linear Pattern Matching Algorithms. SWAT 1973: 1-11 - [c4]Peter Weiner, Sam L. Savage, A. Bagchi:
Neighborhood Search Algorithms for Finding Optimal Traveling Salesman Tours Must Be Inefficient. STOC 1973: 207-213 - [e1]Herbert Schorr, Alan J. Perlis, Peter Weiner, W. Donald Frazer:
Proceedings of the Fourth Symposium on Operating System Principles, SOSP 1973, Thomas J. Watson, Research Center, Yorktown Heights, New York, USA, October 15-17, 1973. ACM 1973 [contents] - 1972
- [j8]J. Drilman, Peter Weiner:
Modular Networks and Nondeterministic Sequential Machines. IEEE Trans. Computers 21(10): 1124-1129 (1972) - 1971
- [j7]Vincent Yun-Shen Shen, Archie C. McKellar, Peter Weiner:
A Fast Algorithm for the Disjunctive Decomposition of Switching Functions. IEEE Trans. Computers 20(3): 304-309 (1971) - 1970
- [j6]Leonard Y. Liu, Peter Weiner:
A Characterization of Semilinear Sets. J. Comput. Syst. Sci. 4(4): 299-307 (1970) - [j5]Tsunehiko Kameda, Peter Weiner:
On the State Minimization of Nondeterministic Finite Automata. IEEE Trans. Computers 19(7): 617-627 (1970)
1960 – 1969
- 1969
- [j4]Peter Weiner, Ted A. Dolotta:
Mixed Memory Type Realizations of Sequential Machines. IEEE Trans. Computers 18(3): 272-277 (1969) - [c3]W. Frank King III, Peter Weiner:
On the Modular Decomposition of Autonomous Sequential Machines. SWAT 1969: 213-221 - 1968
- [j3]Peter Weiner, Thomas F. Dwyer:
Discussion of Some Flaws in the Classical Theory of Two-Level Minimization of Multiple-Output Switching Networks. IEEE Trans. Computers 17(2): 184-186 (1968) - [c2]Jeffrey D. Ullman, Peter Weiner:
Universal Two State Machines: Characterization Theorems and Decomposition Schemes. SWAT 1968: 413-426 - 1967
- [j2]Peter Weiner, Edward J. Smith:
On the Number of Distinct State Assignments for Synchronous Sequential Machines. IEEE Trans. Electron. Comput. 16(2): 220-221 (1967) - [j1]Peter Weiner, Edward J. Smith:
Optimization of Reduced Dependencies for Synchronous Sequential Machines. IEEE Trans. Electron. Comput. 16(6): 835-847 (1967) - [c1]Peter Weiner, John E. Hopcroft:
Modular Decomposition of Synchronous Sequential Machines. SWAT 1967: 233-239
Coauthor Index
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-24 23:05 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
