Home | Amazing | Today | Tags | Publishers | Years | Account | Search 
Theoretical Computer Sciences: Lectures given at a Summer School of the Centro Internazionale Matematico Estivo
Theoretical Computer Sciences: Lectures given at a Summer School of the Centro Internazionale Matematico Estivo

R.E. Miller: Parallel program schemata.- D.E. Muller: Theory of automata.- R. Karp: Computational complexity of combinatorial and graph-theoretic problems.

In this lecture we discuss a type of computer organization which is based upon the concept of operation sequencing being controlled by operand availability. Such sequencing...

Rainbow Connections of Graphs (SpringerBriefs in Mathematics)
Rainbow Connections of Graphs (SpringerBriefs in Mathematics)

Rainbow connections are natural combinatorial measures that are used in applications to secure the transfer of classified information between agencies in communication networks. Rainbow Connections of Graphs covers this new and emerging topic in graph theory and brings together a majority of the results that deal with the...

Efficient Algorithms for Listing Combinatorial Structures (Distinguished Dissertations in Computer Science)
Efficient Algorithms for Listing Combinatorial Structures (Distinguished Dissertations in Computer Science)

This thesis is concerned with the design of efficient algorithms for listing combinatorial structures. The research described here gives some answers to the following questions: which families of combinatorial structures have fast computer algorithms for listing their members, What general methods are useful for listing combinatorial...

   
   
   
Result Page: 10 9 8 7 6 5 4 3 2 1 
©2019 LearnIT (support@pdfchm.net) - Privacy Policy