Остановите войну!
for scientists:
default search action
Chip Martel
- > Home > Persons > Chip Martel
Publications
- 2008
- [c31]Van Nguyen, Chip Martel:
Augmented Graph Models for Small-World Analysis with Geographic Factors. ANALCO 2008: 213-227 - 2007
- [j36]Eric K. Lee, Charles U. Martel:
When to use splay trees. Softw. Pract. Exp. 37(15): 1559-1575 (2007) - 2006
- [c24]Van Nguyen, Charles U. Martel:
Designing Low Cost Networks with Short Routes and Low Congestion. INFOCOM 2006 - 2005
- [c23]Van Nguyen, Charles U. Martel:
Analyzing and characterizing small-world graphs. SODA 2005: 311-320 - 2004
- [c21]Charles U. Martel, Van Nguyen:
Analyzing Kleinberg's (and other) small-world Models. PODC 2004: 179-188 - 1996
- [j25]Lucas Chi Kwong Hui, Charles U. Martel:
Randomized Competitive Algorithms for Successful and Unsuccessful Search. Comput. J. 39(5): 427-439 (1996) - [j24]Lucas Chi Kwong Hui, Charles U. Martel:
Analyzing Self-Adjusting Linear List Algorithms with Deletions and Unsuccessful Searches. Inf. Process. Lett. 58(5): 231-236 (1996) - 1994
- [j20]Charles U. Martel, Arvind Raghunathan:
Asynchronous PRAMs with Memory Latency. J. Parallel Distributed Comput. 23(1): 10-26 (1994) - [c10]Lucas Chi Kwong Hui, Charles U. Martel:
Analysing Deletions in Competitive Self-Adjusting Linear List. ISAAC 1994: 433-441 - 1993
- [j19]Lucas Chi Kwong Hui, Charles U. Martel:
Unsuccessful Search in Self-Adjusting Data Structures. J. Algorithms 15(3): 447-481 (1993) - [c9]Lucas Chi Kwong Hui, Charles U. Martel:
Randomized Competitive Algorithms for Successful and Unsuccessful Search on Self-adjusting Linear Lists. ISAAC 1993: 426-435 - 1992
- [c7]Lucas Chi Kwong Hui, Charles U. Martel:
On Efficient Unsuccessful Search. SODA 1992: 217-227 - 1989
- [j12]Eugene L. Lawler, Charles U. Martel:
Preemptive Scheduling of Two Uniform Machines to Minimize the Number of Late Jobs. Oper. Res. 37(2): 314-318 (1989) - 1988
- [c1]Charles U. Martel, Thomas P. Vayda:
The Complexity of Selection Resolution, Conflict Resolution and Maximum Finding on Multiple Access Channels. AWOC 1988: 401-410 - 1986
- [j7]Eugene L. Lawler, Charles U. Martel:
Polymatroidal flows with lower bounds. Discret. Appl. Math. 15(2-3): 291-313 (1986) - 1982
- [j2]Eugene L. Lawler, Charles U. Martel:
Computing Maximal "Polymatroidal" Network Flows. Math. Oper. Res. 7(3): 334-347 (1982) - 1981
- [j1]Eugene L. Lawler, Charles U. Martel:
Scheduling Periodically Occurring Tasks on Multiple Processors. Inf. Process. Lett. 12(1): 9-12 (1981)
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-21 18:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint