default search action
Michael A. Palis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
- [j28]Shushuang Man, Dawei Hong, Michael A. Palis, Joseph V. Martin
:
A computational model for signaling pathways in bounded small-world networks corresponding to brain size. Neurocomputing 74(18): 3793-3799 (2011)
2000 – 2009
- 2007
- [r1]Michael A. Palis:
Real-Time Scheduling Algorithms for Multiprocessor Systems. Handbook of Parallel Computing 2007 - 2005
- [j27]Michael A. Palis:
The Granularity Metric for Fine-Grain Real-Time Scheduling. IEEE Trans. Computers 54(12): 1572-1583 (2005) - 2004
- [c15]Michael A. Palis:
Competitive Algorithms for Fine-Grain Real-Time Scheduling. RTSS 2004: 129-138 - 2003
- [j26]Michael A. Palis:
On the Competitiveness of Online Real-Time Scheduling with Rate of Progress Guarantees. Int. J. Found. Comput. Sci. 14(3): 359-370 (2003) - 2002
- [c14]Michael A. Palis:
Online Real-Time Job Scheduling with Rate of Progress Guarantees. ISPAN 2002: 65-70 - 2001
- [j25]Michael A. Palis:
Special Issue on Parallel and Distributed Computing. Int. J. Found. Comput. Sci. 12(3): 245-247 (2001) - 2000
- [c13]Bhaskar DasGupta, Michael A. Palis:
Online real-time preemptive scheduling of jobs with deadlines. APPROX 2000: 96-107
1990 – 1999
- 1999
- [j24]Bhaskar DasGupta, Michael A. Palis:
Provably Good Algorithms for Transmission Scheduling in WDM Optical Networks. J. Parallel Distributed Comput. 57(3): 345-357 (1999) - 1998
- [j23]D. Frank Hsu, Michael A. Palis, David S. L. Wei:
Editor's Foreword. Int. J. Found. Comput. Sci. 9(1): 1- (1998) - [j22]Jing-Chiou Liou, Michael A. Palis:
On the Effectiveness of Compiler-Time Scheduling Approaches for Distributed Memory Multiprocessor. J. Inf. Sci. Eng. 14(1): 7-26 (1998) - [c12]Jing-Chiou Liou, Michael A. Palis:
A New Heuristic for Scheduling Parallel Programs on Multiprocessor. IEEE PACT 1998: 358-365 - 1997
- [j21]Jing-Chiou Liou, Michael A. Palis, David S. L. Wei:
Performance Analysis of Task Clustering Heuristics for Scheduling Static Dags on Multiprocessor System*. Parallel Algorithms Appl. 12(1-3): 185-203 (1997) - [c11]Jing-Chiou Liou, Michael A. Palis:
A Comparison of General Approaches to Multiprocessor Scheduling. IPPS 1997: 152-156 - [c10]Jing-Chiou Liou, Michael A. Palis:
CASS: an efficient task management system for distributed memory architectures. ISPAN 1997: 289-295 - 1996
- [j20]Michael A. Palis, Jing-Chiou Liou, David S. L. Wei:
Task Clustering and Scheduling for Distributed Memory Parallel Architectures. IEEE Trans. Parallel Distributed Syst. 7(1): 46-55 (1996) - 1995
- [j19]Michael A. Palis, Sunil M. Shende:
Pumping Lemmas for the Control Language Hierarchy. Math. Syst. Theory 28(3): 199-213 (1995) - [j18]Michael A. Palis, Jing-Chiou Liou, Sanguthevar Rajasekaran, Sunil M. Shende, David S. L. Wei:
Online Scheduling of Dynamic Trees. Parallel Process. Lett. 5: 635-646 (1995) - [c9]Michael A. Palis, David S. L. Wei:
Backtracking and Branch-and-Bound on Mesh-Connected Computers with Reconfigurable Buses. Parallel and Distributed Computing and Systems 1995: 243-247 - 1994
- [j17]Michael A. Palis, Sanguthevar Rajasekaran, David S. L. Wei:
Packet Routing and PRAM Emulation on Star Graphs and Leveled Networks. J. Parallel Distributed Comput. 20(2): 145-157 (1994) - [c8]Michael A. Palis, Jing-Chiou Liou, David S. L. Wei:
A greedy task clustering heuristic that is provably good. ISPAN 1994: 398-405 - 1992
- [j16]Michael A. Palis, David S. L. Wei:
Parallel parsing of Tree Adjoining Grammars on the Connection Machine. Int. J. Parallel Program. 21(1): 1-38 (1992) - [j15]Michael A. Palis, Sunil M. Shende:
An NC algorithm for recognizing tree adjoining languages. Int. J. Parallel Program. 21(2): 151-167 (1992) - [j14]Michael A. Palis, Sunil M. Shende:
Upper Bounds on Recognition of a Hierarchy of Non-Context-Free Languages. Theor. Comput. Sci. 98(2): 289-319 (1992) - 1991
- [c7]Michael A. Palis, Sanguthevar Rajasekaran, David S. L. Wei:
Emulation of a PRAM on Leveled Networks. ICPP (1) 1991: 418-421 - 1990
- [j13]Oscar H. Ibarra, Michael A. Palis:
An efficient all-parses systolic algorithm for general context-free parsing. Int. J. Parallel Program. 19(4): 295-331 (1990) - [j12]Michael A. Palis, Sunil M. Shende, David S. L. Wei:
An Optimal Linear-Time Parallel Parser for Tree Adjoining Languages. SIAM J. Comput. 19(1): 1-31 (1990) - [j11]Oscar H. Ibarra, Tao Jiang, Jik H. Chang, Michael A. Palis:
Systolic algorithms for some scheduling and graph problems. J. VLSI Signal Process. 1(4): 307-320 (1990) - [c6]Michael A. Palis, David S. L. Wei:
Parallel TAG Parsing on the Connection Machine. TAG+ 1990: 12-13
1980 – 1989
- 1989
- [j10]Jik H. Chang, Oscar H. Ibarra, Michael A. Palis:
Efficient Simulations of Simple Models of Parallel Computation by Time-Bounded ATMs and Space-Bounded TMs. Theor. Comput. Sci. 68(1): 19-36 (1989) - [c5]Michael A. Palis, Sunil M. Shende:
Sublinear Parallel Time Recognition of Tree Adjoining Languages. ICPP (3) 1989: 202-205 - [c4]Oscar H. Ibarra, Michael A. Palis:
An Efficient All-Parses Systolic Algorithm for General Context-Free Parsing. WADS 1989: 403-419 - 1988
- [j9]Oscar H. Ibarra, Michael A. Palis:
Two-Dimensional Iterative Arrays: Characterizations and Applications. Theor. Comput. Sci. 57: 47-86 (1988) - [c3]Jik H. Chang, Oscar H. Ibarra, Michael A. Palis:
Efficient Simulations of Simple Models of Parallel Computation by Time-Bounded ATM's and Space-Bounded TM's. ICALP 1988: 119-132 - 1987
- [j8]Oscar H. Ibarra, Michael A. Palis:
On Efficient Simulations of Systolic Arrays of Random-Access Machines. SIAM J. Comput. 16(2): 367-377 (1987) - [j7]Jik H. Chang, Oscar H. Ibarra, Michael A. Palis:
Parallel Parsing on a One-Way Array of Finite-State Machines. IEEE Trans. Computers 36(1): 64-75 (1987) - [j6]Oscar H. Ibarra, Michael A. Palis:
VLSI algorithms for solving recurrence equations and applications. IEEE Trans. Acoust. Speech Signal Process. 35(7): 1046-1064 (1987) - 1986
- [j5]Oscar H. Ibarra, Sam M. Kim, Michael A. Palis:
Designing Systolic Algorithms Using Sequential Machines. IEEE Trans. Computers 35(6): 531-542 (1986) - [j4]Jik H. Chang, Oscar H. Ibarra, Michael A. Palis, Bala Ravikumar:
On Pebble Automata. Theor. Comput. Sci. 44: 111-121 (1986) - [c2]Jik H. Chang, Oscar H. Ibarra, Michael A. Palis:
Parallel Parsing on a One-Way Array of Finite-State Machines. ICPP 1986: 887-894 - 1985
- [j3]Oscar H. Ibarra, Michael A. Palis, Sam M. Kim:
Some results concerning linear iterative (systolic) arrays. J. Parallel Distributed Comput. 2(2): 182-218 (1985) - [j2]Oscar H. Ibarra, Michael A. Palis, Jik H. Chang:
On Efficient Recognition of Transductions and Relations. Theor. Comput. Sci. 39: 89-106 (1985) - [j1]Oscar H. Ibarra, Michael A. Palis, Sam M. Kim:
Fast Parallel Language Recognition by Cellular Automata. Theor. Comput. Sci. 41: 231-246 (1985) - 1984
- [c1]Oscar H. Ibarra, Michael A. Palis, Sam M. Kim:
Designing Systolic Algorithms Using Sequential Machines. FOCS 1984: 46-55
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-25 05:47 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: