• S. Man, D. Hong, M. A. Palis. and J. Martin “A Computational Model for Signaling Pathways in Bounded Small-World Networks Corresponding to Brain Size”, Neurocomputing, 74 (2011), pp. 3793-3799.
• M. A. Palis, “The Granularity Metric for Fine-Grain Real-Time Scheduling”, IEEE Transactions on Computers, 15:12 (Dec. 2005), pp. 1572-1583.
• M. A. Palis, “Competitive Algorithms for Fine-Grain Real-Time Scheduling”, Proc. 25th IEEE International Real-Time Systems Symposium, Dec. 5-8, 2004, Lisbon, Portugal, pp. 129-138.
• M. A. Palis, “On the Competitiveness of Real-Time Task Scheduling with Rate of Progress Guarantees”, International Journal of Foundations of Computer Science, 14:3 (2003), pp. 359-370.
• B. Dasgupta and M. A. Palis, “Online Real-Time Preemptive Scheduling of Jobs with Deadlines on Multiple Machines”, Journal of Scheduling, 4:6 (Nov. 2001), pp. 297-312.
• B. Dasgupta and M. A. Palis, “Provably Good Algorithms for Transmission Scheduling in WDM Optical Networks“, Journal of Parallel and Distributed Computing, 57:3 (1999), pp. 345-357.
• J.-C. Liou and M. A. Palis, “CASS: An Efficient Task Management System for Distributed Memory Architectures”, Proc.1997 International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN’97), Taipei , Taiwan , Dec. 1997, pp. 289-295.
• M. A. Palis, J.-C. Liou and D. S. L. Wei, “Task Clustering and Scheduling for Distributed Memory Parallel Architectures”, IEEE Transactions on Parallel and Distributed Systems, 7:1 (1996), pp. 46-55.
• M. A. Palis and S. Shende , “Pumping Lemmas for the Control Language Hierarchy”, Mathematical Systems Theory, 28 (1995), pp. 199-213.
• M. A. Palis, S. Rajasekaran , and D. S. L. Wei, “Packet Routing and PRAM Emulation on Star Graphs and Leveled Networks”, Journal of Parallel and Distributed Computing, 20:2 (1994), pp. 145-157.
• M. A. Palis and D. S. L. Wei, “Massively Parallel Parsing Algorithms for Natural Language”, Parallel Processing for Artificial Intelligence, L. N. Kanal, V. Kumar, H. Kitano, and C. B. Suttner (editors), Elsevier Science B. V., Springer-Verlag, 1994, pp. 365-407.
• M. A. Palis and S. Shende, “Upper Bounds on Recognition of a Hierarchy of Non-Context-Free Languages”, Theoretical Computer Science, 98:2 (1992), pp. 289-319.
• M. A. Palis, S. Rajasekaran, and D. S. L. Wei, “Emulation of a PRAM on Leveled Networks“, Proc. 1991 International Conference on Parallel Processing, St. Charles, IL, August 1991, pp. I-418 – I-421.
• O. H. Ibarra, T. Jiang, J. H. Chang and M. A. Palis, “Systolic Algorithms for Some Scheduling and Graph Problems”, Journal of VLSI Signal Processing, 1 (1990) pp. 307-320.
• M. A. Palis, S. Shende , and D. S. L. Wei, “An Optimal Linear-Time Parallel Parser for Tree Adjoining Languages”, SIAM Journal on Computing, 19:1 (1990), pp. 1.-31.
• J. H. Chang, O. H. Ibarra, and M. A. Palis, “Efficient Simulations of Simple Models of Parallel Computation by Space-Bounded TM’s and Time Bounded Alternating TM’s”, Theoretical Computer Science, 68:1 (1989), pp. 19-36.
• O. H. Ibarra and M. A. Palis, “Two-Dimensional Systolic Arrays: Characterizations and Applications”, Theoretical Computer Science, 57:1 (1988), pp. 47-86.
• O. H. Ibarra and M. A. Palis, “ VLSI Algorithms for Solving Recurrence Equations and Applications”, IEEE Transactions on Acoustics, Speech and Signal Processing, ASSP-35:7 (1987), pp. 1046-1064.
• O. H. Ibarra, S. M. Kim, and M. A. Palis, “ Designing Systolic Algorithms Using Sequential Machines”, IEEE Transactions on Computers, C-35:6 (June 1986), pp. 531-542.
• O. H. Ibarra, M. A. Palis, and S. M. Kim, “Fast Parallel Language Recognition by Cellular Automata”, Theoretical Computer Science, 41 (1985), pp. 231-246.
• O. H. Ibarra, M. A. Palis, and S. M. Kim, “Some Results Concerning Linear Iterative (Systolic) Arrays”, Journal of Parallel and Distributed Computing, 2 (1985), pp. 182-218.