default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael A. Langston
Person information
- affiliation: University of Tennessee, Knoxville, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j72]Haoran Niu
, Olufemi A. Omitaomu, Michael A. Langston, Mohammed M. Olama, Özgür Özmen, Hilda B. Klasky, Angela Laurio, Merry Ward, Jonathan R. Nebeker:
EHR-BERT: A BERT-based model for effective anomaly detection in electronic health records. J. Biomed. Informatics 150: 104605 (2024)- [j71]Carissa Bleker, Stephen K. Grady, Michael A. Langston:
A Comparative Study of Gene Co-Expression Thresholding Algorithms. J. Comput. Biol. 31(6): 539-548 (2024) - 2023
- [c65]Carissa Bleker, Stephen K. Grady, Michael A. Langston:
A Brief Study of Gene Co-expression Thresholding Algorithms. ISBRA 2023: 420-430 - 2022
- [j70]Haoran Niu, Olufemi A. Omitaomu, Michael A. Langston, Mohammed M. Olama, Özgür Özmen, Hilda B. Klasky, Angela Laurio, Brian C. Sauer, Merry Ward, Jonathan R. Nebeker:
Detecting anomalous sequences in electronic health records using higher-order tensor networks. J. Biomed. Informatics 135: 104219 (2022) - 2021
- [j69]Ronald D. Hagan, Michael A. Langston:
Molecular Subtyping and Outlier Detection in Human Disease Using the Paraclique Algorithm. Algorithms 14(2): 63 (2021) - [c64]Cheng Chen, Stephen K. Grady, Sally R. Ellingson, Michael A. Langston:
Gene-disease-drug link prediction using tripartite graphs. BCB 2021: 76:1 - 2020
- [c63]Ronald D. Hagan, Stephen K. Grady, Charles A. Phillips, Bradley J. Rhodes, Michael A. Langston:
Towards Controllability Analysis of Dynamic Networks Using Minimum Dominating Set. FUSION 2020: 1-5
2010 – 2019
- 2019
- [j68]Charles A. Phillips, Kai Wang, Erich J. Baker, Jason A. Bubier, Elissa J. Chesler, Michael A. Langston:
On Finding and Enumerating Maximal and Maximum k-Partite Cliques in k-Partite Graphs. Algorithms 12(1): 23 (2019) - [j67]Yuping Lu, Charles A. Phillips, Michael A. Langston:
A robustness metric for biological data clustering algorithms. BMC Bioinform. 20-S(15): 503 (2019) - [c62]Ronald D. Hagan, Michael A. Langston:
Molecular Subtyping in Human Disease Using the Paraclique Algorithm. DEXA Workshops 2019: 54-58 - [c61]Ronald D. Hagan, Brett D. Hagan, Charles A. Phillips, Bradley J. Rhodes, Michael A. Langston:
Compound Analytics using Combinatorics for Feature Selection: A Case Study in Biomarker Detection. IPDPS Workshops 2019: 262-267 - 2018
- [c60]Yuping Lu, Jitendra Kumar, Nathan Collier, Bhargavi Krishna, Michael A. Langston:
Detecting Outliers in Streaming Time Series Data from ARM Distributed Sensors. ICDM Workshops 2018: 779-786 - [c59]Ronald D. Hagan, Charles A. Phillips, Michael A. Langston, Bradley J. Rhodes:
Classification and Anomaly Detection in Traffic Patterns of New York City Taxis: A Case Study in Compound Analytics. IPDPS Workshops 2018: 1169-1174 - 2017
- [c58]Ronald D. Hagan, Charles A. Phillips, Michael A. Langston, Bradley J. Rhodes:
Multiscale graph theoretical tools reveal subtle patterns in big geospatial data. IEEE BigData 2017: 3422-3425 - [c57]Ronald D. Hagan, Charles A. Phillips, Bradley J. Rhodes, Michael A. Langston:
Compound Analytics: Templates for Integrating Graph Algorithms and Machine Learning. IPDPS Workshops 2017: 1550-1556 - 2016
- [j66]Eric C. Rouchka, Julia H. Chariker, Benjamin J. Harrison, Juw Won Park, Xueyuan Cao, Stanley Pounds, Susana C. Raimondi, James R. Downing, Raul C. Ribeiro, Jeffrey Rubnitz, Jatinder Lamba, Bernie J. Daigle Jr., Deborah Burgess, Stephanie Gehrlich, John C. Carmen, Nicholas Johnson, Chandrakanth Emani, Kalpani De Silva, Michael P. Heaton, Theodore S. Kalbfleisch, Teeradache Viangteeravat, Rahul Mudunuri, Oluwaseun Ajayi, Fatih Sen, Eunice Y. Huang, Mohammad Mohebbi, Luaire Florian, Douglas J. Jackson, John F. Naber, Akm Sabbir, Sally R. Ellingson, Yuping Lu, Charles A. Phillips, Michael A. Langston, Rahul Kumar Sevakula, Raghuveer Thirukovalluru, Nishchal K. Verma, Yan Cui, Mohammed Sayed, Jing Wang, Qi Liu, Yu Shyr, Xiaofei Zhang, Naresh Prodduturi, Gavin R. Oliver, Diane Grill, Jie Na, Jeanette Eckel-Passow, Eric W. Klee, Michael M. Goodin, Mark L. Farman, Harrison Inocencio, Chanyong Jang, Jerzy W. Jaromczyk, Neil Moore, Kelly L. Sovacool, Leon Dent, Mike Izban, Sammed N. Mandape, Shruti S. Sakhare, Siddharth Pratap, Dana Marshall, M. Scotty Depriest, James N. MacLeod, Hanady Adam, Ethan Blandford, Joel Campbell, Joshua Castlen, Brittany Dixon, Ginger Gilbert, Aaron Hall, Philip Kreisle, Jessica Lasher, Bethany Oakes, Allison Speer, Maximilian Valentine, Naga Satya Venkateswara Ra Nagisetty, Rony Jose, Robert W. Rooney, David Hains:
Proceedings of the 15th Annual UT-KBRIN Bioinformatics Summit 2016: Cadiz, KY, USA. 8-10 April 2016. BMC Bioinform. 17(S-10) (2016) - [j65]Ronald D. Hagan, Michael A. Langston, Kai Wang:
Lower bounds on paraclique density. Discret. Appl. Math. 204: 208-212 (2016) - [j64]Erich J. Baker, Jason A. Bubier, Timothy Reynolds, Michael A. Langston, Elissa J. Chesler:
GeneWeaver: data driven alignment of cross-species genomics in biology and disease. Nucleic Acids Res. 44(Database-Issue): 555-559 (2016) - 2015
- [j63]Kai Wang, Charles A. Phillips, Arnold M. Saxton, Michael A. Langston:
An automated resource for enhanced differential analysis. BMC Bioinform. 16(S15): P20 (2015) - [c56]Charles A. Phillips, Kai Wang, Jason A. Bubier, Erich J. Baker, Elissa J. Chesler, Michael A. Langston:
Scalable multipartite subgraph enumeration for integrative analysis of heterogeneous experimental functional genomics data. BCB 2015: 626-633 - 2014
- [j62]Yun Zhang, Charles A. Phillips, Gary L. Rogers, Erich J. Baker, Elissa J. Chesler, Michael A. Langston:
On finding bicliques in bipartite graphs: a novel algorithm and its application to the integration of diverse biological data types. BMC Bioinform. 15: 110 (2014) - [j61]Andrew Schoenrock, Bahram Samanfar, Sylvain Pitre, Mohsen Hooshyar, Ke Jin, Charles A. Phillips, Hui Wang, Sadhna Phanse, Katayoun Omidi, Yuan Gui, Md Alamgir, Alex Wong, Fredrik Barrenäs, Mohan Babu, Mikael Benson, Michael A. Langston, James R. Green, Frank K. H. A. Dehne, Ashkan Golshani:
Efficient prediction of human protein-protein interactions at a global scale. BMC Bioinform. 15: 383 (2014) - [j60]Charles A. Phillips, Erich J. Baker, Elissa J. Chesler, Michael A. Langston:
Algorithmic tools for tripartite data analysis. BMC Bioinform. 15(S-10): P32 (2014) - [j59]Kai Wang, Charles A. Phillips, Gary L. Rogers, Fredrik Barrenäs, Mikael Benson, Michael A. Langston:
Differential Shannon entropy and differential coefficient of variation: alternatives and augmentations to differential expression in the search for disease-related genes. Int. J. Comput. Biol. Drug Des. 7(2/3): 183-194 (2014) - [c55]Ronald D. Hagan, Charles A. Phillips, Kai Wang, Gary L. Rogers, Michael A. Langston:
Toward an efficient, highly scalable maximum clique solver for massive graphs. IEEE BigData 2014: 41-45 - 2012
- [j58]John D. Eblen, Charles A. Phillips, Gary L. Rogers, Michael A. Langston:
The maximum clique enumeration problem: algorithms, applications, and implementations. BMC Bioinform. 13(S-10): S5 (2012) - [j57]Jeremy J. Jay, John D. Eblen, Yun Zhang, Mikael Benson, Andy D. Perkins, Arnold M. Saxton, Brynn H. Voy, Elissa J. Chesler, Michael A. Langston:
A systematic comparison of genome-scale clustering algorithms. BMC Bioinform. 13(S-10): S7 (2012) - [j56]Faisal N. Abu-Khzam, Michael A. Langston:
Immersion Containment and Connectivity in Color-Critical Graphs. Discret. Math. Theor. Comput. Sci. 14(2): 155-164 (2012) - [j55]Erich J. Baker, Jeremy J. Jay, Jason A. Bubier, Michael A. Langston, Elissa J. Chesler:
GeneWeaver: a web-based system for integrative functional genomics. Nucleic Acids Res. 40(Database-Issue): 1067-1076 (2012) - [c54]Michael A. Langston:
Fixed-Parameter Tractability, A Prehistory, . The Multivariate Algorithmic Revolution and Beyond 2012: 3-16 - [c53]Faisal N. Abu-Khzam, Michael A. Langston:
Almost Exact Graph 3-Coloring in O(1.277^n) Time. CTW 2012: 1-4 - [c52]Charles A. Phillips, Jeremy J. Jay, Erich J. Baker, Elissa J. Chesler, Michael A. Langston:
On Bipartite Graph Decomposition in the Presence of Noise, with Applications to Biological Data Clustering. CTW 2012: 215-219 - 2011
- [j54]Hans L. Bodlaender, Michael R. Fellows, Michael A. Langston, Mark A. Ragan, Frances A. Rosamond, Mark Weyer:
Quadratic Kernelization for Convex Recoloring of Trees. Algorithmica 61(2): 362-388 (2011) - [j53]Faisal N. Abu-Khzam, Henning Fernau, Michael A. Langston, Serena Lee-Cultura, Ulrike Stege:
Charge and reduce: A fixed-parameter algorithm for String-to-String Correction. Discret. Optim. 8(1): 41-49 (2011) - [c51]John D. Eblen, Charles A. Phillips, Gary L. Rogers, Michael A. Langston:
The Maximum Clique Enumeration Problem: Algorithms, Applications and Implementations. ISBRA 2011: 306-319 - [c50]Jeremy J. Jay, John D. Eblen, Yun Zhang, Mikael Benson, Andy D. Perkins, Arnold M. Saxton, Brynn H. Voy, Elissa J. Chesler, Michael A. Langston:
A Systematic Comparison of Genome Scale Clustering Algorithms - (Extended Abstract). ISBRA 2011: 416-427 - [c49]Jennifer Debroni, John D. Eblen, Michael A. Langston, Wendy J. Myrvold, Peter W. Shor, Dinesh Weerapurage:
A complete resolution of the Keller maximum clique problem. SODA 2011: 129-135 - 2010
- [j52]Sudhir Naswa, Gary L. Rogers Jr., Rachel M. Lynch, Stephen A. Kania, Suchita Das, Elissa J. Chesler, Arnold M. Saxton, Brynn H. Voy, Michael A. Langston:
Inferring gene coexpression networks for low dose ionizing radiation using graph theoretical algorithms and systems genetics. BMC Bioinform. 11(S-4): O5 (2010) - [j51]Gary L. Rogers, Pablo Moscato, Michael A. Langston:
Graph algorithms for machine learning: a case-control study based on prostate cancer populations and high throughput transcriptomic data. BMC Bioinform. 11(S-4): P21 (2010) - [j50]Sally R. Ellingson, Charles A. Phillips, Randy Glenn, Douglas Swanson, Thomas Ha, Daniel Goldowitz, Michael A. Langston:
Serendipitous discoveries in microarray analysis. BMC Bioinform. 11(S-4): P24 (2010) - [c48]Faisal N. Abu-Khzam, Henning Fernau, Michael A. Langston, Serena Lee-Cultura, Ulrike Stege:
A Fixed-Parameter Algorithm for String-to-String Correction. CATS 2010: 31-38 - [c47]Faisal N. Abu-Khzam, Michael A. Langston, Amer E. Mouawad, Clinton P. Nolan:
A Hybrid Graph Representation for Recursive Backtracking Algorithms. FAW 2010: 136-147
2000 – 2009
- 2009
- [j49]Andy D. Perkins, Michael A. Langston:
Threshold selection in gene co-expression networks using spectral graph theory techniques. BMC Bioinform. 10(S-11): 4 (2009) - [j48]Reza Mobini, Bengt A. Andersson, Jonas Erjefält, Mirjana Hahn-Zoric, Michael A. Langston, Andy D. Perkins, Lars Cardell, Mikael Benson:
A module-based analytical strategy to identify novel disease-associated genes shows an inhibitory role for interleukin 7 Receptor in allergic inflammation. BMC Syst. Biol. 3: 19 (2009) - [j47]Mingzhou (Joe) Song, Chris K. Lewis, Eric R. Lance, Elissa J. Chesler, Roumyana Kirova Yordanova, Michael A. Langston, Kerrie H. Lodowski, Susan E. Bergeson:
Reconstructing Generalized Logical Networks of Transcriptional Regulation in Mouse Brain from Temporal Gene Expression Data. EURASIP J. Bioinform. Syst. Biol. 2009 (2009) - [c46]Gary L. Rogers, Andy D. Perkins, Charles A. Phillips, John D. Eblen, Faisal N. Abu-Khzam, Michael A. Langston:
Using out-of-core techniques to produce exact solutions to the maximum clique problem on extremely large graphs. AICCSA 2009: 374-381 - 2008
- [j46]Rodney G. Downey, Michael R. Fellows, Michael A. Langston:
The Computer Journal Special Issue on Parameterized Complexity: Foreword by the Guest Editors. Comput. J. 51(1): 1-6 (2008) - [j45]Michael A. Langston, Andy D. Perkins, Arnold M. Saxton, Jon A. Scharff, Brynn H. Voy:
Innovative Computational Methods for Transcriptomic Data Analysis: A Case Study in the Use of FPT for Practical Algorithm Design and Implementation. Comput. J. 51(1): 26-38 (2008) - [j44]Faisal N. Abu-Khzam, Henning Fernau, Michael A. Langston:
A bounded search tree algorithm for parameterized face cover. J. Discrete Algorithms 6(4): 541-552 (2008) - 2007
- [j43]Faisal N. Abu-Khzam, Michael A. Langston:
Linear-time algorithms for problems on planar graphs with fixed disk dimension. Inf. Process. Lett. 101(1): 36-40 (2007) - [j42]Faisal N. Abu-Khzam, Michael R. Fellows, Michael A. Langston, W. Henry Suters:
Crown Structures for Vertex Cover Kernelization. Theory Comput. Syst. 41(3): 411-430 (2007) - [j41]Frank K. H. A. Dehne, Michael R. Fellows, Michael A. Langston, Frances A. Rosamond, Kim Stevens:
An O(2O(k)n3) FPT Algorithm for the Undirected Feedback Vertex Set Problem. Theory Comput. Syst. 41(3): 479-492 (2007) - [c45]Faisal N. Abu-Khzam, Nagiza F. Samatova, Mohamad A. Rizk, Michael A. Langston:
The Maximum Common Subgraph Problem: Faster Solutions via Vertex Cover. AICCSA 2007: 367-373 - [c44]Hans L. Bodlaender, Michael R. Fellows, Michael A. Langston, Mark A. Ragan, Frances A. Rosamond, Mark Weyer:
Quadratic Kernelization for Convex Recoloring of Trees. COCOON 2007: 86-96 - [c43]Michael R. Fellows, Michael A. Langston, Frances A. Rosamond, Peter Shaw:
Efficient Parameterized Preprocessing for Cluster Editing. FCT 2007: 312-321 - [c42]Michael A. Langston:
Algorithmic Challenges for Systems-Level Correlational Analysis: A Tale of Two Datasets. WADS 2007: 226 - [r1]Michael A. Langston, Carlos Cotta, Pablo Moscato:
Combinatorial and Algorithmic Issues for Microarray Analysis. Handbook of Approximation Algorithms and Metaheuristics 2007 - 2006
- [j40]Faisal N. Abu-Khzam, Michael A. Langston, Pushkar Shanbhag, Christopher T. Symons:
Scalable Parallel Algorithms for FPT Problems. Algorithmica 45(3): 269-284 (2006) - [j39]Brynn H. Voy, Jon A. Scharff, Andy D. Perkins, Arnold M. Saxton, Bhavesh Borate, Elissa J. Chesler, Lisa K. Branstetter, Michael A. Langston:
Extracting Gene Networks for Low-Dose Radiation Using Graph Theoretical Algorithms. PLoS Comput. Biol. 2(7) (2006) - [j38]Rod Downey, Michael A. Langston, Rolf Niedermeier:
Editorial. Theor. Comput. Sci. 351(3): 295 (2006) - [c41]Hans L. Bodlaender, Michael R. Fellows, Michael A. Langston, Mark A. Ragan, Frances A. Rosamond, Mark Weyer:
Kernelization for Convex Recoloring. ACiD 2006: 23-35 - [c40]Ahmed Fadiel, Michael A. Langston, Xinxia Peng, Andy D. Perkins, Hugh S. Taylor, Ozge Tuncalp, D. Vitello, Paul H. Pevsner, Frederick Naftolin:
Computational Analysis of Mass Spectrometry Data Using Novel Combinatorial Methods. AICCSA 2006: 266-273 - [c39]Frank K. H. A. Dehne, Michael A. Langston, Xuemei Luo, Sylvain Pitre, Peter Shaw, Yun Zhang:
The Cluster Editing Problem: Implementations and Experiments. IWPEC 2006: 13-24 - [c38]Kevin Burrage, Vladimir Estivill-Castro, Michael R. Fellows, Michael A. Langston, Shev Mac, Frances A. Rosamond:
The Undirected Feedback Vertex Set Problem Has a Poly(k) Kernel. IWPEC 2006: 192-202 - [c37]Michael A. Langston, Andy D. Perkins, Arnold M. Saxton, Jon A. Scharff, Brynn H. Voy:
Innovative computational methods for transcriptomic data analysis. SAC 2006: 190-194 - [e1]Hans L. Bodlaender, Michael A. Langston:
Parameterized and Exact Computation, Second International Workshop, IWPEC 2006, Zürich, Switzerland, September 13-15, 2006, Proceedings. Lecture Notes in Computer Science 4169, Springer 2006, ISBN 3-540-39098-7 [contents] - 2005
- [c36]Vladimir Estivill-Castro, Michael R. Fellows, Michael A. Langston, Frances A. Rosamond:
FPT is P-Time Extremal Structure I. ACiD 2005: 1-41 - [c35]Faisal N. Abu-Khzam, Henning Fernau, Michael A. Langston:
Asymptotically Faster Algorithms for Parameterized FACE COVER. ACiD 2005: 43-58 - [c34]Faisal N. Abu-Khzam, Michael A. Langston:
Linear-Time Algorithms for Problems on Planar Graphs of Fixed Disk Dimension. ACiD 2005: 59-67 - [c33]Faisal N. Abu-Khzam, Michael A. Langston, W. Henry Suters:
Fast, effective vertex cover kernelization: a tale of two algorithms. AICCSA 2005: 16 - [c32]W. Henry Suters, Faisal N. Abu-Khzam, Yun Zhang, Christopher T. Symons, Nagiza F. Samatova, Michael A. Langston:
A New Approach and Faster Exact Methods for the Maximum Common Subgraph Problem. COCOON 2005: 717-727 - [c31]Frank K. H. A. Dehne, Michael R. Fellows, Michael A. Langston, Frances A. Rosamond, Kim Stevens:
An O(2O(k)n3) FPT Algorithm for the Undirected Feedback Vertex Set Problem. COCOON 2005: 859-869 - [c30]Frederick T. Sheldon, Stephen Gordon Batsell, Stacy J. Prowell, Michael A. Langston:
Position Statement: Methodology to Support Dependable Survivable Cyber-Secure Infrastructures. HICSS 2005 - [c29]Elissa J. Chesler, Michael A. Langston:
Combinatorial Genetic Regulatory Network Analysis Tools for High Throughput Transcriptomic Data. Systems Biology and Regulatory Genomics 2005: 150-165 - [c28]Yun Zhang, Faisal N. Abu-Khzam, Nicole E. Baldwin, Elissa J. Chesler, Michael A. Langston, Nagiza F. Samatova:
Genome-Scale Computational Approaches to Memory-Intensive Applications in Systems Biology. SC 2005: 12 - 2004
- [c27]Faisal N. Abu-Khzam, Rebecca L. Collins, Michael R. Fellows, Michael A. Langston, W. Henry Suters, Christopher T. Symons:
Kernelization Algorithms for the Vertex Cover Problem: Theory and Experiments. ALENEX/ANALC 2004: 62-69 - [c26]Faisal N. Abu-Khzam, Michael A. Langston:
Grid Computing: Minitrack Introduction. HICSS 2004 - [c25]Nicole E. Baldwin, Rebecca L. Collins, Michael A. Langston, Christopher T. Symons, Michael R. Leuze, Brynn H. Voy:
High Performance Computational Tools for Motif Discovery. IPDPS 2004 - [c24]Faisal N. Abu-Khzam, Michael A. Langston:
A Direct Algorithm for the Parameterized Face Cover Problem. IWPEC 2004: 213-222 - [c23]Michael A. Langston:
Practical FPT Implementations and Applications (Invited Talk). IWPEC 2004: 291-292 - [c22]Faisal N. Abu-Khzam, Michael A. Langston, Pushkar Shanbhag:
Scalable parallel algorithms for difficult combinatorial problems: A case study in optimization. Parallel and Distributed Computing and Networks 2004: 649-654 - 2003
- [c21]Faisal N. Abu-Khzam, Michael A. Langston:
Graph Coloring and the Immersion Order. COCOON 2003: 394-403 - 2002
- [c20]Jeanne M. Lehrter, Faisal N. Abu-Khzam, Donald W. Bouldin, Michael A. Langston, Gregory D. Peterson:
On Special-purpose Hardware Clusters for High-performance Computational Grids. IASTED PDCS 2002: 1-5 - [c19]Faisal N. Abu-Khzam, Nagiza F. Samatova, George Ostrouchov, Michael A. Langston, Al Geist:
Distributed Dimension Reduction Algorithms for Widely Dispersed Data. IASTED PDCS 2002: 167-174 - 2001
- [c18]Sze-Wei Ong, Nabil Kerkiz, Bernadeta Srijanto, Chandra Tan, Michael A. Langston, Danny F. Newport, Donald W. Bouldin:
Automatic Mapping of Multiple Applications to Multiple Adaptive Computing Systems. FCCM 2001: 10-20 - 2000
- [j37]Kevin Cattell, Michael J. Dinneen, Rodney G. Downey, Michael R. Fellows, Michael A. Langston:
On computing graph minor obstruction sets. Theor. Comput. Sci. 233(1-2): 107-127 (2000)
1990 – 1999
- 1999
- [j36]Heather Booth, Rajeev Govindan, Michael A. Langston, Siddharthan Ramachandramurthi:
Fast Algorithms forK4Immersion Testing. J. Algorithms 30(2): 344-378 (1999) - 1998
- [j35]Michael A. Langston, Barbara C. Plaut:
On algorithmic applications of the immersion order : An overview of ongoing work presented at the Third Slovenian International Conference on Graph Theory. Discret. Math. 182(1-3): 191-196 (1998) - [j34]Rajeev Govindan, Michael A. Langston, Xudong Yan:
Approximation the Pathwidth of Outerplanar Graphs. Inf. Process. Lett. 68(1): 17-23 (1998) - 1997
- [c17]Michael A. Langston, Stephan Olariu, James L. Schwing:
Parallel and Distributed Algorithms. HICSS (1) 1997: 171 - 1996
- [j33]Michael A. Langston:
An Introduction to the Special Issue. Parallel Algorithms Appl. 8(1): 1-2 (1996) - 1995
- [c16]Clay P. Breshears, Michael A. Langston:
Parallel Benchmarks and Comparison-Based Computing. PARCO 1995: 581-584 - 1994
- [j32]Nancy G. Kinnersley, Michael A. Langston:
obstruction Set Isolation for the Gate Matrix Layout Problem. Discret. Appl. Math. 54(2-3): 169-213 (1994) - [j31]Michael R. Fellows, Michael A. Langston:
On Search, Decision, and the Efficiency of Polynomial-Time Algorithms. J. Comput. Syst. Sci. 49(3): 769-779 (1994) - [j30]Clay P. Breshears, Michael A. Langston:
Mimd versus Simd Computation: Experience with Non-numeric Parallel Algorithms. Parallel Algorithms Appl. 2(1-2): 123-138 (1994) - 1993
- [c15]Michael A. Langston:
Concurrency and Parallelism - Introduction. ICCI 1993: 214 - [c14]Rajeev Govindan, Michael A. Langston, Siddharthan Ramachandramurthi:
A Practical Approach to Layout Optimization. VLSI Design 1993: 222-225 - 1992
- [j29]Bing-Chao Huang, Michael A. Langston:
Fast Stable Merging and Sorting in Constant Extra Space. Comput. J. 35(6): 643-650 (1992) - [j28]Xiaojun Guan, Michael A. Langston:
Parallel Methods for Solving Fundamental File Rearrangement Problems. J. Parallel Distributed Comput. 14(4): 436-439 (1992) - [j27]Michael R. Fellows, Michael A. Langston:
On Well-Partial-Order Theory and its Application to Combinatorial Problems of VLSI Design. SIAM J. Discret. Math. 5(1): 117-126 (1992) - [j26]Lowell Campbell, Gunnar E. Carlsson, Michael J. Dinneen, Vance Faber, Michael R. Fellows, Michael A. Langston, James W. Moore, Andrew P. Mullhaupt, Harlan B. Sexton:
Small Diameter Symmetric Networks from Linear Groups. IEEE Trans. Computers 41(2): 218-220 (1992) - [c13]Heather Booth, Rajeev Govindan, Michael A. Langston, Siddharthan Ramachandramurthi:
Cutwidth approximation in linear time. Great Lakes Symposium on VLSI 1992: 70-73 - 1991
- [j25]Karl R. Abrahamson, Michael R. Fellows, Michael A. Langston, Bernard M. E. Moret:
Constructive complexity. Discret. Appl. Math. 34(1-3): 3-16 (1991) - [j24]Michael R. Fellows, Michael A. Langston:
Fast search algorithms for layout permutation problems. Integr. 12(3): 321-337 (1991) - [j23]Bing-Chao Huang, Michael A. Langston:
Stable Set and Multiset Operations in Optimal Time and Space. Inf. Process. Lett. 39(3): 131-136 (1991) - [j22]Donald K. Friesen, Michael A. Langston:
Analysis of a Compound bin Packing Algorithm. SIAM J. Discret. Math. 4(1): 61-79 (1991) - [j21]Xiaojun Guan, Michael A. Langston:
Time-Space Optimal Parallel Merging and Sorting. IEEE Trans. Computers 40(5): 596-602 (1991) - [c12]Michael R. Fellows, Michael A. Langston:
Constructivity Issues in Graph Algorithms. Constructivity in Computer Science 1991: 150-158 - [c11]Michael A. Langston, Siddharthan Ramachandramurthi:
Dense layouts for series-parallel circuits. Great Lakes Symposium on VLSI 1991: 14-17 - [c10]Michael A. Langston:
An obstruction-based approach to layout optimization. Graph Structure Theory 1991: 623-629 - 1990
- [j20]Michael A. Langston, Michael P. Morford:
Resource allocation under limited sharing. Discret. Appl. Math. 28(2): 135-147 (1990) - [c9]Michael A. Langston:
Time-Space Optimal Parallel Algorithms (Abstract). ICCI 1990: 8 - [c8]Xiaojun Guan, Michael A. Langston:
Time-Space Optimal Parallel Set Operations. PARBASE 1990: 155-157
1980 – 1989
- 1989
- [j19]Bing-Chao Huang, Michael A. Langston:
Stable Duplicate-Key Extraction with Optimal Time and Space Bounds. Acta Informatica 26(5): 473-484 (1989) - [j18]Nancy G. Kinnersley, Michael A. Langston:
Online variable-sized bin packing. Discret. Appl. Math. 22(2): 143-148 (1989) - [c7]Michael R. Fellows, Nancy G. Kinnersley, Michael A. Langston:
Finite-Basis Theorems and a Computation-Integrated Approach to Obstruction Set Isolation. Computers and Mathematics 1989: 37-45 - [c6]Michael R. Fellows, Michael A. Langston:
An Analogue of the Myhill-Nerode Theorem and Its Use in Computing Finite-Basis Characterizations (Extended Abstract). FOCS 1989: 520-525 - [c5]Xiaojun Guan, Michael A. Langston:
Time-Space Optimal Parallel Merging and Sorting. ICPP (3) 1989: 1-8 - [c4]Michael R. Fellows, Michael A. Langston:
On Search, Decision and the Efficiency of Polynomial-Time Algorithms (Extended Abstract). STOC 1989: 501-512 - 1988
- [j17]Michael R. Fellows, Donald K. Friesen, Michael A. Langston:
On Finding Optimal and Near-Optimal Lineal Spanning Trees. Algorithmica 3: 549-560 (1988) - [j16]Ivan Stojmenovic, Michael A. Langston:
On a Proposed Divide-And-Conquer Minimal Spanning Tree Algorithm. BIT 28(4): 785-789 (1988) - [j15]Bing-Chao Huang, Michael A. Langston:
Practical In-Place Merging. Commun. ACM 31(3): 348-352 (1988) - [j14]Michael R. Fellows, Michael A. Langston:
Nonconstructive tools for proving polynomial-time decidability. J. ACM 35(3): 727-739 (1988) - [j13]Manfred Kunde, Michael A. Langston, Jin-Ming Liu:
On a Special Case of Uniform Processor Scheduling. J. Algorithms 9(2): 287-296 (1988) - [j12]Michael R. Fellows, Michael A. Langston:
Processor Utilization in a Linearly Connected Parallel Processing System. IEEE Trans. Computers 37(5): 594-603 (1988) - [c3]Michael R. Fellows, Michael A. Langston:
Fast Self-Reduction Algorithms for Combinatorical Problems of VLSI-Design. AWOC 1988: 278-287 - [c2]Bing-Chao Huang, Michael A. Langston:
Stable Set and Multiset Operations in Optimal Time and Space. PODS 1988: 288-293 - 1987
- [j11]Donald K. Friesen, Michael A. Langston:
Bin Packing: On Optimizing the Number of Pieces Packed. BIT 27(2): 148-156 (1987) - [j10]Michael A. Langston:
Interstage Transportation Planning in the Deterministic Flow-Shop Environment. Oper. Res. 35(4): 556-564 (1987) - [j9]Michael R. Fellows, Michael A. Langston:
Nonconstructive Advances in Polynomial-Time Complexity. Inf. Process. Lett. 26(3): 155-162 (1987) - [j8]Chul E. Kim, Michael A. Langston:
Movement coordination for single-track robot systems. J. Field Robotics 4(1): 49-62 (1987) - [j7]Narsingh Deo, Mukkai S. Krishnamoorthy, Michael A. Langston:
Exact and Approximate Solutions for the Gate Matrix Layout Problem. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 6(1): 79-84 (1987) - 1986
- [j6]Donald K. Friesen, Michael A. Langston:
Evaluation of a MULTIFIT-Based Scheduling Algorithm. J. Algorithms 7(1): 35-59 (1986) - [j5]Donald K. Friesen, Michael A. Langston:
Variable Sized Bin Packing. SIAM J. Comput. 15(1): 222-230 (1986) - 1985
- [c1]Michael A. Langston, Chul E. Kim:
Movement coordination for single-track robot systems. ICRA 1985: 523-529 - 1984
- [j4]Edward G. Coffman Jr., Michael A. Langston:
A Performance Guarantee for the Greedy Set-Partitioning Algorithm. Acta Informatica 21: 409-415 (1984) - [j3]Donald K. Friesen, Michael A. Langston:
A Storage-Size Selection Problem. Inf. Process. Lett. 18(5): 295-296 (1984) - 1983
- [j2]Donald K. Friesen, Michael A. Langston:
Bounds for Multifit Scheduling on Uniform Processors. SIAM J. Comput. 12(1): 60-70 (1983) - 1982
- [j1]Michael A. Langston:
Improved 0/1-Interchange Scheduling. BIT 22(3): 282-290 (1982)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
