|
Showing 1 - 6 of
6 matches in All Departments
This book constitutes the refereed proceedings of the First
Mediterranean Conference on Algorithms, MedAlg2012, held in Kibbutz
Ein Gedi, Israel, in December 2012.
The 18 papers presented were carefully reviewed and selected from
44 submissions. The conference papers focus on the design,
engineering, theoretical and experimental performance analysis of
algorithms for problems arising in different areas of computation.
Topics covered include: communications networks, combinatorial
optimization and approximation, parallel and distributed computing,
computer systems and architecture, economics, game theory, social
networks and the World Wide Web."
This book constitutes the refereed proceedings of the 19th
International Colloquium on Structural Information and
Communication Complexity, SIROCCO 2012, held in Reykjavik, Iceland
for 3 days starting June 30, 2012. The 28 revised full papers
presented were carefully reviewed and selected from 54 submissions.
SIROCCO is devoted to the study of communication and knowledge in
distributed systems. Special emphasis is given to innovative
approaches and fundamental understanding, in addition to efforts to
optimize current designs. The typical areas include distributed
computing, communication networks, game theory, parallel computing,
social networks, mobile computing (including autonomous robots),
peer to peer systems, communication complexity, fault tolerant
graph theories, and randomized/probabilistic issues in networks.
This textbook, based on the authors' fifteen years of teaching, is
a complete teaching tool for turning students into logic designers
in one semester. Each chapter describes new concepts, giving
extensive applications and examples. Assuming no prior knowledge of
discrete mathematics, the authors introduce all background in
propositional logic, asymptotics, graphs, hardware and electronics.
Important features of the presentation are: * All material is
presented in full detail. Every designed circuit is formally
specified and implemented, the correctness of the implementation is
proved, and the cost and delay are analyzed * Algorithmic solutions
are offered for logical simulation, computation of propagation
delay and minimum clock period * Connections are drawn from the
physical analog world to the digital abstraction * The language of
graphs is used to describe formulas and circuits * Hundreds of
figures, examples and exercises enhance understanding. The
extensive website (http://www.eng.tau.ac.il/~guy/Even-Medina/)
includes teaching slides, links to Logisim and a DLX assembly
simulator.
Shimon Even's Graph Algorithms, published in 1979, was a seminal
introductory book on algorithms read by everyone engaged in the
field. This thoroughly revised second edition, with a foreword by
Richard M. Karp and notes by Andrew V. Goldberg, continues the
exceptional presentation from the first edition and explains
algorithms in a formal but simple language with a direct and
intuitive presentation. The book begins by covering basic material,
including graphs and shortest paths, trees, depth-first-search and
breadth-first search. The main part of the book is devoted to
network flows and applications of network flows, and it ends with
chapters on planar graphs and testing graph planarity.
Shimon Even's Graph Algorithms, published in 1979, was a seminal
introductory book on algorithms read by everyone engaged in the
field. This thoroughly revised second edition, with a foreword by
Richard M. Karp and notes by Andrew V. Goldberg, continues the
exceptional presentation from the first edition and explains
algorithms in a formal but simple language with a direct and
intuitive presentation. The book begins by covering basic material,
including graphs and shortest paths, trees, depth-first-search and
breadth-first search. The main part of the book is devoted to
network flows and applications of network flows, and it ends with
chapters on planar graphs and testing graph planarity.
This textbook, based on the authors' fifteen years of teaching, is
a complete teaching tool for turning students into logic designers
in one semester. Each chapter describes new concepts, giving
extensive applications and examples. Assuming no prior knowledge of
discrete mathematics, the authors introduce all background in
propositional logic, asymptotics, graphs, hardware and electronics.
Important features of the presentation are: * All material is
presented in full detail. Every designed circuit is formally
specified and implemented, the correctness of the implementation is
proved, and the cost and delay are analyzed * Algorithmic solutions
are offered for logical simulation, computation of propagation
delay and minimum clock period * Connections are drawn from the
physical analog world to the digital abstraction * The language of
graphs is used to describe formulas and circuits * Hundreds of
figures, examples and exercises enhance understanding. The
extensive website (http://www.eng.tau.ac.il/~guy/Even-Medina/)
includes teaching slides, links to Logisim and a DLX assembly
simulator.
|
|