default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTimothy W. O'Neil
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
[j9]Timothy W. O'Neil, Samer F. Khasawneh, Michael E. Richter, Rama Krishna Pullaguntla:
Transforming Synchronous Data-Flow Graphs to Reduce Execution Time. Int. J. Comput. Their Appl. 18(2): 111-122 (2011)
2000 – 2009
- 2009
- [c12]Krishna Chaithanya Chakilam, Sukumar Reddy Anapalli, Timothy W. O'Neil:
Minimizing Inter-Iteration Dependencies in Multi-Dimensional Loops. PDCCS 2009: 25-30 - [c11]Rama Krishna Pullaguntla, Samer F. Khasawneh, Timothy W. O'Neil:
Rotation Scheduling on Synchronous Data Flow Graphs. PDPTA 2009: 263-269 - [c10]Sukumar Reddy Anapalli, Krishna Chaithanya Chakilam, Timothy W. O'Neil:
Static Scheduling for Cyclo Static Data Flow Graphs. PDPTA 2009: 302-306 - 2008
- [c9]Michael Richter, David Poeschl, Timothy W. O'Neil:
New Heuristics for Rotation Scheduling. PDPTA 2008: 10-16 - 2007
- [c8]Samer F. Khasawneh, Michael E. Richter, Timothy W. O'Neil:
Static Scheduling for Synchronous Data Flow Graphs. CATA 2007: 38-43 - 2006
- [j8]Timothy W. O'Neil, Edwin Hsing-Mean Sha:
Time-constrained loop scheduling with minimal resources. J. Embed. Comput. 2(1): 103-117 (2006) - 2005
- [j7]Timothy W. O'Neil, Edwin Hsing-Mean Sha:
Combining Extended Retiming and Unfolding for Rate-Optimal Graph Transformation. J. VLSI Signal Process. 39(3): 273-293 (2005) - [c7]Timothy W. O'Neil, Edwin Hsing-Mean Sha:
Static Scheduling of Split-Node Data-Flow Graphs. IASTED PDCS 2005: 125-130 - 2003
- [j6]Edwin Hsing-Mean Sha, Timothy W. O'Neil, Nelson L. Passos:
Efficient Polynomial-Time Nested Loop Fusion with Full Parallelism. Int. J. Comput. Their Appl. 10(1): 9-24 (2003) - [c6]Timothy W. O'Neil:
Optimal Graph Transformation Assuming Alternate Scheduling Models. PDCS 2003: 55-60 - 2002
- [c5]Timothy W. O'Neil, Edwin Hsing-Mean Sha:
Minimizing resources in a repeating schedule for a split-node data-flow graph. ACM Great Lakes Symposium on VLSI 2002: 136-141 - [c4]Timothy W. O'Neil, Edwin Hsing-Mean Sha:
Unfolding a Split-node Data-flow Graph. IASTED PDCS 2002: 712-717 - 2001
- [j5]Timothy W. O'Neil, Edwin Hsing-Mean Sha:
Retiming synchronous data-flow graphs to reduce execution time. IEEE Trans. Signal Process. 49(10): 2397-2407 (2001) - [j4]Zhong Wang, Timothy W. O'Neil, Edwin Hsing-Mean Sha:
Optimal loop scheduling for hiding memory latency based on two-level partitioning and prefetching. IEEE Trans. Signal Process. 49(11): 2853-2864 (2001) - [j3]Zhong Wang, Timothy W. O'Neil, Edwin Hsing-Mean Sha:
Minimizing Average Schedule Length under Memory Constraints by Optimal Partitioning and Prefetching. J. VLSI Signal Process. 27(3): 215-233 (2001) - [c3]Timothy W. O'Neil, Edwin Hsing-Mean Sha:
On Retiming Synchronous Data-Flow Graphs. PDCS 2001: 103-108 - 2000
- [j2]Fei Chen, Timothy W. O'Neil, Edwin Hsing-Mean Sha:
Optimizing Overall Loop Schedules Using Prefetching and Partitioning. IEEE Trans. Parallel Distributed Syst. 11(6): 604-614 (2000) - [j1]Sissades Tongsima
, Timothy W. O'Neil, Chantana Chantrapornchai, Edwin Hsing-Mean Sha:
Properties and Algorithms for Unfolding of Probabilistic Data-Flow Graphs. J. VLSI Signal Process. 25(3): 215-233 (2000)
1990 – 1999
- 1999
- [c2]Sissades Tongsima, Timothy W. O'Neil, Edwin Hsing-Mean Sha:
Unfolding probabilistic data-flow graphs under different timing models. ICASSP 1999: 1889-1892 - [c1]Timothy W. O'Neil, Sissades Tongsima, Edwin Hsing-Mean Sha:
Extended retiming: optimal scheduling via a graph-theoretical approach. ICASSP 1999: 2001-2004
Coauthor Index
aka: Edwin Hsing-Mean Sha
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-05-15 21:31 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:
