Search results for "SWAT"

Hits ?▲	Authors	Title	Venue	Year	Link
1		15th Annual Symposium on Switching and Automata Theory, New Orleans, Louisiana, USA, October 14-16, 1974	SWAT	1974	DBLP BibTeX RDF
1	Christoph M. Hoffmann, Lawrence H. Landweber	Axiomatic Equivalence of Programs with Structured Variables	SWAT	1974	DBLP DOI BibTeX RDF
1	Bruno Courcelle	Recursive Schemes, Algebraic Trees and Deterministic Languages	SWAT	1974	DBLP DOI BibTeX RDF
1	Joseph A. Goguen, James W. Thatcher	Initial Algebra Semantics	SWAT	1974	DBLP DOI BibTeX RDF
1	Michel Hack	The Recursive Equivalence of the Reachability Problem and the Liveness Problem for Petri Nets and Vector Addition Systems	SWAT	1974	DBLP DOI BibTeX RDF
1	Emily P. Friedman	Relationships between Monadic Recursion Schemes and Deterministic Context-Free Languages	SWAT	1974	DBLP DOI BibTeX RDF
1	Charles R. Baugh	Chow Parameters in Pseudothreshold Logic	SWAT	1973	DBLP DOI BibTeX RDF
1	William H. Joyner Jr.	Automatic Theorem-Proving and the Decision Problem	SWAT	1973	DBLP DOI BibTeX RDF
1	Lenore Blum, Manuel Blum 0001	Inductive Inference: A Recursion Theoretic Approach	SWAT	1973	DBLP DOI BibTeX RDF
1	Ashok K. Chandra	Efficient Compilation of Linear Recursive Programs	SWAT	1973	DBLP DOI BibTeX RDF
1	Peter Weiner	Linear Pattern Matching Algorithms	SWAT	1973	DBLP DOI BibTeX RDF
1	Ivan Hal Sudborough	On Tape-Bounded Complexity Classes and Multi-Head Finite Automata	SWAT	1973	DBLP DOI BibTeX RDF
1	Henry Y. H. Chuang, Santanu Das	Multiple-Input Change Asynchronous Machines Using Controlled Excitation and Flip-Flops	SWAT	1973	DBLP DOI BibTeX RDF
1	William C. Rounds	Complexity of Recognition in Intermediate-Level Languages	SWAT	1973	DBLP DOI BibTeX RDF
1	Hartmut Ehrig, Michael Pfender, Hans Jürgen Schneider	Graph-Grammars: An Algebraic Approach	SWAT	1973	DBLP DOI BibTeX RDF
1	John C. Cherniavsky	The Complexity of Some Non-Classical Logics	SWAT	1973	DBLP DOI BibTeX RDF
1	Jon G. Bredeson	On Multiple Input Change Hazard-Free Combinatorial Switching Circuits without Feedback	SWAT	1973	DBLP DOI BibTeX RDF
1	Matthew M. Geller, Michael A. Harrison	Characterizations of LR(0) Languages (Extended Abstract)	SWAT	1973	DBLP DOI BibTeX RDF
1	Kurt Mehlhorn	On the Size of Sets of Computable Functions	SWAT	1973	DBLP DOI BibTeX RDF
1	Jean-Marie Cadiou, Jean-Jacques Lévy	Mechanizable Proofs about Parallel Processes	SWAT	1973	DBLP DOI BibTeX RDF
1	Michael Machtey	A Notion of Helping and Pseudo-Complementation in Lattices of Honest Subrecursive Classes	SWAT	1973	DBLP DOI BibTeX RDF
1	Sam L. Savage	Statistical Indicators of Optimality	SWAT	1973	DBLP DOI BibTeX RDF
1	M. Dennis Mickunas, Victor B. Schneider	On the Ability to Cover LR(k) Grammars with LR(1), SLR(1), and (1,1) Bounded-Context Grammars	SWAT	1973	DBLP DOI BibTeX RDF
1	Paul Young	Optimization among Provably Equivalent Programs (Preliminary Abstract)	SWAT	1973	DBLP DOI BibTeX RDF
1	Vaughan R. Pratt, Foong Frances Yao	On Lower Bounds for Computing the i-th Largest Element	SWAT	1973	DBLP DOI BibTeX RDF
1	Joel I. Seiferas, Michael J. Fischer, Albert R. Meyer	Refinements of the Nondeterministic Time and Space Hierarchies	SWAT	1973	DBLP DOI BibTeX RDF
1	Philip M. Spira, A. Pan	On Finding and Updating Shortest Paths and Spanning Trees	SWAT	1973	DBLP DOI BibTeX RDF
1	Emily P. Friedman	Equivalence Problems in Monadic Recursion Schemes	SWAT	1973	DBLP DOI BibTeX RDF
1		14th Annual Symposium on Switching and Automata Theory, Iowa City, Iowa, USA, October 15-17, 1973	SWAT	1973	DBLP BibTeX RDF
1	Thomas G. Szymanski, John H. Williams	Non-Canonical Parsing	SWAT	1973	DBLP DOI BibTeX RDF
1	Tiko Kameda, Shunichi Toida	Efficient Algorithms for Determining an Extremal Tree of a Graph (Extended Abstract)	SWAT	1973	DBLP DOI BibTeX RDF
1	David P. Dobkin	On the Optimal Evaluation of a Set of n-Linear Forms	SWAT	1973	DBLP DOI BibTeX RDF
1	Albert R. Meyer, Larry J. Stockmeyer	The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space	SWAT	1972	DBLP DOI BibTeX RDF
1	Sartaj Sahni	Some Related Problems from Network Flows, Game Theory and Integer Programming	SWAT	1972	DBLP DOI BibTeX RDF
1	George Tourlakis, John Mylopoulos	Some Results in Computational Topology	SWAT	1972	DBLP DOI BibTeX RDF
1	Brenda S. Baker, Ronald V. Book	Reversal-Bounded Multi-Pushdown Machines: Extended Abstract	SWAT	1972	DBLP DOI BibTeX RDF
1	Barry K. Rosen	Program Equivalence and Context-Free Grammars	SWAT	1972	DBLP DOI BibTeX RDF
1	John C. Cherniavsky, Robert L. Constable	Representing Program Schemes in Logic	SWAT	1972	DBLP DOI BibTeX RDF
1	C. C. Huang, Richard Y. Kain, Larry L. Kinney	Output Sufficient Modules for Uniform Decomposition of Synchronous Sequential Circuits	SWAT	1972	DBLP DOI BibTeX RDF
1	Kewal K. Saluja, Sudhakar M. Reddy	Multiple Faults in Reed-Muller Canonic Networks	SWAT	1972	DBLP DOI BibTeX RDF
1	Robert M. Keller	On the Decomposition of Asynchronous Systems	SWAT	1972	DBLP DOI BibTeX RDF
1	Nathan Friedman	Some Results on the Effect of Arithmetics on Comparison Problems	SWAT	1972	DBLP DOI BibTeX RDF
1	Mary Shaw, Joseph F. Traub	On the Number of Multiplications for the Evaluation of a Polynomial and All Its Derivatives	SWAT	1972	DBLP DOI BibTeX RDF
1	Sheldon B. Akers Jr.	Universal Test Sets for Logic Networks	SWAT	1972	DBLP DOI BibTeX RDF
1	Albert R. Meyer, Robert Moll	Honest Bounds for Complexity Classes of Recursive Functions	SWAT	1972	DBLP DOI BibTeX RDF
1	T. S. E. Maibaum	The Characterization of the Derivation Trees of Context Free Sets of Terms as Regular Sets	SWAT	1972	DBLP DOI BibTeX RDF
1	Luigi Logrippo	Renamings in Program Schemas (Extended Abstract)	SWAT	1972	DBLP DOI BibTeX RDF
1	R. Hossley, Charles Rackoff	The Emptiness Problem for Automata on Infinite Trees	SWAT	1972	DBLP DOI BibTeX RDF
1		13th Annual Symposium on Switching and Automata Theory, College Park, Maryland, USA, October 25-27, 1972	SWAT	1972	DBLP BibTeX RDF
1	John Mylopoulos	On the Relation of Graph Grammars and Graph Automata	SWAT	1972	DBLP DOI BibTeX RDF
1	Joseph A. Goguen	On Homomorphisms, Simulations, Correctness and Subroutines for Programs and Program Schemes	SWAT	1972	DBLP DOI BibTeX RDF
1	Ellis Horowitz	The Efficient Calculation of Powers of Polynomials	SWAT	1972	DBLP DOI BibTeX RDF
1	J. Robert Jump, P. S. Thiagarajan	On the Equivalence of Asynchronous Control Structures	SWAT	1972	DBLP DOI BibTeX RDF
1	Jean Berstel	On Sets of Numbers Recognized by Push-Down Automata	SWAT	1972	DBLP DOI BibTeX RDF
1	R. Moenck, Allan Borodin	Fast Modular Transforms via Division	SWAT	1972	DBLP DOI BibTeX RDF
1	Denis J. Kfoury	Effective Computability in Algebraic Structures (A Schematology Approach)	SWAT	1972	DBLP DOI BibTeX RDF
1	John L. Bruno, Edward G. Coffman Jr., W. H. Hosken	Consistency of Synchronization Nets using P and V Operations	SWAT	1972	DBLP DOI BibTeX RDF
1	David S. Johnson	Fast Allocation Algorithms	SWAT	1972	DBLP DOI BibTeX RDF
1	C. L. Liu 0001	Optimal Scheduling on Multi-Processor Computing Systems	SWAT	1972	DBLP DOI BibTeX RDF
1	Jeffrey D. Ullman	A Fast Algorithm for the Elimination of Common Subexpressions	SWAT	1972	DBLP DOI BibTeX RDF
1	Sheldon B. Akers Jr.	A Rectangular Logic Array	SWAT	1971	DBLP DOI BibTeX RDF
1	J. Richard Kane, Stephen S. Yau	On the Design of Easily Testable Sequential Machines	SWAT	1971	DBLP DOI BibTeX RDF
1	Eric G. Wagner	Languages for Defining Sets in Arbitrary Algebras	SWAT	1971	DBLP DOI BibTeX RDF
1	Janusz A. Brzozowski, Imre Simon	Characterizations of Locally Testable Events	SWAT	1971	DBLP DOI BibTeX RDF
1	C. L. Liu 0001	Analysis of Sorting Algorithms	SWAT	1971	DBLP DOI BibTeX RDF
1	Edward M. Reingold	Computing the Maximum and the Median	SWAT	1971	DBLP DOI BibTeX RDF
1	Ivan Hal Sudborough	Computation by Multi-Head Finite Automata	SWAT	1971	DBLP DOI BibTeX RDF
1	Mike Paterson, Larry J. Stockmeyer	Bounds on the Evaluation Time for Rational Polynomials	SWAT	1971	DBLP DOI BibTeX RDF
1	H. Raymond Strong	High Level Languages of Maximum Power	SWAT	1971	DBLP DOI BibTeX RDF
1	Robert Endre Tarjan	Depth-First Search and Linear Graph Algorithms (Working Paper)	SWAT	1971	DBLP DOI BibTeX RDF
1	Walter A. Burkhard, F. W. Kroon	Toward a Weakly Invariant Complexity Theory	SWAT	1971	DBLP DOI BibTeX RDF
1		12th Annual Symposium on Switching and Automata Theory, East Lansing, Michigan, USA, October 13-15, 1971	SWAT	1971	DBLP BibTeX RDF
1	Fred G. Abramson	Effective Computation over the Real Numbers	SWAT	1971	DBLP DOI BibTeX RDF
1	Michael L. Dertouzos	Time Bounds on Space Computations	SWAT	1971	DBLP DOI BibTeX RDF
1	Wm. A. Brinsfield, Raymond E. Miller	On the Composition of Parallel Program Schemata	SWAT	1971	DBLP DOI BibTeX RDF
1	Albert R. Meyer, Michael J. Fischer	Economy of Description by Automata, Grammars, and Formal Systems	SWAT	1971	DBLP DOI BibTeX RDF
1	Michael J. Fischer, Albert R. Meyer	Boolean Matrix Multiplication and Transitive Closure	SWAT	1971	DBLP DOI BibTeX RDF
1	D. A. Stern, Hwa C. Torng	NAND Cellular Arrays	SWAT	1971	DBLP DOI BibTeX RDF
1	Edward G. Coffman Jr., Neil D. Jones	Priority Paging Algorithms and the Extension Problem	SWAT	1971	DBLP DOI BibTeX RDF
1	Robert L. Constable, David Gries	On Classes of Program Schemata	SWAT	1971	DBLP DOI BibTeX RDF
1	Lee E. Heindel, Ellis Horowitz	On Decreasing the Computing Time for Modular Arithmetic	SWAT	1971	DBLP DOI BibTeX RDF
1	Alvy Ray Smith III	Two-Dimensional Formal Languages and Pattern Recognition by Cellular Automata	SWAT	1971	DBLP DOI BibTeX RDF
1	Rina S. Cohen, Karel Culík II	LR-Regular Grammars-An Extension of LR(k) Grammars	SWAT	1971	DBLP DOI BibTeX RDF
1	Graziano Frosini, Giovanni B. Gerace	Synthesis of Asynchronous Sequential Circuits with Master-Slave Subcircuits	SWAT	1971	DBLP DOI BibTeX RDF
1	Mohamed Y. Osman, C. Dennis Weiss	Universal Base Functions and Modules for Realizing Arbitrary Switching Functions	SWAT	1971	DBLP DOI BibTeX RDF
1	Philip M. Spira	Complete Linear Proofs of Systems of Linear Inequalities	SWAT	1971	DBLP DOI BibTeX RDF
1	J. Ian Munro, Mike Paterson	Optimal Algorithms for Parallel Polynomial Evaluation	SWAT	1971	DBLP DOI BibTeX RDF
1	John E. Hopcroft, Richard M. Karp	A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs	SWAT	1971	DBLP DOI BibTeX RDF
1	David Gale, Richard M. Karp	A Phenomenon in the Theory of Sorting	SWAT	1970	DBLP DOI BibTeX RDF
1	Tiko Kameda	On the Computational Power of Some Machines with Pushdown-Like Storage	SWAT	1970	DBLP DOI BibTeX RDF
1	Joseph Alphonso Giuliano	Writing Stack Acceptors	SWAT	1970	DBLP DOI BibTeX RDF
1	Alvy Ray Smith III	Cellular Automata and Formal Languages	SWAT	1970	DBLP DOI BibTeX RDF
1	Edwin Roger Banks	Universality in Cellular Automata	SWAT	1970	DBLP DOI BibTeX RDF
1	Dines Bjørner	The Synthesis of Finite State Syntax Directed Top-Down and Bottom-Up Transducers	SWAT	1970	DBLP DOI BibTeX RDF
1		11th Annual Symposium on Switching and Automata Theory, Santa Monica, California, USA, October 28-30, 1970	SWAT	1970	DBLP BibTeX RDF
1	Arie Shoshani, Edward G. Coffman Jr.	Sequencing Tasks in Multiprocess Systems to Avoid Deadlocks	SWAT	1970	DBLP DOI BibTeX RDF
1	Stephen H. Unger	Asynchronous Sequential Switching Circuits with Unrestricted Input Changes	SWAT	1970	DBLP DOI BibTeX RDF
1	Martin A. Fischler, Meyer Tannenbaum	Synchronizing and Representation Problems for Sequential Machines with Masked Outputs	SWAT	1970	DBLP DOI BibTeX RDF
1	Jon G. Bredeson, Paul T. Hulina	Elimination of Static and Dynamic Hazards in Combinatorial Switching Circuits	SWAT	1970	DBLP DOI BibTeX RDF
1	Michel Fliess	Deux applications de la representation matricielle d'une serie rationnelle non commutative	SWAT	1970	DBLP DOI BibTeX RDF

Publications at "SWAT"( http://dblp.L3S.de/Venues/SWAT )