default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChip Martel
Charles U. Martel
Person information
- affiliation: University of California, Davis, Computer Science Department, CA, USA
- affiliation (PhD 1980): University of California, Berkeley, CA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2020
[j55]Sifat Ferdousi
, Massimo Tornatore, Ferhat Dikbiyik, Charles U. Martel, Sugang Xu, Yusuke Hirota, Yoshinari Awaji, Biswanath Mukherjee:
Joint Progressive Network and Datacenter Recovery After Large-Scale Disasters. IEEE Trans. Netw. Serv. Manag. 17(3): 1501-1514 (2020)
2010 – 2019
- 2018
- [j54]Uttam Mandal, Pulak Chowdhury, Massimo Tornatore, Charles U. Martel, Biswanath Mukherjee:
Bandwidth Provisioning for Virtual Machine Migration in Cloud: Strategy and Application. IEEE Trans. Cloud Comput. 6(4): 967-976 (2018) - [j53]Yu Wu, Massimo Tornatore, Charles U. Martel, Biswanath Mukherjee:
Content Fragmentation: A Redundancy Scheme to Save Energy in Cloud Networks. IEEE Trans. Green Commun. Netw. 2(4): 1186-1196 (2018) - [j52]S. Sedef Savas, Massimo Tornatore, Ferhat Dikbiyik, Aysegül Yayimli, Charles U. Martel, Biswanath Mukherjee:
RASCAR: Recovery-Aware Switch-Controller Assignment and Routing in SDN. IEEE Trans. Netw. Serv. Manag. 15(4): 1222-1234 (2018) - [j51]Rafael B. R. Lourenço, Massimo Tornatore, Charles U. Martel, Biswanath Mukherjee:
Running the Network Harder: Connection Provisioning Under Resource Crunch. IEEE Trans. Netw. Serv. Manag. 15(4): 1615-1629 (2018) - 2017
- [i1]Rafael B. R. Lourenço, Massimo Tornatore, Charles U. Martel, Biswanath Mukherjee:
Running the Network Harder: Connection Provisioning with Degradation under Resource Crunch. CoRR abs/1710.00115 (2017) - 2016
- [j50]Ning-Hai Bao, Massimo Tornatore, Charles U. Martel, Biswanath Mukherjee:
Fairness-Aware Degradation Based Multipath Re-provisioning Strategy for Post-Disaster Telecom Mesh Networks. JOCN 8(6): 441-450 (2016) - [c41]Yu Wu, Massimo Tornatore, Charles U. Martel, Biswanath Mukherjee:
Green and Low-Risk Content Placement in optical content delivery networks. ICC 2016: 1-6 - 2015
- [j49]Ning-Hai Bao, M. Farhan Habib, Massimo Tornatore, Charles U. Martel, Biswanath Mukherjee:
Global Versus Essential Post-Disaster Re-Provisioning in Telecom Mesh Networks. JOCN 7(5): 392-400 (2015) - 2014
- [j48]Chaitanya S. K. Vadrevu, Rui Wang, Massimo Tornatore, Charles U. Martel, Biswanath Mukherjee:
Degraded Service Provisioning in Mixed-Line-Rate WDM Backbone Networks Using Multipath Routing. IEEE/ACM Trans. Netw. 22(3): 840-849 (2014) - 2013
- [j47]Shuqiang Zhang, Charles U. Martel, Biswanath Mukherjee:
Dynamic Traffic Grooming in Elastic Optical Networks. IEEE J. Sel. Areas Commun. 31(1): 4-12 (2013) - 2012
- [c40]Chaitanya S. K. Vadrevu, Avishek Nag, Charles U. Martel, Biswanath Mukherjee:
Dimensioning optical WDM backbone networks with mixed line rates. GLOBECOM 2012: 3002-3006 - 2011
- [j46]Ananya Das, Charles U. Martel, Biswanath Mukherjee, Smita Rai:
New Approach to Reliable Multipath Provisioning. JOCN 3(1): 95-103 (2011) - [j45]Ming Xia, Massimo Tornatore, Spencer Sevilla, Lei Shi, Charles U. Martel, Biswanath Mukherjee:
A Novel SLA Framework for Time-Differentiated Resilience in Optical Mesh Networks. JOCN 3(4): 312-322 (2011) - [j44]Sheng Huang, Charles U. Martel, Biswanath Mukherjee:
Survivable multipath provisioning with differential delay constraint in telecom mesh networks. IEEE/ACM Trans. Netw. 19(3): 657-669 (2011) - [j43]Ming Xia, Massimo Tornatore, Charles U. Martel, Biswanath Mukherjee:
Risk-aware provisioning for optical WDM mesh networks. IEEE/ACM Trans. Netw. 19(3): 921-931 (2011) - [c39]Spencer Sevilla, Ming Xia, Charles U. Martel, Biswanath Mukherjee:
Time-Differentiated Resilience in Telecom Mesh Networks. ICC 2011: 1-5 - 2010
- [j42]Dragos Andrei, Massimo Tornatore, Charles U. Martel, Dipak Ghosal, Biswanath Mukherjee:
Provisioning Subwavelength Multicast Sessions With Flexible Scheduling Over WDM Networks. JOCN 2(5): 241-255 (2010) - [j41]Sheng Huang, Chip Martel, Biswanath Mukherjee:
Adaptive Reliable Multipath Provisioning in Survivable WDM Mesh Networks. JOCN 2(6): 368-380 (2010) - [j40]Sheng Huang, Ming Xia, Chip Martel, Biswanath Mukherjee:
Survivable Multipath Traffic Grooming in Telecom Mesh Networks With Inverse Multiplexing. JOCN 2(8): 545-557 (2010) - [j39]Dragos Andrei, Massimo Tornatore, Marwan Batayneh, Charles U. Martel, Biswanath Mukherjee:
Provisioning of deadline-driven requests with flexible transmission rates in WDM mesh networks. IEEE/ACM Trans. Netw. 18(2): 353-366 (2010) - [c38]Ming Xia, Charles U. Martel, Lei Shi, Massimo Tornatore, Biswanath Mukherjee:
A Novel SLA for Time-Differentiated Resilience with Efficient Resource Sharing in WDM Networks. ICC 2010: 1-5 - [c37]Ming Xia, Massimo Tornatore, Yi Zhang, Pulak Chowdhury, Charles U. Martel, Biswanath Mukherjee:
Greening the Optical Backbone Network: A Traffic Engineering Approach. ICC 2010: 1-5 - [c36]Ming Xia, Massimo Tornatore, Charles U. Martel, Biswanath Mukherjee:
Risk-Aware Routing for Optical Transport Networks. INFOCOM 2010: 588-595
2000 – 2009
- 2009
- [j38]Ananya Das, Charles U. Martel:
Stochastic shortest path with unlimited hops. Inf. Process. Lett. 109(5): 290-295 (2009) - [j37]Dragos Andrei, Hong-Hsu Yen, Massimo Tornatore, Charles U. Martel, Biswanath Mukherjee:
Integrated Provisioning of Sliding Scheduled Services Over WDM Optical Networks [Invited]. JOCN 1(2): A94-A105 (2009) - [c35]Ankush Garg, Prantik Bhattacharyya, Charles U. Martel, Shyhtsun Felix Wu:
Information Flow and Search in Unstructured Keyword Based Social Networks. CSE (4) 2009: 1074-1081 - [c34]Dragos Andrei, Massimo Tornatore, Charles U. Martel, Biswanath Mukherjee:
Flexible Scheduling of Multicast Sessions with Different Granularities for Large Data Distribution over WDM Networks. GLOBECOM 2009: 1-6 - [c33]Ananya Das, Charles U. Martel, Biswanath Mukherjee:
A Partial-Protection Approach Using Multipath Provisioning. ICC 2009: 1-5 - [c32]Ming Xia, Charles U. Martel, Massimo Tornatore, Biswanath Mukherjee:
Service Cluster: A New Framework for SLA-Oriented Provisioning in WDM Mesh Networks. ICC 2009: 1-5 - 2008
- [c31]Van Nguyen, Chip Martel:
Augmented Graph Models for Small-World Analysis with Geographic Factors. ANALCO 2008: 213-227 - [c30]Ming Xia, Marwan Batayneh, Lei Song, Charles U. Martel, Biswanath Mukherjee:
SLA-Aware Provisioning for Revenue Maximization in Telecom Mesh Networks. GLOBECOM 2008: 1353-1357 - [c29]Dragos Andrei, Massimo Tornatore, Dipak Ghosal, Charles U. Martel, Biswanath Mukherjee:
On-Demand Provisioning of Data-Aggregation Requests over WDM Mesh Networks. GLOBECOM 2008: 2653-2657 - [c28]Dragos Andrei, Marwan Batayneh, Suman Sarkar, Charles U. Martel, Biswanath Mukherjee:
Deadline-Driven Bandwidth Allocation with Flexible Transmission Rates in WDM Networks. ICC 2008: 5354-5358 - [c27]Sheng Huang, Biswanath Mukherjee, Charles U. Martel:
Survivable Multipath Provisioning with Differential Delay Constraint in Telecom Mesh Networks. INFOCOM 2008: 191-195 - 2007
- [j36]Eric K. Lee, Charles U. Martel:
When to use splay trees. Softw. Pract. Exp. 37(15): 1559-1575 (2007) - [j35]Smita Rai, Omkar Deshpande, Canhui Ou, Charles U. Martel, Biswanath Mukherjee:
Reliable multipath provisioning for high-capacity backbone mesh networks. IEEE/ACM Trans. Netw. 15(4): 803-812 (2007) - [c26]Ananya Das, Charles U. Martel, Biswanath Mukherjee, Smita Rai:
A Better Approach to Reliable Multi-Path Provisioning. GLOBECOM 2007: 2724-2728 - [c25]Yanyan Yang, Charles U. Martel, Shyhtsun Felix Wu:
CLID: A general approach to validate security policies in a dynamic network. Integrated Network Management 2007: 1-10 - 2006
- [j34]Yanyan Yang, Charles U. Martel, Zhi (Judy) Fu, Shyhtsun Felix Wu:
IPsec/VPN security policy correctness and assurance. J. High Speed Networks 15(3): 275-289 (2006) - [j33]Canhui Ou, Laxman H. Sahasrabuddhe, Keyao Zhu, Charles U. Martel, Biswanath Mukherjee:
Survivable virtual concatenation for data over SONET/SDH in optical transport networks. IEEE/ACM Trans. Netw. 14(1): 218-231 (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
- [j32]Charles U. Martel, Glen Nuckolls, Premkumar T. Devanbu, Michael Gertz, April Kwong, Stuart G. Stubblebine:
A General Model for Authenticated Data Structures. Algorithmica 39(1): 21-41 (2004) - [j31]Michael Gertz, April Kwong, Charles U. Martel, Glen Nuckolls:
Databases that tell the Truth: Authentic Data Publication. IEEE Data Eng. Bull. 27(1): 26-33 (2004) - [c22]Yanyan Yang, Charles U. Martel, Shyhtsun Felix Wu:
On building the minimum number of tunnels: an ordered-split approach to manage IPSec/VPN policies. NOMS (1) 2004: 277-290 - [c21]Charles U. Martel, Van Nguyen:
Analyzing Kleinberg's (and other) small-world Models. PODC 2004: 179-188 - 2003
- [j30]Premkumar T. Devanbu, Michael Gertz, Charles U. Martel, Stuart G. Stubblebine:
Authentic Data Publication Over the Internet. J. Comput. Secur. 11(3): 291-314 (2003) - [c20]Glen Nuckolls, Charles U. Martel, Stuart G. Stubblebine:
Certifying Data from Multiple Sources. DBSec 2003: 47-60 - [c19]Glen Nuckolls, Charles U. Martel, Stuart G. Stubblebine:
Certifying data from multiple sources (extended abstract). EC 2003: 210-211 - 2002
- [j29]Dan Gusfield, Charles U. Martel:
The Structure and Complexity of Sports Elimination Numbers. Algorithmica 32(1): 73-86 (2002) - [j28]Charles U. Martel:
The expected complexity of Prim's minimum spanning tree algorithm. Inf. Process. Lett. 81(4): 197-201 (2002) - 2001
- [c18]Premkumar T. Devanbu, Michael Gertz, April Kwong, Charles U. Martel, Glen Nuckolls, Stuart G. Stubblebine:
Flexible authentication of XML documents. CCS 2001: 136-145 - 2000
- [c17]Premkumar T. Devanbu, Michael Gertz, Charles U. Martel, Stuart G. Stubblebine:
Authentic Third-party Data Publication. DBSec 2000: 101-112
1990 – 1999
- 1999
- [c16]Dan Gusfield, Charles U. Martel:
Tresholds for Sports Elimination Numbers Algorithms and Complexity. WADS 1999: 330-341 - 1998
- [j27]Paul F. Stelling, Charles U. Martel, Vojin G. Oklobdzija, R. Ravi:
Optimal Circuits for Parallel Multipliers. IEEE Trans. Computers 47(3): 273-285 (1998) - [c15]John R. Black, Charles U. Martel, Hongbin Qi:
Graph and Hashing Algorithms for Modern Architectures: Design and Performance. WAE 1998: 37-48 - 1997
- [j26]Dalit Naor, Dan Gusfield, Charles U. Martel:
A Fast Algorithm for Optimally Increasing the Edge Connectivity. SIAM J. Comput. 26(4): 1139-1165 (1997) - 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) - [j23]Charles U. Martel, W. Melody Moh, Teng-Sheng Moh:
Dynamic Prioritized Conflict Resolution on Multiple Access Broadcast Networks. IEEE Trans. Computers 45(9): 1074-1079 (1996) - [c14]John Matthews, Charles U. Martel:
Parallel Algorithms Using Unreliable Broadcasts. IPPS 1996: 692-696 - 1995
- [c13]Charles U. Martel, Vojin G. Oklobdzija, R. Ravi, Paul F. Stelling:
Design Strategies for Optimal Multiplier Circuits. IEEE Symposium on Computer Arithmetic 1995: 42-49 - [c12]W. Melody Moh, Charles U. Martel, Teng-Sheng Moh:
Using Multiple Access Broadcast Network Algorithms for CRCW PRAM Simulations. Parallel and Distributed Computing and Systems 1995: 411-415 - [c11]Srinivasan Tridandapani, Anton T. Dahbura, Arun K. Somani, Charles U. Martel, John Matthews:
Free Performance and Fault Tolerance: Using System Idle Capacity Efficiently (Panel). SIGMETRICS 1995: 60-61 - 1994
- [j22]Charles U. Martel:
Maximum Finding on a Multiple Access Broadcast Network. Inf. Process. Lett. 52(1): 7-15 (1994) - [j21]Charles U. Martel, Ramesh Subramonian:
On the Complexity of Certified Write-All Algorithms. J. Algorithms 16(3): 361-387 (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
- [j18]Dan Gusfield, Charles U. Martel:
A Fast Algorithm for the Generalized Parametric Minimum Cut Problem and Applications. Algorithmica 7(5&6): 499-519 (1992) - [j17]Charles U. Martel, Arvin Park, Ramesh Subramonian:
Work-Optimal Asynchronous Algorithms for Shared Memory Parallel Computers. SIAM J. Comput. 21(6): 1070-1099 (1992) - [c8]Charles U. Martel, Ramesh Subramonian:
On the Complexity of Certified Write All Algorithms. FSTTCS 1992: 368-379 - [c7]Lucas Chi Kwong Hui, Charles U. Martel:
On Efficient Unsuccessful Search. SODA 1992: 217-227 - 1991
- [j16]Dalit Naor, Charles U. Martel, Norman S. Matloff:
Performance of Priority Queue Structures in a Virtual Memory Environment. Comput. J. 34(5): 428-437 (1991) - [j15]Charles U. Martel:
Self-Adjusting Multi-Way Search Trees. Inf. Process. Lett. 38(3): 135-141 (1991) - [j14]Charles U. Martel, W. Melody Moh:
Optimal Prioritized Conflict Resolution on a Multiple Access Channel. IEEE Trans. Computers 40(10): 1102-1108 (1991) - [c6]Jeffrey C. Becker, Charles U. Martel, Arvin Park:
General Asynchrony Is Not Expensive for PRAMs. IPPS 1991: 70-75 - [c5]Kevin Jeffay, Donald F. Stanat, Charles U. Martel:
On non-preemptive scheduling of period and sporadic tasks. RTSS 1991: 129-139 - 1990
- [c4]Charles U. Martel, Ramesh Subramonian, Arvin Park:
Asynchronous PRAMs Are (Almost) as Good as Synchronous PRAMs. FOCS 1990: 590-599 - [c3]Dalit Naor, Dan Gusfield, Charles U. Martel:
A Fast Algorithm for Optimally Increasing the Edge-Connectivity. FOCS 1990: 698-707 - [c2]Charles U. Martel, Ramesh Subramonian:
Asynchronous PRAM Algorithms for List Ranking and Transitive Closure. ICPP (3) 1990: 60-63
1980 – 1989
- 1989
- [j13]David Fernández-Baca, Charles U. Martel:
On the Efficiency of Maximum-Flow Algorithms on Networks with Small Integer Capacities. Algorithmica 4(2): 173-189 (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) - [j11]Charles U. Martel, Dan Gusfield:
A Fast Parallel Quicksort Algorithm. Inf. Process. Lett. 30(2): 97-102 (1989) - [j10]Charles U. Martel:
A comparison of phase and nonphase network flow algorithms. Networks 19(6): 691-705 (1989) - 1988
- [j9]Charles U. Martel:
A Parallel Algorithm for Preemptive Scheduling of Uniform Machines. J. Parallel Distributed Comput. 5(6): 700-715 (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 - 1987
- [j8]Dan Gusfield, Charles U. Martel, David Fernández-Baca:
Fast Algorithms for Bipartite Network Flow. SIAM J. Comput. 16(2): 237-251 (1987) - 1986
- [j7]Eugene L. Lawler, Charles U. Martel:
Polymatroidal flows with lower bounds. Discret. Appl. Math. 15(2-3): 291-313 (1986) - [j6]Charles U. Martel:
Lower Bounds on Parallel Algorithms for Finding the First Maximal Independent Set. Inf. Process. Lett. 22(2): 81-85 (1986) - 1985
- [j5]Hiroaki Ishii, Charles U. Martel, Teruo Masuda, Toshio Nishida:
A Generalized Uniform Processor System. Oper. Res. 33(2): 346-362 (1985) - [j4]Charles U. Martel:
Preemptive Scheduling to Minimize Maximum Completion Time on Uniform Processors with Memory Constraints. Oper. Res. 33(6): 1360-1380 (1985) - 1982
- [j3]Charles U. Martel:
Preemptive Scheduling with Release Times, Deadlines, and Due Times. J. ACM 29(3): 812-829 (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)
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-10-08 21:33 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:
