


Остановите войну!
for scientists:


default search action
David S. Johnson
Person information

- affiliation: Columbia University, Computer Science Department, New York, NY, USA
- affiliation: AT&T Labs, Florham Park, NJ, USA
- affiliation: AT&T Bell Labs, Murray Hill, NJ, USA
- award (2010): Knuth Prize
- award (1979): Frederick W. Lanchester Prize
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2021
- [c47]David S. Johnson, Wolfgang Lorenz, Michael Taenzer, Stylianos I. Mimilakis, Sascha Grollmisch, Jakob Abeßer, Hanna M. Lukashevich:
DESED-FL and URBAN-FL: Federated Learning Datasets for Sound Event Detection. EUSIPCO 2021: 556-560 - [c46]Patrick Aichroth
, Christoph Antes, Pierre Gembatzka, Holger Graf
, David S. Johnson, Matthias Jung, Thomas Kämpfe
, Thomas Kleinberger, Thomas Köllmer, Thomas Kuhn, Christoph Kutter, Jens Krüger, Dominik Marek Loroch, Hanna M. Lukashevich, Nellie Laleni, Lei Zhang
, Johannes Leugering, Rodrigo Martín Fernández, Loreto Mateu, Shaown Mojumder, Benjamin Prautsch, Ferdinand Pscheidl, Karsten Roscher, Sören Schneickert, Frank Vanselow, Paul Wallbott, Oliver Walter, Nico Weber:
SEC-Learn: Sensor Edge Cloud for Federated Learning - Invited Paper. SAMOS 2021: 432-448 - [i12]David S. Johnson, Wolfgang Lorenz, Michael Taenzer, Stylianos I. Mimilakis, Sascha Grollmisch, Jakob Abeßer, Hanna M. Lukashevich:
DESED-FL and URBAN-FL: Federated Learning Datasets for Sound Event Detection. CoRR abs/2102.08833 (2021) - 2020
- [j88]David S. Johnson, Lee Breslau
, Ilias Diakonikolas
, Nick Duffield
, Yu Gu
, MohammadTaghi Hajiaghayi
, Howard J. Karloff
, Mauricio G. C. Resende
, Subhabrata Sen:
Near-Optimal Disjoint-Path Facility Location Through Set Cover by Pairs. Oper. Res. 68(3): 896-926 (2020) - [j87]Juan A. Garay, David S. Johnson, Aggelos Kiayias, Moti Yung:
The combinatorics of hidden diversity. Theor. Comput. Sci. 812: 80-95 (2020) - [c45]David S. Johnson, Sascha Grollmisch:
Techniques Improving the Robustness of Deep Learning Models for Industrial Sound Analysis. EUSIPCO 2020: 81-85
2010 – 2019
- 2018
- [j86]Leah Epstein, David S. Johnson, Asaf Levin
:
Min-Sum Bin Packing. J. Comb. Optim. 36(2): 508-531 (2018) - [c44]David L. Applegate, Aaron Archer, David S. Johnson, Evdokia Nikolova, Mikkel Thorup
, Ger Yang:
Wireless coverage prediction via parametric shortest paths. MobiHoc 2018: 221-230 - [i11]David L. Applegate, Aaron Archer, David S. Johnson, Evdokia Nikolova, Mikkel Thorup, Ger Yang:
Wireless coverage prediction via parametric shortest paths. CoRR abs/1805.06420 (2018) - 2016
- [r5]David S. Johnson:
Bin Packing. Encyclopedia of Algorithms 2016: 207-211 - [r4]Camil Demetrescu, Andrew V. Goldberg, David S. Johnson:
Implementation Challenge for Shortest Paths. Encyclopedia of Algorithms 2016: 947-951 - [r3]David S. Johnson:
Vector Bin Packing. Encyclopedia of Algorithms 2016: 2319-2323 - [i10]David S. Johnson, Lee Breslau, Ilias Diakonikolas, Nick G. Duffield, Yu Gu, MohammadTaghi Hajiaghayi, Howard J. Karloff, Mauricio G. C. Resende, Subhabrata Sen:
Near-Optimal Disjoint-Path Facility Location Through Set Cover by Pairs. CoRR abs/1611.01210 (2016) - [i9]Daniel Delling, Camil Demetrescu, David S. Johnson, Jan Vitek:
Rethinking Experimental Methods in Computing (Dagstuhl Seminar 16111). Dagstuhl Reports 6(3): 24-43 (2016) - 2015
- [c43]Juan A. Garay, Ran Gelles, David S. Johnson, Aggelos Kiayias, Moti Yung:
A Little Honesty Goes a Long Way - The Two-Tier Model for Secure Multiparty Computation. TCC (1) 2015: 134-158 - 2014
- [i8]Juan A. Garay, Ran Gelles, David S. Johnson, Aggelos Kiayias, Moti Yung:
A Little Honesty Goes a Long Way: The Two-Tier Model for Secure Multiparty Computation. IACR Cryptol. ePrint Arch. 2014: 209 (2014) - 2013
- [c42]Juan A. Garay, David S. Johnson, Aggelos Kiayias, Moti Yung:
Resource-based corruptions and the combinatorics of hidden diversity. ITCS 2013: 415-428 - [i7]Andrew V. Goldberg, Giuseppe F. Italiano, David S. Johnson, Dorothea Wagner:
Algorithm Engineering (Dagstuhl Seminar 13391). Dagstuhl Reports 3(9): 169-189 (2013) - 2012
- [i6]Juan A. Garay, David S. Johnson, Aggelos Kiayias, Moti Yung:
Resource-based Corruptions and the Combinatorics of Hidden Diversity. IACR Cryptol. ePrint Arch. 2012: 556 (2012) - 2011
- [c41]Lee Breslau, Ilias Diakonikolas, Nick G. Duffield, Yu Gu, Mohammad Taghi Hajiaghayi, David S. Johnson, Howard J. Karloff, Mauricio G. C. Resende, Subhabrata Sen:
Disjoint-Path Facility Location: Theory and Practice. ALENEX 2011: 60-74 - 2010
- [e10]Giuseppe F. Italiano, David S. Johnson, Petra Mutzel, Peter Sanders:
Algorithm Engineering, 27.06. - 02.07.2010. Dagstuhl Seminar Proceedings 10261, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2010 [contents] - [i5]Giuseppe F. Italiano, David S. Johnson, Petra Mutzel, Peter Sanders:
10261 Abstracts Collection - Algorithm Engineering. Algorithm Engineering 2010 - [i4]Giuseppe F. Italiano, David S. Johnson, Petra Mutzel, Peter Sanders:
10261 Executive Summary - Algorithm Engineering. Algorithm Engineering 2010
2000 – 2009
- 2009
- [e9]Camil Demetrescu, Andrew V. Goldberg, David S. Johnson:
The Shortest Path Problem, Proceedings of a DIMACS Workshop, Piscataway, New Jersey, USA, November 13-14, 2006. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 74, DIMACS/AMS 2009, ISBN 978-0-8218-4383-3 [contents] - 2008
- [j85]David S. Johnson, Anuj Mehrotra, Michael A. Trick
:
Special issue on computational methods for graph coloring and its generalizations. Discret. Appl. Math. 156(2): 145-146 (2008) - [r2]Camil Demetrescu, Andrew V. Goldberg, David S. Johnson:
Implementation Challenge for Shortest Paths. Encyclopedia of Algorithms 2008 - [r1]David S. Johnson:
Bin Packing. Encyclopedia of Algorithms 2008 - 2007
- [j84]David S. Johnson:
The NP-completeness column: Finding needles in haystacks. ACM Trans. Algorithms 3(2): 24 (2007) - [c40]David S. Johnson:
What is the science in experimental computer science? Experimental Computer Science 2007: 1 - [c39]David L. Applegate, Gruia Calinescu, David S. Johnson, Howard J. Karloff, Katrina Ligett, Jia Wang:
Compressing rectilinear pictures and minimizing access control lists. SODA 2007: 1066-1075 - [e8]David S. Johnson, Uriel Feige:
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, June 11-13, 2007. ACM 2007, ISBN 978-1-59593-631-8 [contents] - 2006
- [j83]János Csirik, David S. Johnson, Claire Kenyon, James B. Orlin, Peter W. Shor, Richard R. Weber:
On the Sum-of-Squares algorithm for bin packing. J. ACM 53(1): 1-65 (2006) - [j82]David S. Johnson:
The NP-completeness column: The many limits on approximation. ACM Trans. Algorithms 2(3): 473-489 (2006) - 2005
- [j81]David S. Johnson:
The NP-completeness column. ACM Trans. Algorithms 1(1): 160-176 (2005) - [j80]Jatin Chhugani, Budirijanto Purnomo, Shankar Krishnan, Jonathan D. Cohen, Suresh Venkatasubramanian, David S. Johnson, Subodh Kumar:
vLOD: High-Fidelity Walkthrough of Large Virtual Environments. IEEE Trans. Vis. Comput. Graph. 11(1): 35-47 (2005) - [i3]János Csirik, David S. Johnson, Claire Kenyon:
On the Worst-case Performance of the Sum-of-Squares Algorithm for Bin Packing. CoRR abs/cs/0509031 (2005) - 2004
- [c38]David S. Johnson, Shankar Krishnan, Jatin Chhugani, Subodh Kumar, Suresh Venkatasubramanian:
Compressing Large Boolean Matrices using Reordering Techniques. VLDB 2004: 13-23 - 2003
- [j79]Alexander I. Barvinok, Sándor P. Fekete, David S. Johnson, Arie Tamir, Gerhard J. Woeginger, Russell Woodroofe
:
The geometric maximum traveling salesman problem. J. ACM 50(5): 641-664 (2003) - [c37]David L. Applegate, Luciana S. Buriol, Bernard L. Dillard, David S. Johnson, Peter W. Shor:
The Cutting-Stock Approach to Bin Packing: Theory and Experiments. ALENEX 2003: 1-15 - 2002
- [j78]Edward G. Coffman Jr., Costas Courcoubetis, Michael R. Garey, David S. Johnson, Peter W. Shor, Richard R. Weber, Mihalis Yannakakis:
Perfect Packing Theorems and the Average-Case Behavior of Optimal and Online Bin Packing. SIAM Rev. 44(1): 95-108 (2002) - [e7]Michael H. Goldwasser, David S. Johnson, Catherine C. McGeoch:
Data Structures, Near Neighbor Searches, and Methodology: Fifth and Sixth DIMACS Implementation Challenges, Proceedings of a DIMACS Workshop, USA, 1999. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 59, DIMACS/AMS 2002, ISBN 978-0-8218-2892-2 [contents] - [i2]Alexander I. Barvinok, Sándor P. Fekete, David S. Johnson, Arie Tamir, Gerhard J. Woeginger, Russell Woodroofe
:
The Geometric Maximum Traveling Salesman Problem. CoRR cs.DS/0204024 (2002) - [i1]János Csirik, David S. Johnson, Claire Kenyon, James B. Orlin, Peter W. Shor, Richard R. Weber:
On the Sum-of-Squares Algorithm for Bin Packing. CoRR cs.DS/0210013 (2002) - 2001
- [j77]János Csirik, David S. Johnson:
Bounded Space On-Line Bin Packing: Best Is Better than First. Algorithmica 31(2): 115-138 (2001) - [c36]Jill Cirasella, David S. Johnson, Lyle A. McGeoch, Weixiong Zhang
:
The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests. ALENEX 2001: 32-59 - [c35]János Csirik, David S. Johnson, Claire Kenyon:
Better approximation algorithms for bin covering. SODA 2001: 557-566 - 2000
- [j76]Edward G. Coffman Jr., Costas Courcoubetis, M. R. Garey, David S. Johnson, Peter W. Shor, Richard R. Weber, Mihalis Yannakakis:
Bin Packing with Discrete Item Sizes, Part I: Perfect Packing Theorems and the Average Case Behavior of Optimal Packings. SIAM J. Discret. Math. 13(3): 384-402 (2000) - [c34]David S. Johnson, Maria Minkoff, Steven Phillips:
The prize collecting Steiner tree problem: theory and practice. SODA 2000: 760-769 - [c33]János Csirik, David S. Johnson, Claire Kenyon, James B. Orlin, Peter W. Shor, Richard R. Weber:
On the sum-of-squares algorithm for bin packing. STOC 2000: 208-217
1990 – 1999
- 1999
- [c32]János Csirik, David S. Johnson, Claire Kenyon, Peter W. Shor, Richard R. Weber:
A Self Organizing Bin Packing Heuristic. ALENEX 1999: 246-265 - [c31]David S. Johnson:
A theoretician's guide to the experimental analysis of algorithms. Data Structures, Near Neighbor Searches, and Methodology 1999: 215-250 - [c30]David S. Johnson, Mario Szegedy:
What are the Least Tractable Instances of max Independent Set? SODA 1999: 927-928 - 1998
- [c29]Alexander I. Barvinok, David S. Johnson, Gerhard J. Woeginger, Russell Woodroofe
:
The Maximum Traveling Salesman Problem Under Polyhedral Norms. IPCO 1998: 195-201 - 1997
- [j75]Edward G. Coffman Jr., David S. Johnson, Peter W. Shor, Richard R. Weber:
Bin packing with discrete item sizes, part II: Tight bounds on First Fit. Random Struct. Algorithms 10(1-2): 69-101 (1997) - [j74]Alfred V. Aho, David S. Johnson, Richard M. Karp, S. Rao Kosaraju, Catherine C. McGeoch, Christos H. Papadimitriou, Pavel A. Pevzner:
Emerging opportunities for theoretical computer science. SIGACT News 28(3): 65-74 (1997) - [j73]Anne Condon, Faith E. Fich, Greg N. Frederickson, Andrew V. Goldberg, David S. Johnson, Michael C. Loui, Steven Mahaney, Prabhakar Raghavan, John E. Savage, Alan L. Selman, David B. Shmoys
:
Strategic directions in research in theory of computing. SIGACT News 28(3): 75-93 (1997) - [c28]Cliff Young, David S. Johnson, David R. Karger
, Michael D. Smith:
Near-optimal Intraprocedural Branch Alignment. PLDI 1997: 183-193 - 1996
- [j72]David S. Johnson:
How to do experiments (extended advertisement). SIGACT News 27(2): 87 (1996) - [j71]David S. Johnson:
A Brief History of SIGACT News and its Editors. SIGACT News 27(3): 125 (1996) - [c27]David S. Johnson, Lyle A. McGeoch, Edward E. Rothberg:
Asymptotic Experimental Analysis for the Held-Karp Traveling Salesman Bound. SODA 1996: 341-350 - [e6]David S. Johnson, Michael A. Trick:
Cliques, Coloring, and Satisfiability, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, October 11-13, 1993. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 26, DIMACS/AMS 1996, ISBN 978-0-8218-6609-2 [contents] - 1995
- [j70]Michael L. Fredman, David S. Johnson, Lyle A. McGeoch, G. Ostheimer:
Data Structures for Traveling Salesmen. J. Algorithms 18(3): 432-479 (1995) - 1994
- [j69]Elias Dahlhaus, David S. Johnson, Christos H. Papadimitriou, Paul D. Seymour, Mihalis Yannakakis:
The Complexity of Multiterminal Cuts. SIAM J. Comput. 23(4): 864-894 (1994) - [c26]David S. Johnson:
The Traveling Salesman Problem: A report on the State of the Art. IFIP Congress (1) 1994: 221-222 - [c25]Zygmunt J. Haas, Jack H. Winters, David S. Johnson:
Simulation study of the capacity bounds in cellular systems. PIMRC 1994: 1114-1120 - [c24]David S. Johnson, Andrea S. LaPaugh, Ron Y. Pinter:
Minimizing Channel Density by Lateral Shifting of Components. SODA 1994: 122-131 - 1993
- [j68]David S. Johnson, Francine Berman:
Performance of the Efficient Data-Driven Evaluation Scheme. J. Parallel Distributed Comput. 18(3): 340-346 (1993) - [c23]David S. Johnson, Michael A. Trick:
Foreword xiIntroduction to the Second DIMACS Challenge: Cliques, coloring, and satisfiability. Cliques, Coloring, and Satisfiability 1993: 1-7 - [c22]Michael L. Fredman, David S. Johnson, Lyle A. McGeoch, G. Ostheimer:
Data Structures for Traveling Salesmen. SODA 1993: 145-154 - [c21]Edward G. Coffman Jr., David S. Johnson, Peter W. Shor, Richard R. Weber:
Markov chains, computer proofs, and average-case analysis of best fit bin packing. STOC 1993: 412-421 - [e5]David S. Johnson, Catherine C. McGeoch:
Network Flows And Matching, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, October 14-16, 1991. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 12, DIMACS/AMS 1993, ISBN 978-0-8218-6598-9 [contents] - [e4]S. Rao Kosaraju, David S. Johnson, Alok Aggarwal:
Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, May 16-18, 1993, San Diego, CA, USA. ACM 1993, ISBN 0-89791-591-7 [contents] - 1992
- [j67]David S. Johnson:
The NP-Completeness Column: An Ongoing Guide. J. Algorithms 13(3): 502-524 (1992) - [c20]Elias Dahlhaus, David S. Johnson, Christos H. Papadimitriou, Paul D. Seymour, Mihalis Yannakakis:
The Complexity of Multiway Cuts (Extended Abstract). STOC 1992: 241-251 - 1991
- [j66]David S. Johnson, Cecilia R. Aragon, Lyle A. McGeoch, Catherine Schevon:
Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning. Oper. Res. 39(3): 378-406 (1991) - [c19]David S. Johnson:
Appendix B: Panel Discussion Highlights. Network Flows And Matching 1991: 583-592 - [c18]David S. Johnson, Catherine C. McGeoch:
Preface. Network Flows And Matching 1991: xi- - [c17]János Csirik, David S. Johnson:
Bounded Space On-Line Bin Packing: Best is Better than First. SODA 1991: 309-319 - [c16]Edward G. Coffman Jr., Costas Courcoubetis, M. R. Garey, David S. Johnson, Lyle A. McGeoch, Peter W. Shor, Richard R. Weber, Mihalis Yannakakis:
Fundamental Discrepancies between Average-Case Analyses under Discrete and Continuous Distributions: A Bin Packing Case Study. STOC 1991: 230-240 - 1990
- [j65]Brent N. Clark, Charles J. Colbourn, David S. Johnson:
Unit disk graphs. Discret. Math. 86(1-3): 165-177 (1990) - [j64]David S. Johnson:
The NP-Completeness Column: An Ongoing Guide. J. Algorithms 11(1): 144-151 (1990) - [j63]Francine Berman, David S. Johnson, Frank Thomson Leighton, Peter W. Shor, Larry Snyder:
Generalized Planar Matching. J. Algorithms 11(2): 153-184 (1990) - [j62]David S. Johnson:
A stoc/focs bibliography: the last progress report. SIGACT News 21(2): 4 (1990) - [c15]David S. Johnson:
Local Optimization and the Traveling Salesman Problem. ICALP 1990: 446-461 - [c14]David S. Johnson:
Data Structures for Traveling Salesmen (Abstract). SWAT 1990: 287 - [p1]David S. Johnson:
A Catalog of Complexity Classes. Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A) 1990: 67-161 - [e3]David S. Johnson:
Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, 22-24 January 1990, San Francisco, California, USA. SIAM 1990, ISBN 0-89871-251-3 [contents]
1980 – 1989
- 1989
- [j61]David S. Johnson, Cecilia R. Aragon, Lyle A. McGeoch, Catherine Schevon:
Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning. Oper. Res. 37(6): 865-892 (1989) - [c13]Richard C. Jaffe, David S. Johnson, Wen-Tai Lin, Chung-Yin Ho:
Application of VLSI for image processing. ICASSP 1989: 2421-2424 - [e2]David S. Johnson:
Proceedings of the 21st Annual ACM Symposium on Theory of Computing, May 14-17, 1989, Seattle, Washington, USA. ACM 1989, ISBN 0-89791-307-8 [contents] - 1988
- [j60]David S. Johnson, Christos H. Papadimitriou, Mihalis Yannakakis:
On Generating All Maximal Independent Sets. Inf. Process. Lett. 27(3): 119-123 (1988) - [j59]Nimrod Megiddo, S. Louis Hakimi, M. R. Garey, David S. Johnson, Christos H. Papadimitriou:
The complexity of searching a graph. J. ACM 35(1): 18-44 (1988) - [j58]David S. Johnson:
The NP-Completeness Column: An Ongoing Guide. J. Algorithms 9(3): 426-444 (1988) - [j57]David S. Johnson, Christos H. Papadimitriou, Mihalis Yannakakis:
How Easy is Local Search? J. Comput. Syst. Sci. 37(1): 79-100 (1988) - 1987
- [j56]David S. Johnson:
The NP-Completeness Column: An Ongoing Guide. J. Algorithms 8(2): 285-303 (1987) - [j55]David S. Johnson:
The NP-Completeness Column: An Ongoing Guide. J. Algorithms 8(3): 438-448 (1987) - [j54]Edward G. Coffman Jr., M. R. Garey, David S. Johnson:
Bin packing with divisible item sizes. J. Complex. 3(4): 406-428 (1987) - [j53]David S. Johnson, Henry O. Pollak:
Hypergraph planarity and the complexity of drawing venn diagrams. J. Graph Theory 11(3): 309-325 (1987) - 1986
- [j52]David S. Johnson:
The NP-Completeness Column: An Ongoing Guide. J. Algorithms 7(2): 289-305 (1986) - [j51]David S. Johnson:
The NP-Completeness Column: An Ongoing Guide. J. Algorithms 7(4): 584-601 (1986) - 1985
- [j50]David S. Johnson:
The NP-Completeness Column: An Ongoing Guide. J. Algorithms 6(1): 145-159 (1985) - [j49]David S. Johnson:
The NP-Completeness Column: An Ongoing Guide. J. Algorithms 6(2): 291-305 (1985) - [j48]David S. Johnson:
The NP-Completeness Column: An Ongoing Guide. J. Algorithms 6(3): 434-451 (1985) - [j47]David S. Johnson, M. R. Garey:
A 71/60 theorem for bin packing. J. Complex. 1(1): 65-106 (1985) - [j46]M. R. Garey, David S. Johnson:
Composing Functions to Minimize Image Size. SIAM J. Comput. 14(2): 500-503 (1985) - [j45]Edward G. Coffman Jr., M. R. Garey, David S. Johnson, Andrea S. LaPaugh:
Scheduling File Transfers. SIAM J. Comput. 14(3): 744-780 (1985) - [c12]David S. Johnson, Christos H. Papadimitriou, Mihalis Yannakakis:
How Easy Is Local Search? (Extended Abstract). FOCS 1985: 39-42 - 1984
- [j44]David S. Johnson:
The NP-Completeness Column: An Ongoing Guide. J. Algorithms 5(1): 147-160 (1984) - [j43]David S. Johnson:
The NP-Completeness Column: An Ongoing Guide. J. Algorithms 5(2): 284-299 (1984) - [j42]David S. Johnson:
The NP-Completeness Column: An Ongoing Guide. J. Algorithms 5(3): 433-447 (1984) - [j41]Susan F. Assmann, David S. Johnson, Daniel J. Kleitman, Joseph Y.-T. Leung:
On a Dual Version of the One-Dimensional Bin Packing Problem. J. Algorithms 5(4): 502-525 (1984) - [j40]David S. Johnson:
The NP-Completeness Column: An Ongoing Guide. J. Algorithms 5(4): 595-609 (1984) - [j39]David S. Johnson, Anthony C. Klug:
Testing Containment of Conjunctive Queries under Functional and Inclusion Dependencies. J. Comput. Syst. Sci. 28(1): 167-189 (1984) - [j38]David S. Johnson:
The genealogy of theoretical computer science: a preliminary report. SIGACT News 16(2): 36-49 (1984) - [c11]Jon Louis Bentley, David S. Johnson, Frank Thomson Leighton, Catherine C. McGeoch, Lyle A. McGeoch:
Some Unexpected Expected Behavior Results for Bin Packing. STOC 1984: 279-288 - 1983
- [j37]David S. Johnson:
The NP-Completeness Column: An Ongoing Guide. J. Algorithms 4(1): 87-100 (1983) - [j36]David S. Johnson:
The NP-Completeness Column: An Ongoing Guide. J. Algorithms 4(2): 189-203 (1983) - [j35]David S. Johnson:
The NP-Completeness Column: An Ongoing Guide. J. Algorithms 4(3): 286-300 (1983) - [j34]David S. Johnson:
The NP-Completeness Column: An Ongoing Guide. J. Algorithms 4(4): 397-411 (1983) - [j33]Edward G. Coffman Jr., M. R. Garey, David S. Johnson:
Dynamic Bin Packing. SIAM J. Comput. 12(2): 227-258 (1983) - [j32]David S. Johnson, Anthony C. Klug:
Optimizing Conjunctive Queries that Contain Untyped Variables. SIAM J. Comput. 12(4): 616-640 (1983) - [c10]Edward G. Coffman Jr., M. R. Garey, David S. Johnson, Andrea S. LaPaugh:
Scheduling File Transfers in a Distributed Network. PODC 1983: 254-266 - [e1]David S. Johnson, Ronald Fagin, Michael L. Fredman, David Harel, Richard M. Karp, Nancy A. Lynch, Christos H. Papadimitriou, Ronald L. Rivest, Walter L. Ruzzo, Joel I. Seiferas:
Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 25-27 April, 1983, Boston, Massachusetts, USA. ACM 1983 [contents] - 1982
- [j31]David S. Johnson:
The NP-Completeness Column: An Ongoing Guide. J. Algorithms 3(1): 89-99 (1982) - [j30]