default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnne Rogers
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[p1]Corinna Cortes, Kathleen Fisher, Daryl Pregibon, Anne Rogers, Frederick Smith:
Hancock: A Language for Analyzing Transactional Data Streams. Data Stream Management 2016: 387-408- 2010
- [j13]Matei Ripeanu, Adriana Iamnitchi
, Ian T. Foster, Anne Rogers:
In search of simplicity: a self-organizing group communication overlay. Concurr. Comput. Pract. Exp. 22(7): 788-815 (2010)
2000 – 2009
- 2008
- [j12]Adam L. Buchsbaum, Loukas Georgiadis, Haim Kaplan, Anne Rogers, Robert Endre Tarjan, Jeffery R. Westbrook:
Linear-Time Algorithms for Dominators and Other Path-Evaluation Problems. SIAM J. Comput. 38(4): 1533-1573 (2008) - 2007
- [c25]Robert Bruce Findler, Shu-yu Guo, Anne Rogers:
Lazy Contract Checking for Immutable Data Structures. IFL 2007: 111-128 - [c24]Matei Ripeanu, Adriana Iamnitchi, Ian T. Foster, Anne Rogers:
In Search of Simplicity: A Self-Organizing Group Communication Overlay. SASO 2007: 371-374 - [i3]Matei Ripeanu, Adriana Iamnitchi, Ian T. Foster, Anne Rogers:
In Search of Simplicity: A Self-Organizing Multi-Source Multicast Overlay. CoRR abs/cs/0702157 (2007) - 2005
- [j11]Adam L. Buchsbaum, Haim Kaplan, Anne Rogers, Jeffery R. Westbrook:
Corrigendum: a new, simpler linear-time dominators algorithm. ACM Trans. Program. Lang. Syst. 27(3): 383-387 (2005) - [i2]Matei Ripeanu, Ian T. Foster, Adriana Iamnitchi, Anne Rogers:
A dynamically adaptive, unstructured multicast overlay. Service Management and Self-Organization in IP-based Networks 2005 - 2004
- [j10]Corinna Cortes, Kathleen Fisher, Daryl Pregibon, Anne Rogers, Frederick Smith:
Hancock: A language for analyzing transactional data streams. ACM Trans. Program. Lang. Syst. 26(2): 301-338 (2004) - 2002
- [c23]Michael L. McGlashen, Anne Rogers:
Classification in the Physical Sciences. ASIS SIG/CR Classification Research Workshop 2002 - [i1]Adam L. Buchsbaum, Haim Kaplan, Anne Rogers, Jeffery R. Westbrook:
Linear-Time Pointer-Machine Algorithms for Least Common Ancestors, MST Verification, and Dominators. CoRR cs.DS/0207061 (2002) - 2001
- [j9]Adam L. Buchsbaum, Yih-Farn Chen, Huale Huang, Eleftherios Koutsofios, John M. Mocenigo, Anne Rogers, Michael Jankowsky, Spiros Mancoridis:
Visualizing and Analyzing Software Infrastructures. IEEE Softw. 18(5): 62-70 (2001) - [c22]Martin C. Carlisle, Anne Rogers:
Supporting Dynamic Data Structures with Olden. Compiler Optimizations for Scalable Parallel Systems Languages 2001: 709-750 - [c21]Kathleen Fisher, Colin R. Goodall, Karin Högstedt, Anne Rogers:
An Application-Specific Database. DBPL 2001: 213-227 - 2000
- [c20]Corinna Cortes, Kathleen Fisher, Daryl Pregibon, Anne Rogers:
Hancock: a language for extracting signatures from data streams. KDD 2000: 9-17
1990 – 1999
- 1999
- [j8]Steven J. Phillips, Anne Rogers:
Parallel Speech Recognition. Int. J. Parallel Program. 27(4): 257-288 (1999) - [j7]Mukund Raghavachari, Anne Rogers:
Ace: a language for parallel programming with customizable protocols. ACM Trans. Comput. Syst. 17(3): 202-248 (1999) - [c19]Dan Bonachea, Kathleen Fisher, Anne Rogers, Frederick Smith:
Hancock: a language for processing very large-scale data. DSL 1999: 163-176 - 1998
- [j6]Adam L. Buchsbaum, Haim Kaplan, Anne Rogers, Jeffery R. Westbrook:
A New, Simpler Linear-Time Dominators Algorithm. ACM Trans. Program. Lang. Syst. 20(6): 1265-1296 (1998) - [c18]Adam L. Buchsbaum, Haim Kaplan, Anne Rogers, Jeffery R. Westbrook:
Linear-Time Pointer-Machine Algorithms for Least Common Ancestors, MST Verification, and Dominators. STOC 1998: 279-288 - 1997
- [c17]Steven J. Phillips, Anne Rogers:
Parallel speech recognition. EUROSPEECH 1997: 135-138 - [c16]Mukund Raghavachari, Anne Rogers:
Ace: Linguistic Mechanisms for Customizable Protocols. PPoPP 1997: 80-89 - 1996
- [j5]Martin C. Carlisle, Anne Rogers:
Software Caching and Computation Migration in Olden. J. Parallel Distributed Comput. 38(2): 248-255 (1996) - [j4]Marios D. Dikaiakos, Anne Rogers, Kenneth Steiglitz:
Functional Algorithm Simulation of the Fast Multipole Method: Architectural Implications. Parallel Process. Lett. 6(1): 55-66 (1996) - 1995
- [j3]Marios D. Dikaiakos, Anne Rogers, Kenneth Steiglitz:
A Comparison Study of Heuristics for Mapping Parallel Algorithms to Message-passing Multiprocessors. Parallel Algorithms Appl. 7(3-4): 283-302 (1995) - [j2]Anne Rogers, Martin C. Carlisle, John H. Reppy, Laurie J. Hendren:
Supporting Dynamic Data Structures on Distributed-Memory Machines. ACM Trans. Program. Lang. Syst. 17(2): 233-263 (1995) - [c15]Pritpal S. Ahuja, Douglas W. Clark, Anne Rogers:
The performance impact of incomplete bypassing in processor pipelines. MICRO 1995: 36-45 - [c14]Martin C. Carlisle, Anne Rogers:
Software Caching and Computation Migration in Olden. PPoPP 1995: 29-38 - [c13]Shubhendu S. Mukherjee, Shamik D. Sharma, Mark D. Hill, James R. Larus, Anne Rogers, Joel H. Saltz:
Efficient Support for Irregular Applications on Distributed-Memory Machines. PPoPP 1995: 68-79 - [c12]Mukund Raghavachari, Anne Rogers:
Understanding Language Support for Irregular Parallelism. PSLS 1995: 174-189 - 1994
- [j1]Anne Rogers, Keshav Pingali:
Compiling for Distributed Memory Architectures. IEEE Trans. Parallel Distributed Syst. 5(3): 281-298 (1994) - [c11]Satish Chandra, James R. Larus, Anne Rogers:
Where is Time Spent in Message-Passing and Shared-Memory Programs? ASPLOS 1994: 61-73 - [c10]Marios D. Dikaiakos, Anne Rogers, Kenneth Steiglitz:
FAST: A Functional Algoritm Simulation Testbed. MASCOTS 1994: 142-146 - [c9]Babak Falsafi, Alvin R. Lebeck, Steven K. Reinhardt, Ioannis Schoinas, Mark D. Hill, James R. Larus, Anne Rogers, David A. Wood:
Application-specific protocols for user-level shared memory. SC 1994: 380-389 - [c8]Marios D. Dikaiakos, Kenneth Steiglitz, Anne Rogers:
A comparison of techniques used for mapping parallel algorithms to message-passing multiprocessors. SPDP 1994: 434-442 - 1993
- [c7]Martin C. Carlisle, Anne Rogers, John H. Reppy, Laurie J. Hendren:
Early Experiences with Olden. LCPC 1993: 1-20 - 1992
- [c6]Anne Rogers, Kai Li:
Software Support for Speculative Loads. ASPLOS 1992: 38-50 - [c5]Marios D. Dikaiakos, Anne Rogers, Kenneth Steiglitz:
Message Ordering in Multiprocessors with Synchronous Communication. ICPP (3) 1992: 196-203 - [c4]Anne Rogers, John H. Reppy, Laurie J. Hendren:
Supporting SPMD Execution for Dynamic Data Structures. LCPC 1992: 192-207 - 1990
- [b1]Anne Rogers:
Process Decomposition through Locality of Reference. Cornell University, USA, 1990 - [c3]Keshav Pingali, Anne Rogers:
Compiling for Locality. ICPP (2) 1990: 142-146
1980 – 1989
- 1989
- [c2]Anne Rogers, Keshav Pingali:
Process Decomposition Through Locality of Reference. PLDI 1989: 69-80 - 1985
- [c1]Alan J. Demers, Anne Rogers, Frank Kenneth Zadeck:
Attribute propagation by message passing. SLIPE 1985: 43-59
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:54 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:
