Paterson, Michael S.
Overview
Works:  61 works in 183 publications in 2 languages and 2,991 library holdings 

Genres:  Conference papers and proceedings 
Roles:  Author, Editor, Other, Creator 
Publication Timeline
.
Most widely held works by
Michael S Paterson
Boolean function complexity by
M. S Paterson(
)
9 editions published in 1992 in English and held by 1,136 WorldCat member libraries worldwide
By considering the size of the logical network needed to perform a given computational task, the intrinsic difficulty of that task can be examined. Boolean function complexity, the combinatorial study of such networks, is a subject that started back in the 1950s and has today become one of the most challenging and vigorous areas of theoretical computer science. The papers in this book stem from the London Mathematical Society Symposium on Boolean Function Complexity held at Durham University in July 1990. The range of topics covered will be of interest to the newcomer to the field as well as the expert, and overall the papers are representative of the research presented at the Symposium. Anyone with an interest in Boolean Function complexity will find that this book is a necessary purchase
9 editions published in 1992 in English and held by 1,136 WorldCat member libraries worldwide
By considering the size of the logical network needed to perform a given computational task, the intrinsic difficulty of that task can be examined. Boolean function complexity, the combinatorial study of such networks, is a subject that started back in the 1950s and has today become one of the most challenging and vigorous areas of theoretical computer science. The papers in this book stem from the London Mathematical Society Symposium on Boolean Function Complexity held at Durham University in July 1990. The range of topics covered will be of interest to the newcomer to the field as well as the expert, and overall the papers are representative of the research presented at the Symposium. Anyone with an interest in Boolean Function complexity will find that this book is a necessary purchase
Combinatorics, algorithms, probabilistic and experimental methodologies : first international symposium, ESCAPE 2007, Hangzhou,
China, April 79, 2007 ; revised selected papers by
Bo Chen(
)
23 editions published in 2007 in English and Undetermined and held by 570 WorldCat member libraries worldwide
The First International Symposium on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies was held in Hangzhou, China, in April 2007. The symposium provided an interdisciplinary forum for researchers to share their discoveries and approaches; search for ideas, methodologies, and tool boxes; find better, faster, and more accurate solutions; and develop a research agenda of common interest. This volume constitutes the refereed postproceedings of the symposium. Inside you'll find 46 full papers. They represent some of the most important thinking and advancements in the field. The papers address large data processing problems using different methodologies from major disciplines such as computer science, combinatorics, and statistics
23 editions published in 2007 in English and Undetermined and held by 570 WorldCat member libraries worldwide
The First International Symposium on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies was held in Hangzhou, China, in April 2007. The symposium provided an interdisciplinary forum for researchers to share their discoveries and approaches; search for ideas, methodologies, and tool boxes; find better, faster, and more accurate solutions; and develop a research agenda of common interest. This volume constitutes the refereed postproceedings of the symposium. Inside you'll find 46 full papers. They represent some of the most important thinking and advancements in the field. The papers address large data processing problems using different methodologies from major disciplines such as computer science, combinatorics, and statistics
Automata, languages, and programming : 17th international colloquium, Warwick University, England, July 1620, 1990 : proceedings by
Michael S Paterson(
Book
)
25 editions published between 1987 and 1990 in English and held by 402 WorldCat member libraries worldwide
"This volume contains the proceedings of ICALP 90, the International Colloquium on Automata, Languages and Programming sponsored by the European Association for Theoretical Computer Science (EATCS). This annual conference series covers all important areas of theoretical computer science, such as computability, automata, formal languages, analysis of algorithms, computational complexity, data types and data structures, theory of data bases and knowledge bases, semantics of programming languages, program specification, transformation and verification, foundations of logic programming, theory of logical design and layout, parallel and distributed computation, theory of concurrency, symbolic and algebraic computation, term rewriting systems, computational geometry, cryptography, and theory of robotics. This volume contains five invited papers and 52 papers selected from 250 submitted."PUBLISHER'S WEBSITE
25 editions published between 1987 and 1990 in English and held by 402 WorldCat member libraries worldwide
"This volume contains the proceedings of ICALP 90, the International Colloquium on Automata, Languages and Programming sponsored by the European Association for Theoretical Computer Science (EATCS). This annual conference series covers all important areas of theoretical computer science, such as computability, automata, formal languages, analysis of algorithms, computational complexity, data types and data structures, theory of data bases and knowledge bases, semantics of programming languages, program specification, transformation and verification, foundations of logic programming, theory of logical design and layout, parallel and distributed computation, theory of concurrency, symbolic and algebraic computation, term rewriting systems, computational geometry, cryptography, and theory of robotics. This volume contains five invited papers and 52 papers selected from 250 submitted."PUBLISHER'S WEBSITE
Algorithms  ESA 2000 : 8th annual European symposium, Saarbrücken, Germany, September 58, 2000 : proceedings by
Michael S Paterson(
)
20 editions published in 2000 in English and held by 392 WorldCat member libraries worldwide
This book constitutes the refereed proceedings of the 8th Annual European Symposium on Algorithms, ESA 2000, held in Saarbrcken, Germany in September 2000. The 39 revised full papers presented together with two invited papers were carefully reviewed and selected for inclusion in the book. Among the topics addressed are parallelism, distributed systems, approximation, combinatorial optimization, computational biology, computational geometry, externalmemory algorithms, graph algorithms, network algorithms, online algorithms, data compression, symbolic computation, pattern matching, and randomized algorithms
20 editions published in 2000 in English and held by 392 WorldCat member libraries worldwide
This book constitutes the refereed proceedings of the 8th Annual European Symposium on Algorithms, ESA 2000, held in Saarbrcken, Germany in September 2000. The 39 revised full papers presented together with two invited papers were carefully reviewed and selected for inclusion in the book. Among the topics addressed are parallelism, distributed systems, approximation, combinatorial optimization, computational biology, computational geometry, externalmemory algorithms, graph algorithms, network algorithms, online algorithms, data compression, symbolic computation, pattern matching, and randomized algorithms
Combinatorial pattern matching : 10th annual symposium, CPM 99, Warwick University, UK, July 2224, 1999 : proceedings by
Maxime Crochemore(
Book
)
15 editions published in 1999 in English and held by 310 WorldCat member libraries worldwide
Annotation
15 editions published in 1999 in English and held by 310 WorldCat member libraries worldwide
Annotation
Combinatorial Pattern Matching 10th Annual Symposium, CPM 99 Warwick University, UK, July 2224, 1999 Proceedings by
Maxime Crochemore(
)
1 edition published in 1999 in English and held by 29 WorldCat member libraries worldwide
1 edition published in 1999 in English and held by 29 WorldCat member libraries worldwide
Impossibility of distributed consensus with one faulty process by
Michael J Fischer(
Book
)
4 editions published in 1982 in English and held by 9 WorldCat member libraries worldwide
The consensus problem involves an asynchronous system of processes, some of which may be unreliable. The problem is for the reliable processes to agree on a binary value. We show that every protocol for this problem has the possibility of nontermination, even with only one faulty process. By way of contrast, solutions are known for the synchronous case, the Byzantine Generals problem. (Author)
4 editions published in 1982 in English and held by 9 WorldCat member libraries worldwide
The consensus problem involves an asynchronous system of processes, some of which may be unreliable. The problem is for the reliable processes to agree on a binary value. We show that every protocol for this problem has the possibility of nontermination, even with only one faulty process. By way of contrast, solutions are known for the synchronous case, the Byzantine Generals problem. (Author)
Shallow multiplication circuits by
Michael S Paterson(
Book
)
3 editions published between 1990 and 1992 in English and held by 8 WorldCat member libraries worldwide
By using several different representation standards, the depth of multiplication circuits can be surprisingly reduced to 3.48 log₂n (again two output numbers are produced). We introduce bit level redundancy by using a novel coding scheme in which each bit is distributed over four wires. Interestingly, the information on these four wires is usually not transmitted simultaneously. Finally, an analogy is made between the optimisation problem faced by the circuit designer and the optimisation problem faced by an investor, offered a collection of financial investment plans, each involving perhaps several different currencies. This analogy is used to obtain intuitive explanations of the results obtained."
3 editions published between 1990 and 1992 in English and held by 8 WorldCat member libraries worldwide
By using several different representation standards, the depth of multiplication circuits can be surprisingly reduced to 3.48 log₂n (again two output numbers are produced). We introduce bit level redundancy by using a novel coding scheme in which each bit is distributed over four wires. Interestingly, the information on these four wires is usually not transmitted simultaneously. Finally, an analogy is made between the optimisation problem faced by the circuit designer and the optimisation problem faced by an investor, offered a collection of financial investment plans, each involving perhaps several different currencies. This analogy is used to obtain intuitive explanations of the results obtained."
A faster algorithm computing string edit distances by W. J Masek(
Book
)
3 editions published in 1978 in Undetermined and English and held by 7 WorldCat member libraries worldwide
3 editions published in 1978 in Undetermined and English and held by 7 WorldCat member libraries worldwide
Stringmatching and other products by
Michael J Fischer(
Book
)
2 editions published in 1974 in English and held by 6 WorldCat member libraries worldwide
The stringmatching problem considered is to find all occurrences of a given pattern as a substring of another longer string. When the pattern is simply a given string of symbols, there is an algorithm due to Morris, Knuth and Pratt which has a running time proportional to the total length of the pattern and long string together. This time may be achieved even on a Turing machine. The more difficult case where either string may have don't care symbols which are deemed to match with all symbols is also considered. By exploiting the formal similarity of stringmatching with integer multiplication, a new algorithm has been obtained with a running time which is only slightly worse than linear. (Author)
2 editions published in 1974 in English and held by 6 WorldCat member libraries worldwide
The stringmatching problem considered is to find all occurrences of a given pattern as a substring of another longer string. When the pattern is simply a given string of symbols, there is an algorithm due to Morris, Knuth and Pratt which has a running time proportional to the total length of the pattern and long string together. This time may be achieved even on a Turing machine. The more difficult case where either string may have don't care symbols which are deemed to match with all symbols is also considered. By exploiting the formal similarity of stringmatching with integer multiplication, a new algorithm has been obtained with a running time which is only slightly worse than linear. (Author)
Optimal embedding of a toroidal mesh in a path by
Michael S Paterson(
Book
)
3 editions published in 1991 in English and German and held by 6 WorldCat member libraries worldwide
Abstract: "We prove that the dilation of an m X n toroidal mesh in an mnvertex path equals 2 min[m, n], if m [does not equal] n and 2n  1, if m = n."
3 editions published in 1991 in English and German and held by 6 WorldCat member libraries worldwide
Abstract: "We prove that the dilation of an m X n toroidal mesh in an mnvertex path equals 2 min[m, n], if m [does not equal] n and 2n  1, if m = n."
An introduction to Boolean function complexity by
Michael S Paterson(
Book
)
3 editions published in 1976 in English and held by 5 WorldCat member libraries worldwide
The complexity of a finite Boolean function may be defined with respect to its computation by networks of logical elements in a variety of ways. The three complexities of circuit size, formula size and depth are considered, and some of the principal results concerning their relationships and estimations are presented, with outlined proofs for some of ths simpler theorems. This survey is restricted to networks in which all twoargument logical functions may be used
3 editions published in 1976 in English and held by 5 WorldCat member libraries worldwide
The complexity of a finite Boolean function may be defined with respect to its computation by networks of logical elements in a variety of ways. The three complexities of circuit size, formula size and depth are considered, and some of the principal results concerning their relationships and estimations are presented, with outlined proofs for some of ths simpler theorems. This survey is restricted to networks in which all twoargument logical functions may be used
Comparative schematology by
Michael S Paterson(
Book
)
3 editions published between 1970 and 1978 in English and held by 5 WorldCat member libraries worldwide
While we may have the intuitive idea of one programming language having greater power than another, or of some subset of a language being an adequate 'core' for that language, we find when we try to formalize this notion that there is a serious theoretical difficulty. This lies in the fact that even quite rudimentary languages are nevertheless 'universal' in the following sense. If the language allows us to program with simple arithemtic or listprocessing functions than any effective control structure can be simulated, traditionally, by encoding a Turing machine computation in some way. In particular, a simple language with some basic arithmetic can express programs for any partial recursive function. Such an encoding is usually quite unnatural and impossibly inefficient. Thus in order to carry on a practical study of the comparative power of different languages we are led to banish explicit functions and deal instead with abstract, uninterpreted programs, or schemas. What follows is a brief report on some preliminary exploration in this area. (Author)
3 editions published between 1970 and 1978 in English and held by 5 WorldCat member libraries worldwide
While we may have the intuitive idea of one programming language having greater power than another, or of some subset of a language being an adequate 'core' for that language, we find when we try to formalize this notion that there is a serious theoretical difficulty. This lies in the fact that even quite rudimentary languages are nevertheless 'universal' in the following sense. If the language allows us to program with simple arithemtic or listprocessing functions than any effective control structure can be simulated, traditionally, by encoding a Turing machine computation in some way. In particular, a simple language with some basic arithmetic can express programs for any partial recursive function. Such an encoding is usually quite unnatural and impossibly inefficient. Thus in order to carry on a practical study of the comparative power of different languages we are led to banish explicit functions and deal instead with abstract, uninterpreted programs, or schemas. What follows is a brief report on some preliminary exploration in this area. (Author)
Dense edgedisjoint embedding of binary trees in the mesh by
Alan Gibbons(
Book
)
2 editions published in 1992 in English and held by 5 WorldCat member libraries worldwide
Sush [sic] an embedding offers greater flexibility of use and improves the time complexity of these implementations by a constant factor compared with previously described embeddings."
2 editions published in 1992 in English and held by 5 WorldCat member libraries worldwide
Sush [sic] an embedding offers greater flexibility of use and improves the time complexity of these implementations by a constant factor compared with previously described embeddings."
Efficient binary space partitions for hiddensurface removal and solid modeling by
Michael S Paterson(
Book
)
2 editions published in 1989 in English and held by 5 WorldCat member libraries worldwide
2 editions published in 1989 in English and held by 5 WorldCat member libraries worldwide
Comparative schematology by
Michael S Paterson(
Book
)
3 editions published in 1978 in Undetermined and English and held by 5 WorldCat member libraries worldwide
3 editions published in 1978 in Undetermined and English and held by 5 WorldCat member libraries worldwide
Upper bounds for the expected length of a longest common subsequence of two binary sequences by Vlado Dancík(
Book
)
2 editions published in 1993 in English and held by 4 WorldCat member libraries worldwide
Abstract: "Let f(n) be the expected length of a longest common subsequences [sic] of two random binary sequences of length n. It is known that the limit c = lim [subscript n [>] [infinity]]f(n)/n exists. Improved upper bounds for c are given using a new method."
2 editions published in 1993 in English and held by 4 WorldCat member libraries worldwide
Abstract: "Let f(n) be the expected length of a longest common subsequences [sic] of two random binary sequences of length n. It is known that the limit c = lim [subscript n [>] [infinity]]f(n)/n exists. Improved upper bounds for c are given using a new method."
The memory game by
Uri Zwick(
Book
)
2 editions published in 1991 in English and held by 4 WorldCat member libraries worldwide
2 editions published in 1991 in English and held by 4 WorldCat member libraries worldwide
Identities from partition involutions by
Donald Ervin Knuth(
Book
)
4 editions published in 1977 in English and Undetermined and held by 4 WorldCat member libraries worldwide
4 editions published in 1977 in English and Undetermined and held by 4 WorldCat member libraries worldwide
Computer science seminars 1992/93 by
Michael S Paterson(
Book
)
1 edition published in 1993 in English and held by 4 WorldCat member libraries worldwide
Abstract: "This report contains the abstracts of the programme of weekly seminars in the Department of Computer Science for the 1992/93 academic year. There were 28 seminars in all: 17 by external speakers and 11 from within the Department. With few exceptions, the seminars were held in the Department's Seminar Room on Tuesday afternoons at 4 pm after an informal gathering for refreshments."
1 edition published in 1993 in English and held by 4 WorldCat member libraries worldwide
Abstract: "This report contains the abstracts of the programme of weekly seminars in the Department of Computer Science for the 1992/93 academic year. There were 28 seminars in all: 17 by external speakers and 11 from within the Department. With few exceptions, the seminars were held in the Department's Seminar Room on Tuesday afternoons at 4 pm after an informal gathering for refreshments."
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Zhang, Guochuan Other
 Chen, Bo Author
 Crochemore, Maxime 1947 Author Editor
 European Association for Theoretical Computer Science
 Chen, Bo Dr
 Fischer, Michael J. Author
 Zwick, Uri Author
 Fischer, Michael J. Author
 ESCAPE 2007 Hangzhou
 ICALP 90
Useful Links
Associated Subjects
Algebra, Boolean Algorithms Artificial intelligence Bioinformatics Bionics Combinations Combinatorial analysis Combinatorial identities Combinatorial probabilities Computational complexity Computer algorithms Computer architecture Computer graphics Computer programming Computers Computer science Computer scienceMathematics Computer simulation Computer software Data mining Data structures (Computer science) Distributed databases Electric circuits Electronic circuit design Electronic circuits Electronic data processingDistributed processing Faulttolerant computing Information retrieval Involutes (Mathematics) Lagrange equations Logic, Symbolic and mathematical Machine theory Mathematics Multiprocessors Optical pattern recognition Parallel processing (Electronic computers) Partitions (Mathematics) Probabilities Problem solving
Covers
Alternative Names
Mike Paterson britischer Informatiker
Mike Paterson britisk informatikar
Mike Paterson britisk informatiker
Mike Paterson Brits informaticus
Mike Paterson brittisk datavetare
Mike Paterson informaticien britannique
Mike Paterson informático teórico del Reino Unido
Paterson, M. S.
Paterson, M. S. 1942
Paterson, M. S. (Michael S.)
Paterson, M. S. (Michael S.), 1942
Paterson Mike
Paterson, Mike 1942
Майк Патерсон
مایک پترسون دانشمند علوم کامپیوتر بریتانیایی
Languages