David S. Johnson

Publication Activity (10 Years)

Years Active: 1972-2023
Publications (10 Years): 12

Top Venues

CoRR

Dagstuhl Reports

EUSIPCO

SAMOS

Publications

David S. Johnson, Olya Hakobyan, Hanna Drimalla
Towards Interpretability in Audio and Visual Affective Machine Learning: A Review. CoRR (2023)
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)
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)
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 (2021)
David S. Johnson, Sascha Grollmisch
Techniques Improving the Robustness of Deep Learning Models for Industrial Sound Analysis. EUSIPCO (2020)
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) (2020)
Juan A. Garay, David S. Johnson, Aggelos Kiayias, Moti Yung
The combinatorics of hidden diversity. Theor. Comput. Sci. 812 (2020)
Leah Epstein, David S. Johnson, Asaf Levin
Min-Sum Bin Packing. J. Comb. Optim. 36 (2) (2018)
David L. Applegate, Aaron Archer, David S. Johnson, Evdokia Nikolova, Mikkel Thorup, Ger Yang
Wireless coverage prediction via parametric shortest paths. CoRR (2018)
David L. Applegate, Aaron Archer, David S. Johnson, Evdokia Nikolova, Mikkel Thorup, Ger Yang
Wireless coverage prediction via parametric shortest paths. MobiHoc (2018)
Daniel Delling, Camil Demetrescu, David S. Johnson, Jan Vitek
Rethinking Experimental Methods in Computing (Dagstuhl Seminar 16111). Dagstuhl Reports 6 (3) (2016)
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 (2016)
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)
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 (2014)
Andrew V. Goldberg, Giuseppe F. Italiano, David S. Johnson, Dorothea Wagner
Algorithm Engineering (Dagstuhl Seminar 13391). Dagstuhl Reports 3 (9) (2013)
Juan A. Garay, David S. Johnson, Aggelos Kiayias, Moti Yung
Resource-based corruptions and the combinatorics of hidden diversity. ITCS (2013)
Juan A. Garay, David S. Johnson, Aggelos Kiayias, Moti Yung
Resource-based Corruptions and the Combinatorics of Hidden Diversity. IACR Cryptol. ePrint Arch. 2012 (2012)
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)
Giuseppe F. Italiano, David S. Johnson, Petra Mutzel, Peter Sanders
10261 Abstracts Collection - Algorithm Engineering. Algorithm Engineering (2010)
Giuseppe F. Italiano, David S. Johnson, Petra Mutzel, Peter Sanders
10261 Executive Summary - Algorithm Engineering. Algorithm Engineering (2010)
David S. Johnson, Anuj Mehrotra, Michael A. Trick
Special issue on computational methods for graph coloring and its generalizations. Discret. Appl. Math. 156 (2) (2008)
David S. Johnson
The NP-completeness column: Finding needles in haystacks. ACM Trans. Algorithms 3 (2) (2007)
David S. Johnson
What is the science in experimental computer science? Experimental Computer Science (2007)
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)
David S. Johnson
The NP-completeness column: The many limits on approximation. ACM Trans. Algorithms 2 (3) (2006)
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) (2006)
János Csirik, David S. Johnson, Claire Kenyon
On the Worst-case Performance of the Sum-of-Squares Algorithm for Bin Packing CoRR (2005)
David S. Johnson
The NP-completeness column. ACM Trans. Algorithms 1 (1) (2005)
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) (2005)
David S. Johnson, Shankar Krishnan, Jatin Chhugani, Subodh Kumar, Suresh Venkatasubramanian
Compressing Large Boolean Matrices using Reordering Techniques. VLDB (2004)
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) (2003)
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)
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) (2002)
Alexander I. Barvinok, Sándor P. Fekete, David S. Johnson, Arie Tamir, Gerhard J. Woeginger, Russell Woodroofe
The Geometric Maximum Traveling Salesman Problem CoRR (2002)
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 (2002)
János Csirik, David S. Johnson
Bounded Space On-Line Bin Packing: Best Is Better than First. Algorithmica 31 (2) (2001)
János Csirik, David S. Johnson, Claire Kenyon
Better approximation algorithms for bin covering. SODA (2001)
Jill Cirasella, David S. Johnson, Lyle A. McGeoch, Weixiong Zhang
The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests. ALENEX (2001)
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)
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) (2000)
David S. Johnson, Maria Minkoff, Steven Phillips
The prize collecting Steiner tree problem: theory and practice. SODA (2000)
David S. Johnson, Mario Szegedy
What are the Least Tractable Instances of max Independent Set? SODA (1999)
János Csirik, David S. Johnson, Claire Kenyon, Peter W. Shor, Richard R. Weber
A Self Organizing Bin Packing Heuristic. ALENEX (1999)
David S. Johnson
A theoretician's guide to the experimental analysis of algorithms. Data Structures, Near Neighbor Searches, and Methodology (1999)
Alexander I. Barvinok, David S. Johnson, Gerhard J. Woeginger, Russell Woodroofe
The Maximum Traveling Salesman Problem Under Polyhedral Norms. IPCO (1998)
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) (1997)
Cliff Young, David S. Johnson, David R. Karger, Michael D. Smith
Near-optimal Intraprocedural Branch Alignment. PLDI (1997)
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) (1997)
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) (1997)
David S. Johnson
A Brief History of SIGACT News and its Editors. SIGACT News 27 (3) (1996)
David S. Johnson
How to do experiments (extended advertisement). SIGACT News 27 (2) (1996)
David S. Johnson, Lyle A. McGeoch, Edward E. Rothberg
Asymptotic Experimental Analysis for the Held-Karp Traveling Salesman Bound. SODA (1996)
Michael L. Fredman, David S. Johnson, Lyle A. McGeoch, G. Ostheimer
Data Structures for Traveling Salesmen. J. Algorithms 18 (3) (1995)
Elias Dahlhaus, David S. Johnson, Christos H. Papadimitriou, Paul D. Seymour, Mihalis Yannakakis
The Complexity of Multiterminal Cuts. SIAM J. Comput. 23 (4) (1994)
David S. Johnson
The Traveling Salesman Problem: A report on the State of the Art. IFIP Congress (1) (1994)
Zygmunt J. Haas, Jack H. Winters, David S. Johnson
Simulation study of the capacity bounds in cellular systems. PIMRC (1994)
David S. Johnson, Andrea S. LaPaugh, Ron Y. Pinter
Minimizing Channel Density by Lateral Shifting of Components. SODA (1994)
David S. Johnson, Michael A. Trick
Foreword xiIntroduction to the Second DIMACS Challenge: Cliques, coloring, and satisfiability. Cliques, Coloring, and Satisfiability (1993)
Michael L. Fredman, David S. Johnson, Lyle A. McGeoch, G. Ostheimer
Data Structures for Traveling Salesmen. SODA (1993)
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)
David S. Johnson, Francine Berman
Performance of the Efficient Data-Driven Evaluation Scheme. J. Parallel Distributed Comput. 18 (3) (1993)
David S. Johnson
The NP-Completeness Column: An Ongoing Guide. J. Algorithms 13 (3) (1992)
Elias Dahlhaus, David S. Johnson, Christos H. Papadimitriou, Paul D. Seymour, Mihalis Yannakakis
The Complexity of Multiway Cuts (Extended Abstract) STOC (1992)
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) (1991)
David S. Johnson
Appendix B: Panel Discussion Highlights. Network Flows And Matching (1991)
János Csirik, David S. Johnson
Bounded Space On-Line Bin Packing: Best is Better than First. SODA (1991)
David S. Johnson, Catherine C. McGeoch
Preface. Network Flows And Matching (1991)
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)
David S. Johnson
The NP-Completeness Column: An Ongoing Guide. J. Algorithms 11 (1) (1990)
Francine Berman, David S. Johnson, Frank Thomson Leighton, Peter W. Shor, Larry Snyder
Generalized Planar Matching. J. Algorithms 11 (2) (1990)
David S. Johnson
Data Structures for Traveling Salesmen (Abstract). SWAT (1990)
David S. Johnson
A stoc/focs bibliography: the last progress report. SIGACT News 21 (2) (1990)
Brent N. Clark, Charles J. Colbourn, David S. Johnson
Unit disk graphs. Discret. Math. 86 (1-3) (1990)
David S. Johnson
Local Optimization and the Traveling Salesman Problem. ICALP (1990)
Richard C. Jaffe, David S. Johnson, Wen-Tai Lin, Chung-Yin Ho
Application of VLSI for image processing. ICASSP (1989)
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) (1989)
David S. Johnson
The NP-Completeness Column: An Ongoing Guide. J. Algorithms 9 (3) (1988)
David S. Johnson, Christos H. Papadimitriou, Mihalis Yannakakis
On Generating All Maximal Independent Sets. Inf. Process. Lett. 27 (3) (1988)
Nimrod Megiddo, S. Louis Hakimi, M. R. Garey, David S. Johnson, Christos H. Papadimitriou
The complexity of searching a graph. J. ACM 35 (1) (1988)
David S. Johnson, Christos H. Papadimitriou, Mihalis Yannakakis
How Easy is Local Search? J. Comput. Syst. Sci. 37 (1) (1988)
Edward G. Coffman Jr., M. R. Garey, David S. Johnson
Bin packing with divisible item sizes. J. Complex. 3 (4) (1987)
David S. Johnson
The NP-Completeness Column: An Ongoing Guide. J. Algorithms 8 (2) (1987)
David S. Johnson, Henry O. Pollak
Hypergraph planarity and the complexity of drawing venn diagrams. J. Graph Theory 11 (3) (1987)
David S. Johnson
The NP-Completeness Column: An Ongoing Guide. J. Algorithms 8 (3) (1987)
David S. Johnson
The NP-Completeness Column: An Ongoing Guide. J. Algorithms 7 (2) (1986)
David S. Johnson
The NP-Completeness Column: An Ongoing Guide. J. Algorithms 7 (4) (1986)
David S. Johnson
The NP-Completeness Column: An Ongoing Guide. J. Algorithms 6 (3) (1985)
Edward G. Coffman Jr., M. R. Garey, David S. Johnson, Andrea S. LaPaugh
Scheduling File Transfers. SIAM J. Comput. 14 (3) (1985)
David S. Johnson
The NP-Completeness Column: An Ongoing Guide. J. Algorithms 6 (1) (1985)
David S. Johnson, M. R. Garey
A 71/60 theorem for bin packing. J. Complex. 1 (1) (1985)
M. R. Garey, David S. Johnson
Composing Functions to Minimize Image Size. SIAM J. Comput. 14 (2) (1985)
David S. Johnson
The NP-Completeness Column: An Ongoing Guide. J. Algorithms 6 (2) (1985)
David S. Johnson, Christos H. Papadimitriou, Mihalis Yannakakis
How Easy Is Local Search? (Extended Abstract) FOCS (1985)
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)
David S. Johnson
The genealogy of theoretical computer science: a preliminary report. SIGACT News 16 (2) (1984)
David S. Johnson
The NP-Completeness Column: An Ongoing Guide. J. Algorithms 5 (1) (1984)
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) (1984)
David S. Johnson, Anthony C. Klug
Testing Containment of Conjunctive Queries under Functional and Inclusion Dependencies. J. Comput. Syst. Sci. 28 (1) (1984)
David S. Johnson
The NP-Completeness Column: An Ongoing Guide. J. Algorithms 5 (3) (1984)
David S. Johnson
The NP-Completeness Column: An Ongoing Guide. J. Algorithms 5 (4) (1984)

David S. Johnson

Publication Activity (10 Years)

Top Topics

Top Venues