| Linear pattern matching algorithms P Weiner 14th Annual Symposium on Switching and Automata Theory (swat 1973), 1-11, 1973 | 2673 | 1973 |
| The design of minimum-cost survivable networks K Steiglitz, P Weiner, D Kleitman IEEE Transactions on Circuit Theory 16 (4), 455-460, 1969 | 314 | 1969 |
| On the state minimization of nondeterministic finite automata T Kameda, P Weiner IEEE Transactions on Computers 100 (7), 617-627, 1970 | 174 | 1970 |
| An infinite hierarchy of intersections of context-free languages LY Liu, P Weiner Mathematical systems theory 7, 185-192, 1973 | 74 | 1973 |
| A fast algorithm for the disjunctive decomposition of switching functions VYS Shen, AC McKellar, P Weiner IEEE Transactions on Computers 100 (3), 304-309, 1971 | 44 | 1971 |
| Neighborhood search algorithms for guaranteeingoptimal traveling salesman tours must be inefficient S Savage, P Weiner, A Bagchi Journal of Computer and System Sciences 12 (1), 25-35, 1976 | 37 | 1976 |
| Optimization of reduced dependencies for synchronous sequential machines P Weiner, EJ Smith IEEE Transactions on Electronic Computers, 835-847, 1967 | 34 | 1967 |
| Modular decomposition of synchronous sequential machines P Weiner, JE Hopcroft 8th Annual Symposium on Switching and Automata Theory (SWAT 1967), 233-239, 1967 | 29 | 1967 |
| A characterization of semilinear sets LY Liu, P Weiner Journal of Computer and System Sciences 4 (4), 299-307, 1970 | 21 | 1970 |
| On the number of distinct state assignments for synchronous sequential machines P Weiner, EJ Smith IEEE Transactions on Electronic Computers, 220-221, 1967 | 21 | 1967 |
| Universal two state machines: Characterization theorems and decomposition schemes JD Ullman, P Weiner 9th Annual Symposium on Switching and Automata Theory (swat 1968), 413-426, 1968 | 19 | 1968 |
| Neighborhood search algorithms for finding optimal traveling salesman tours must be inefficient P Weiner, SL Savage, A Bagchi Proceedings of the Fifth Annual ACM Symposium on theory of Computing, 207-213, 1973 | 16 | 1973 |
| Bounded fan-in, bounded fan-out uniform decompositions of synchronous sequential machines P Weiner, JE Hopcroft Proceedings of the IEEE 56 (7), 1219-1220, 1968 | 15 | 1968 |
| Convergent local search SL Savage, P Weiner, MJ Krone Yale University. Department of Computer Science, 1973 | 10 | 1973 |
| Uniform synthesis of sequential circuits JD Ullman, P Weiner Bell System Technical Journal 48 (5), 1115-1127, 1969 | 9 | 1969 |
| Discussion of some flaws in the classical theory of two-level minimization of multiple-output switching networks P Weiner, TF Dwyer IEEE Transactions on Computers 100 (2), 184-186, 1968 | 9 | 1968 |
| Finite-reversal pushdown automata and semi-linear sets L Liu, P Weiner Proc. of Sec. Ann. Princeton Conf. on Inf. Sciences and Systems, 334-338, 1968 | 8 | 1968 |
| Mixed Memory Type Realizations of Sequential Machines P Weiner, TA Dolotta IEEE Transactions on Computers 100 (3), 272-277, 1969 | 7 | 1969 |
| Some unsolvable problems and partial solutions D Tsichritzis, P Weiner (No Title), 1968 | 7 | 1968 |
| On the heuristic design of binary search trees P Weiner Proc. Fifth Annual Princeton Conference, Princeton, NJ, 1971 | 6 | 1971 |
John HopcroftCornell Universityایمیل تأیید شده در cs.cornell.edu