J. Czyzowicz, K. Giorgiou, E. Kranakis, D. Krizanc, L. Narayanan, J. Opatrny, and S. Shende, “Search on a line by byzantine robots,” International Journal of Foundations of Computer Science, vol. 32, no. 4, pp. 369–387, 2021, Available: https://doi.org/10.1142/S0129054121500209

J. Czyzowicz, K. Georgiou, R. Killick, E. Kranakis, D. Krizanc, M. Lafond, L. Narayanan, J. Opatrny, and S. Shende, “Time-energy tradeoffs for evacuation by two robots in the wireless model,” Theoretical Computer Science, vol. 852, pp. 61–72, 2021, Available: https://doi.org/10.1016/j.tcs.2020.11.014

J. Czyzowicz, K. Georgiou, R. Killick, E. Kranakis, D. Krizanc, L. Narayanan, J. Opatrny, and S. Shende, “Priority evacuation from a disk: The case of n ≥ 4,” Theoretical Computer Science, vol. 846, pp. 91–102, 2020, Available: https://doi.org/10.1016/j.tcs.2020.09.023

D. P. Russo, X. Yan, S. Shende, H. Huang, B. Yan, and H. Zhu, “Virtual molecular projections and convolutional neural networks for the end-to-end modeling of nanoparticle activities and properties,” Analytical Chemistry, vol. 92, no. 20, pp. 13971–13979, 2020, Available: https://pubs.acs.org/doi/abs/10.1021/acs.analchem.0c02878

B. S. C. Koritala et al., “Habitat-specific clock variation and its consequence on reproductive fitness,” Journal of Biological Rhythms, 2019, Available: https://doi.org/10.1177/0748730419896486

J. Czyzowicz, K. Georgiou, R. Killick, E. Kranakis, D. Krizanc, L. Narayanan, J. Opatrny, and S. Shende, “Priority evacuation from a disk: The case of n = 1, 2, 3,” Theoretical Computer Science, vol. 806, pp. 595–616, 2020, Available: https://doi.org/10.1016/j.tcs.2019.09.026

D. P. Russo, J. Strickland, A. L. Karmaus, W. Wang, S. Shende, T. Hartung, L. M. Aleksunes, and H. Zhu, “Non-animal models for acute toxicity evaluations: Applying data-driven profiling and read-across,” Environmental Health Perspectives, vol. 127, no. 4, pp. 1–14, 2019, Available: https://doi.org/10.1289/EHP3614

D. P. Russo, W. Wang, M. T. Kim, D. Pinolini, S. Shende, J. Strickland, T. Hartung, and H. Zhu, “CIIPro: A new read-across portal to fill data gaps using public large scale chemical and biological data,” Bioinformatics, vol. 33, no. 3, pp. 464–466, 2017, Available: https://doi.org/10.1093/bioinformatics/btw640

M. Eftekhari, E. Kranakis, D. Krizanc, O. Morales-Ponce, L. Narayanan, J. Opatrny, and S. Shende, “Distributed algorithms for barrier coverage using relocatable sensors,” Distributed Computing, vol. 29, no. 5, pp. 361–376, 2016, Available: http://dx.doi.org/10.1007/s00446-016-0267-x

M. Golin, J. Iacono, D. Krizanc, R. Raman, S. R. Satti, and S. Shende, “Encoding 2D range maximum queries,” Theor. Comput. Sci., vol. 609, pp. 316–327, 2016, Available: http://dx.doi.org/10.1016/j.tcs.2015.10.012

S. Dobrev et al., “Complexity of barrier coverage with relocatable sensors in the plane,” Theor. Comput. Sci., vol. 579, pp. 64–73, 2015, Available: http://dx.doi.org/10.1016/j.tcs.2015.02.006

A. Ganchev, L. Narayanan, and S. Shende, “A tight characterization of strategic games with a unique equilibrium,” Theor. Comput. Sci., vol. 481, pp. 37–50, 2013, Available: http://dx.doi.org/10.1016/j.tcs.2013.02.008

E. Kranakis, D. Krizanc, and S. Shende, “Tracking mobile users in cellular networks using timing information,” Nordic J. Comput., vol. 14, no. 3, pp. 202–215, 2008.

A. Ganchev, L. Narayanan, and S. Shende, “Games to induce specified equilibria,” Theor. Comput. Sci., vol. 409, no. 3, pp. 341–350, 2008, Available: http://dx.doi.org/10.1016/j.tcs.2008.06.011

G. Kortsarz and S. Shende, “An improved approximation of the achromatic number on bipartite graphs,” SIAM J. Discrete Math., vol. 21, no. 2, pp. 361–373, 2007, Available: https://dx.doi.org/10.1137/S0895480104442947

E. Kranakis, D. Krizanc, and S. Shende, “Approximate hotlink assignment,” Inf. Process. Lett., vol. 90, no. 3, pp. 121–128, 2004, Available: http://dx.doi.org/10.1016/j.ipl.2004.01.012

L. Narayanan and S. M. Shende, “Static frequency assignment in cellular networks,” Algorithmica, vol. 29, no. 3, pp. 396–409, 2001, Available: http://dx.doi.org/10.1007/s004530010067

J. Janssen, D. Krizanc, L. Narayanan, and S. Shende, “Distributed online frequency assignment in cellular networks,” J. Algorithms, vol. 36, no. 2, pp. 119–151, 2000, Available: http://dx.doi.org/10.1006/jagm.1999.1068

N. Memon, D. L. Neuhoff, and S. Shende, “An analysis of some common scanning techniques for lossless image coding,” IEEE Transactions on Image Processing, vol. 9, no. 11, pp. 1837–1848, 2000, Available: http://dx.doi.org/10.1109/83.877207

B. Narahari, S. Shende, R. Simha, and S. R. Subramanya, “Routing and scheduling I/O transfers on wormhole-routed mesh networks,” J. Parallel Distrib. Comput., vol. 57, no. 1, pp. 1–13, 1999, Available: http://dx.doi.org/10.1006/jpdc.1998.1506

T. Feder and S. M. Shende, “Online channel allocation in FDMA networks with reuse constraints,” Inf. Process. Lett., vol. 67, no. 6, pp. 295–302, 1998, Available: http://dx.doi.org/10.1016/S0020-0190(98)00126-4

L. Narayanan and S. Shende, “Partial characterizations of networks supporting shortest path interval labeling schemes,” Networks, vol. 32, no. 2, pp. 103–113, 1998, Available: https://doi.org/10.1002/(SICI)1097-0037(199809)32:2<103::AID-NET3>3.0.CO;2-F

B. Narahari, S. Shende, and R. Simha, “Efficient algorithms for erasure node placement on slotted dual bus networks,” IEEE/ACM Transactions on Networking, vol. 4, no. 5, pp. 779–784, 1996, Available: http://dx.doi.org/10.1109/90.541325

M. A. Palis and S. M. Shende, “Pumping lemmas for the control language hierarchy,” Mathematical Systems Theory, vol. 28, no. 3, pp. 199–213, 1995, Available: http://dx.doi.org/10.1007/BF01303055

M. A. Palis, J.-C. Liou, S. Rajasekaran, S. Shende, and D. S. L. Wei, “Online scheduling of dynamic trees,” Parallel Processing Letters, vol. 5, pp. 635–646, 1995, Available: http://dx.doi.org/10.1142/S0129626495000564

J. Y.-T. Leung and S. M. Shende, “On multidimensional packet routing for meshes with buses,” J. Parallel Distrib. Comput., vol. 20, no. 2, pp. 187–197, 1994, Available: http://dx.doi.org/10.1006/jpdc.1994.1018

D. Krizanc, S. Rajasekaran, and S. M. Shende, “A comparison of meshes with static buses and half-duplex wrap-arounds,” Parallel Processing Letters, vol. 3, pp. 109–114, 1993, Available: https://dx.doi.org/10.1142/S0129626493000149

M. A. Palis and S. M. Shende, “An NC algorithm for recognizing tree adjoining languages,” International Journal of Parallel Programming, vol. 21, no. 2, pp. 151–167, 1992, Available: http://dx.doi.org/10.1007/BF01408291

M. A. Palis and S. M. Shende, “Upper bounds on recognition of a hierarchy of non-context-free languages,” Theor. Comput. Sci., vol. 98, no. 2, pp. 289–319, 1992, Available: http://dx.doi.org/10.1016/0304-3975(92)90005-Z

M. A. Palis, S. Shende, and D. S. L. Wei, “An optimal linear-time parallel parser for tree adjoining languages,” SIAM J. Comput., vol. 19, no. 1, pp. 1–31, 1990, Available: http://dx.doi.org/10.1137/0219001