Charles U. Martel
Affiliations: University of California, Davis, Computer Science Department
According to our database^{1},
Charles U. Martel
authored at least 86 papers
between 1981 and 2020.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Online presence:

on orcid.org
On csauthors.net:
Bibliography
2020
IEEE Trans. Netw. Serv. Manag., 2020
2018
IEEE Trans. Netw. Serv. Manag., 2018
IEEE Trans. Netw. Serv. Manag., 2018
IEEE Trans. Green Commun. Netw., 2018
Bandwidth Provisioning for Virtual Machine Migration in Cloud: Strategy and Application.
IEEE Trans. Cloud Comput., 2018
2017
Running the Network Harder: Connection Provisioning with Degradation under Resource Crunch.
CoRR, 2017
2016
Proceedings of the 2016 IEEE International Conference on Communications, 2016
2014
Degraded Service Provisioning in MixedLineRate WDM Backbone Networks Using Multipath Routing.
IEEE/ACM Trans. Netw., 2014
2013
IEEE J. Sel. Areas Commun., 2013
2012
Proceedings of the 2012 IEEE Global Communications Conference, 2012
2011
IEEE/ACM Trans. Netw., 2011
Survivable multipath provisioning with differential delay constraint in telecom mesh networks.
IEEE/ACM Trans. Netw., 2011
Proceedings of IEEE International Conference on Communications, 2011
2010
Provisioning of deadlinedriven requests with flexible transmission rates in WDM mesh networks.
IEEE/ACM Trans. Netw., 2010
Proceedings of the INFOCOM 2010. 29th IEEE International Conference on Computer Communications, 2010
Proceedings of IEEE International Conference on Communications, 2010
A Novel SLA for TimeDifferentiated Resilience with Efficient Resource Sharing in WDM Networks.
Proceedings of IEEE International Conference on Communications, 2010
2009
Inf. Process. Lett., 2009
Service Cluster: A New Framework for SLAOriented Provisioning in WDM Mesh Networks.
Proceedings of IEEE International Conference on Communications, 2009
Proceedings of IEEE International Conference on Communications, 2009
Flexible Scheduling of Multicast Sessions with Different Granularities for Large Data Distribution over WDM Networks.
Proceedings of the Global Communications Conference, 2009. GLOBECOM 2009, Honolulu, Hawaii, USA, 30 November, 2009
Proceedings of the 12th IEEE International Conference on Computational Science and Engineering, 2009
2008
DeadlineDriven Bandwidth Allocation with Flexible Transmission Rates in WDM Networks.
Proceedings of IEEE International Conference on Communications, 2008
Proceedings of the Global Communications Conference, 2008. GLOBECOM 2008, New Orleans, LA, USA, 30 November, 2008
Proceedings of the Global Communications Conference, 2008. GLOBECOM 2008, New Orleans, LA, USA, 30 November, 2008
Proceedings of the Fifth Workshop on Analytic Algorithmics and Combinatorics, 2008
2007
IEEE/ACM Trans. Netw., 2007
Softw. Pract. Exp., 2007
Proceedings of the Integrated Network Management, 2007
Proceedings of the Global Communications Conference, 2007
2006
Survivable virtual concatenation for data over SONET/SDH in optical transport networks.
IEEE/ACM Trans. Netw., 2006
J. High Speed Networks, 2006
Proceedings of the INFOCOM 2006. 25th IEEE International Conference on Computer Communications, 2006
2005
Proceedings of the Sixteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2005
2004
IEEE Data Eng. Bull., 2004
Algorithmica, 2004
Proceedings of the TwentyThird Annual ACM Symposium on Principles of Distributed Computing, 2004
On building the minimum number of tunnels: an orderedsplit approach to manage IPSec/VPN policies.
Proceedings of the Managing Next Generation Convergence Networks and Services, 2004
2003
J. Comput. Secur., 2003
Proceedings of the Proceedings 4th ACM Conference on Electronic Commerce (EC2003), 2003
Proceedings of the Data and Applications Security XVII: Status and Prospects, 2003
2002
Inf. Process. Lett., 2002
Algorithmica, 2002
2001
Proceedings of the CCS 2001, 2001
2000
Proceedings of the Data and Application Security, 2000
1999
Proceedings of the Algorithms and Data Structures, 6th International Workshop, 1999
1998
IEEE Trans. Computers, 1998
Graph and Hashing Algorithms for Modern Architectures: Design and Performance.
Proceedings of the Algorithm Engineering, 2nd International Workshop, 1998
1997
SIAM J. Comput., 1997
1996
IEEE Trans. Computers, 1996
Analyzing SelfAdjusting Linear List Algorithms with Deletions and Unsuccessful Searches.
Inf. Process. Lett., 1996
Comput. J., 1996
Proceedings of IPPS '96, 1996
1995
Free Performance and Fault Tolerance: Using System Idle Capacity Efficiently (Panel).
Proceedings of the 1995 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems, 1995
Using Multiple Access Broadcast Network Algorithms for CRCW PRAM Simulations.
Proceedings of the Seventh IASTED/ISMM International Conference on Parallel and Distributed Computing and Systems, 1995
Proceedings of the 12th Symposium on Computer Arithmetic (ARITH12 '95), 1995
1994
J. Parallel Distributed Comput., 1994
J. Algorithms, 1994
Inf. Process. Lett., 1994
Proceedings of the Algorithms and Computation, 5th International Symposium, 1994
1993
J. Algorithms, 1993
Randomized Competitive Algorithms for Successful and Unsuccessful Search on Selfadjusting Linear Lists.
Proceedings of the Algorithms and Computation, 4th International Symposium, 1993
1992
SIAM J. Comput., 1992
A Fast Algorithm for the Generalized Parametric Minimum Cut Problem and Applications.
Algorithmica, 1992
Proceedings of the Third Annual ACM/SIGACTSIAM Symposium on Discrete Algorithms, 1992
1991
IEEE Trans. Computers, 1991
Inf. Process. Lett., 1991
Comput. J., 1991
Proceedings of the RealTime Systems Symposium, 1991
Proceedings of the Fifth International Parallel Processing Symposium, Proceedings, Anaheim, California, USA, April 30, 1991
1990
Asynchronous PRAM Algorithms for List Ranking and Transitive Closure.
Proceedings of the 1990 International Conference on Parallel Processing, 1990
Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990
1989
Networks, 1989
Inf. Process. Lett., 1989
Preemptive Scheduling of Two Uniform Machines to Minimize the Number of Late Jobs.
Oper. Res., 1989
On the Efficiency of MaximumFlow Algorithms on Networks with Small Integer Capacities.
Algorithmica, 1989
1988
J. Parallel Distributed Comput., 1988
The Complexity of Selection Resolution, Conflict Resolution and Maximum Finding on Multiple Access Channels.
Proceedings of the VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, 1988
1987
SIAM J. Comput., 1987
1986
Lower Bounds on Parallel Algorithms for Finding the First Maximal Independent Set.
Inf. Process. Lett., 1986
Discret. Appl. Math., 1986
1985
Preemptive Scheduling to Minimize Maximum Completion Time on Uniform Processors with Memory Constraints.
Oper. Res., 1985
Oper. Res., 1985
1982
Math. Oper. Res., 1982
J. ACM, 1982
1981
Inf. Process. Lett., 1981