WorldCat Identities

Johnson, David S. 1945-

Overview
Works: 20 works in 165 publications in 4 languages and 2,332 library holdings
Genres: Conference papers and proceedings  Bibliography 
Roles: Author, Editor, Other
Publication Timeline
.
Most widely held works about David S Johnson
 
Most widely held works by David S Johnson
Computers and intractability : a guide to the theory of NP-completeness by Michael R Garey( Book )

60 editions published between 1979 and 2009 in English and Spanish and held by 1,303 WorldCat member libraries worldwide

"Shows how to recognize NP-complete problems and offers proactical suggestions for dealing with them effectively. The book covers the basic theory of NP-completeness, provides an overview of alternative directions for further research, and contains and extensive list of NP-complete and NP-hard problems, with more than 300 main entries and several times as many results in total. [This book] is suitable as a supplement to courses in algorithm design, computational complexity, operations research, or combinatorial mathematics, and as a text for seminars on approximation algorithms or computational complexity. It provides not only a valuable source of information for students but also an essential reference work for professionals in computer science"--Back cover
Discrete algorithms and complexity : proceedings of the Japan-US Joint Seminar, June 4-6, 1986, Kyoto, Japan by David S Johnson( Book )

19 editions published between 1987 and 2014 in English and Undetermined and held by 243 WorldCat member libraries worldwide

Discrete Algorithms and Complexity
Cliques, coloring, and satisfiability : second DIMACS implementation challenge, October 11-13, 1993 by DIMACS implementation challenge Workshop( Book )

16 editions published in 1996 in English and held by 162 WorldCat member libraries worldwide

Network flows and matching : first DIMACS implementation challenge by David S Johnson( Book )

11 editions published in 1993 in English and held by 118 WorldCat member libraries worldwide

Interest has grown recently in the application of computational and statistical tools to problems in the analysis of algorithms. In many algorithmic domains worst-case bounds are too pessimistic and tractable probabilistic models too unrealistic to provide meaningful predictions of practical algorithmic performance. Experimental approaches can provide knowledge where purely analytical methods fail and can provide insights to motivate and guide deeper analytical results. The DIMACS Implementation Challenge was organized to encourage experimental work in the area of network flows and matchings
Data structures, near neighbor searches, and methodology : fifth and sixth DIMACS implementation challenges : papers related to the DIMACS challenge on dictionaries and priority queues (1995-1996) and the DIMACS challenge on near neighbor searches (1998-1999) by Michael H Goldwasser( Book )

8 editions published in 2002 in English and Undetermined and held by 114 WorldCat member libraries worldwide

This book presents reviewed and revised papers from the fifth and sixth DIMACS Implementation Challenge workshops. These workshops, held approximately annually, aim at encouraging high-quality work in experimental analysis of data structures and algorithms. The papers published in this volume are the results of year-long coordinated research projects and contain new findings and insights. Three papers address the performance evaluation of implementations for two fundamental data structures, dictionaries and priority queues, as used in the context of real applications. Another four papers consi
The shortest path problem : ninth DIMACS implementation challenge by DIMACS implementation challenge( Book )

4 editions published in 2009 in English and held by 86 WorldCat member libraries worldwide

Shortest path problems are among the most fundamental combinatorial optimization problems with many applications, both direct and as subroutines. They arise naturally in a remarkable number of real-world settings. A limited list includes transportation planning, network optimization, packet routing, image segmentation, speech recognition, document formatting, robotics, compilers, traffic information systems, and dataflow analysis. Shortest path algorithms have been studied since the 1950's and still remain an active area of research. This volume reports on the research carried out by participa
STOC/FOCS bibliography : (preliminary version) by David S Johnson( Book )

12 editions published in 1991 in 3 languages and held by 75 WorldCat member libraries worldwide

Near-optimal bin packing algorithms by David S Johnson( Book )

9 editions published between 1973 and 1987 in English and Undetermined and held by 21 WorldCat member libraries worldwide

Computational complexity and the traveling salesman problem by David S Johnson( Book )

3 editions published in 1981 in English and held by 9 WorldCat member libraries worldwide

Vyčislitel'nye mašiny i trudnorešaemye zadači by Michael R Garey( Book )

4 editions published in 1982 in Russian and held by 7 WorldCat member libraries worldwide

Look-ahead strategies in one person games with randomly generated game trees by David S Johnson( Book )

5 editions published between 1968 and 1970 in English and held by 6 WorldCat member libraries worldwide

The complexity of the network design problem (preprint) by D. S Johnson( Book )

2 editions published in 1977 in English and held by 3 WorldCat member libraries worldwide

Studies of the structure of the atmosphere over the eastern Pacific Ocean in summer by Morris Neiburger( Book )

2 editions published in 1961 in English and held by 3 WorldCat member libraries worldwide

Computational methods for graph coloring and its generalizations( Book )

3 editions published between 2007 and 2008 in English and held by 3 WorldCat member libraries worldwide

Network flows and matching : Challenge workshop : Selected papers( Book )

1 edition published in 1993 in English and held by 1 WorldCat member library worldwide

Selected papers from the First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), January 22-24, 1990, San Francisco by ACM-SIAM Symposium on Discrete Algorithms( )

1 edition published in 1993 in English and held by 1 WorldCat member library worldwide

Satellite capabilities to 1995 for meteorology and operational hydrology by D. S Johnson( Book )

1 edition published in 1984 in English and held by 1 WorldCat member library worldwide

Proceedings of the fifteenth annual ACM symposium on Theory of computing by David S Johnson( )

2 editions published in 1983 in English and held by 0 WorldCat member libraries worldwide

Cliques, Coloring, and Satisfiability by David S Johnson( )

1 edition published in 1996 in English and held by 0 WorldCat member libraries worldwide

The purpose of a DIMACS Challenge is to encourage and coordinate research in the experimental analysis of algorithms. The First DIMACS Challenge encouraged experimental work in the area of network flow and matchings. The Second DIMACS Challenge, on which this volume is based, took place in conjunction with the DIMACS Special Year on Combinatorial Optimization. Addressed here are three difficult combinatorial optimization problems: finding cliques in a graph, coloring the vertices of a graph, and solving instances of the satisfiability problem. These problems were chosen both for their practica
 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.60 (from 0.49 for Selected p ... to 0.99 for Johnson, D ...)

Computers and intractability : a guide to the theory of NP-completeness
Alternative Names
David Johnson

David S. Johnson Amerikaans informaticus

David S. Johnson amerikai informatikus

David S. Johnson amerikansk ingeniør og informatikar

David S. Johnson amerikansk ingeniør og informatiker

David S. Johnson amerikansk ingenjör och datavetare

David S. Johnson informaticien américain

David Stifler Johnson

David Stifler Johnson cientista da computação estadunidense

David Stifler Johnson US-amerikanischer Informatiker

Džonson, D.

Džonson, Dèvid.

Garey, Michael R.

Johnson, David S

Johnson, David Stifler.

Джонсон, Д 1945-

Джонсон, Д. (Дэвид), 1945-

دايفيد جونسون

دیوید اس. جانسون دانشمند علوم کامپیوتر و مهندس آمریکایی

डेविड एस जॉनसन

데이비드 S. 존슨

デイヴィッド・S・ジョンソン

大衛·S·約翰遜

Languages
English (154)

Russian (4)

Spanish (2)

German (1)

Covers
Data structures, near neighbor searches, and methodology : fifth and sixth DIMACS implementation challenges : papers related to the DIMACS challenge on dictionaries and priority queues (1995-1996) and the DIMACS challenge on near neighbor searches (1998-1999)The shortest path problem : ninth DIMACS implementation challenge