default search action
David Shallcross
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i1]Yupeng Cao, Aishwarya Muralidharan Nair, Elyon Eyimife, Nastaran Jamalipour Soofi, K. P. Subbalakshmi, John R. Wullert II, Chumki Basu, David Shallcross:
Can Large Language Models Detect Misinformation in Scientific News Reporting? CoRR abs/2402.14268 (2024)
2010 – 2019
- 2015
- [c12]Rauf Izmailov
, Devasis Bassu, Allen McIntosh, Linda Ness, David Shallcross:
Application of multi-scale singular vector decomposition to vessel classification in overhead satellite imagery. ICDIP 2015: 963108 - [c11]Brian Thompson, Linda Ness, David Shallcross, Devasis Bassu:
Discovering Functional Communities in Social Media. ICDM Workshops 2015: 917-924 - 2014
- [c10]Giovanni Di Crescenzo, David Shallcross:
On Minimizing the Size of Encrypted Databases. DBSec 2014: 364-372 - 2013
- [j15]Ossama Younis, Latha A. Kant, Kenneth Young, David Shallcross, Kyriakos Manousakis, Kaustubh Sinkar, Miriam Tauil, Sunil Samtani, Charles Graff, Mitesh P. Patel:
Automated design algorithms for tactical wireless networks. Ad Hoc Networks 11(8): 2461-2469 (2013) - 2012
- [j14]Martin I. Eiger, Hanan Luss, David Shallcross:
Network restoration under dual failures using path-protecting preconfigured cycles. Telecommun. Syst. 49(3): 271-286 (2012) - [c9]Devasis Bassu, Rauf Izmailov
Centralized multi-scale singular value decomposition for feature construction in LIDAR image classification problems. AIPR 2012: 1-6 - [c8]Ossama Younis, David Shallcross, Latha A. Kant, Kenneth Young, Charles Graff, Mitesh P. Patel:
TDMA scheduling and channel assignment for cognitive tactical networks. MILCOM 2012: 1-6 - 2011
- [j13]Martin I. Eiger, Hanan Luss, David Shallcross:
Network restoration under a single link or node failure using Preconfigured Virtual Cycles. Telecommun. Syst. 46(1): 17-30 (2011) - [c7]Miriam Tauil, David Shallcross, Latha A. Kant, Charles Graff, Mitesh P. Patel:
Spectrum allocation in C-NEDAT: A tool to automate MANET design and opportunistically adapt network spectrum use. MILCOM 2011: 1702-1707 - 2010
- [j12]Ossama Younis, Latha A. Kant, Anthony J. McAuley, Kyriakos Manousakis, David Shallcross, Kaustubh Sinkar, Kirk Chang, Kenneth Young, Charles Graff, Mitesh P. Patel:
Cognitive tactical network models. IEEE Commun. Mag. 48(10): 70-77 (2010) - [c6]K. R. Krishnan, David Shallcross, Latha A. Kant:
Joint optimization of scheduling and multicast trees by column-generation. WiOpt 2010: 578-583
2000 – 2009
- 2008
- [j11]Latha A. Kant, Kenneth Young, Ossama Younis, David Shallcross, Kaustubh Sinkar, Anthony J. McAuley, Kyriakos Manousakis, Kirk Chang, Charles Graff:
Network science based approaches to design and analyze MANETs for military applications. IEEE Commun. Mag. 46(11): 55-61 (2008) - [c5]Ben Falchuk, David Shallcross:
Simulating and implementing geospatially-based binding mechanisms for mobile peering. AMBI-SYS 2008: 23 - 2006
- [c4]Shoshana Loeb, Benjamin Falchuk, Mark W. Garrett, Abdelhakim Hafid, K. Kim, K. R. Krishnan, David Shallcross:
Impact of services on network capacity: tool for seamless integration of service and network modeling. CCNC 2006: 1328-1329 - 2001
- [j10]Tamra Carpenter, Martin I. Eiger, David Shallcross, Paul D. Seymour
Node Placement and Sizing for Copper Broadband Access Networks. Ann. Oper. Res. 106(1-4): 199-228 (2001) - [j9]Fan R. K. Chung, Mark W. Garrett, Ronald L. Graham, David Shallcross:
Distance Realization Problems with Applications to Internet Tomography. J. Comput. Syst. Sci. 63(3): 432-448 (2001)
1990 – 1999
- 1998
- [j8]Imre Bárány, Herbert E. Scarf, David Shallcross:
The topological structure of maximal lattice free convex bodies: The general case. Math. Program. 80: 1-15 (1998) - [j7]David Shallcross, Victor Y. Pan, Yu Lin-Kriz:
Planar Integer Linear Programming is NC Equivalent to Euclidean GCD. SIAM J. Comput. 27(4): 960-971 (1998) - 1996
- [c3]Milena Mihail, David Shallcross, Nate Dean, Marco Mostrel:
A Commercial Application of Survivable Network Design: ITP/INPLANS CCS Network Topology Analyzer. SODA 1996: 279-287 - 1995
- [c2]Imre Bárány, Herbert E. Scarf, David Shallcross:
The Topological Structure of Maximal Lattice Free Convex Bodies: The General Case. IPCO 1995: 244-251 - 1993
- [j6]William J. Cook, Thomas Rutherford, Herbert E. Scarf, David Shallcross:
An Implementation of the Generalized Basis Reduction Algorithm for Integer Programming. INFORMS J. Comput. 5(2): 206-212 (1993) - [j5]Herbert E. Scarf, David F. Shallcross:
The Frobenius Problem and Maximal Lattice Free Bodies. Math. Oper. Res. 18(3): 511-515 (1993) - [j4]Herbert E. Scarf, David F. Shallcross:
Shortest Integer Vectors. Math. Oper. Res. 18(3): 516-522 (1993) - [c1]David Shallcross, Victor Y. Pan, Yu Lin-Kriz:
The NC Equivalence of Planar Integer Linear Programming and Euclidean GCD. FOCS 1993: 557-564 - 1992
- [j3]David Shallcross:
Neighbors of the Origin for Four by Three Matrices. Math. Oper. Res. 17(3): 608-614 (1992) - [j2]David F. Shallcross:
A polynomial algorithm for a one machine batching problem. Oper. Res. Lett. 11(4): 213-218 (1992)
1980 – 1989
- 1989
- [j1]Clyde L. Monma, David F. Shallcross:
Methods for Designing Communications Networks with Certain Two-Connected Survivability Constraints. Oper. Res. 37(4): 531-541 (1989)
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-04-24 23:10 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: