Charles U. Martel

According to our database1, Charles U. Martel authored at least 86 papers between 1981 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
Joint Progressive Network and Datacenter Recovery After Large-Scale Disasters.
IEEE Trans. Netw. Serv. Manag., 2020

2018
RASCAR: Recovery-Aware Switch-Controller Assignment and Routing in SDN.
IEEE Trans. Netw. Serv. Manag., 2018

Running the Network Harder: Connection Provisioning Under Resource Crunch.
IEEE Trans. Netw. Serv. Manag., 2018

Content Fragmentation: A Redundancy Scheme to Save Energy in Cloud Networks.
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
Green and Low-Risk Content Placement in optical content delivery networks.
Proceedings of the 2016 IEEE International Conference on Communications, 2016

2014
Degraded Service Provisioning in Mixed-Line-Rate WDM Backbone Networks Using Multipath Routing.
IEEE/ACM Trans. Netw., 2014

2013
Dynamic Traffic Grooming in Elastic Optical Networks.
IEEE J. Sel. Areas Commun., 2013

2012
Dimensioning optical WDM backbone networks with mixed line rates.
Proceedings of the 2012 IEEE Global Communications Conference, 2012

2011
Risk-aware provisioning for optical WDM mesh networks.
IEEE/ACM Trans. Netw., 2011

Survivable multipath provisioning with differential delay constraint in telecom mesh networks.
IEEE/ACM Trans. Netw., 2011

Time-Differentiated Resilience in Telecom Mesh Networks.
Proceedings of IEEE International Conference on Communications, 2011

2010
Provisioning of deadline-driven requests with flexible transmission rates in WDM mesh networks.
IEEE/ACM Trans. Netw., 2010

Risk-Aware Routing for Optical Transport Networks.
Proceedings of the INFOCOM 2010. 29th IEEE International Conference on Computer Communications, 2010

Greening the Optical Backbone Network: A Traffic Engineering Approach.
Proceedings of IEEE International Conference on Communications, 2010

A Novel SLA for Time-Differentiated Resilience with Efficient Resource Sharing in WDM Networks.
Proceedings of IEEE International Conference on Communications, 2010

2009
Stochastic shortest path with unlimited hops.
Inf. Process. Lett., 2009

Service Cluster: A New Framework for SLA-Oriented Provisioning in WDM Mesh Networks.
Proceedings of IEEE International Conference on Communications, 2009

A Partial-Protection Approach Using Multipath Provisioning.
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

Information Flow and Search in Unstructured Keyword Based Social Networks.
Proceedings of the 12th IEEE International Conference on Computational Science and Engineering, 2009

2008
Deadline-Driven Bandwidth Allocation with Flexible Transmission Rates in WDM Networks.
Proceedings of IEEE International Conference on Communications, 2008

SLA-Aware Provisioning for Revenue Maximization in Telecom Mesh Networks.
Proceedings of the Global Communications Conference, 2008. GLOBECOM 2008, New Orleans, LA, USA, 30 November, 2008

On-Demand Provisioning of Data-Aggregation Requests over WDM Mesh Networks.
Proceedings of the Global Communications Conference, 2008. GLOBECOM 2008, New Orleans, LA, USA, 30 November, 2008

Augmented Graph Models for Small-World Analysis with Geographic Factors.
Proceedings of the Fifth Workshop on Analytic Algorithmics and Combinatorics, 2008

2007
Reliable multipath provisioning for high-capacity backbone mesh networks.
IEEE/ACM Trans. Netw., 2007

When to use splay trees.
Softw. Pract. Exp., 2007

CLID: A general approach to validate security policies in a dynamic network.
Proceedings of the Integrated Network Management, 2007

A Better Approach to Reliable Multi-Path Provisioning.
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

IPsec/VPN security policy correctness and assurance.
J. High Speed Networks, 2006

Designing Low Cost Networks with Short Routes and Low Congestion.
Proceedings of the INFOCOM 2006. 25th IEEE International Conference on Computer Communications, 2006

2005
Analyzing and characterizing small-world graphs.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

2004
Databases that tell the Truth: Authentic Data Publication.
IEEE Data Eng. Bull., 2004

A General Model for Authenticated Data Structures.
Algorithmica, 2004

Analyzing Kleinberg's (and other) small-world Models.
Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, 2004

On building the minimum number of tunnels: an ordered-split approach to manage IPSec/VPN policies.
Proceedings of the Managing Next Generation Convergence Networks and Services, 2004

2003
Authentic Data Publication Over the Internet.
J. Comput. Secur., 2003

Certifying data from multiple sources (extended abstract).
Proceedings of the Proceedings 4th ACM Conference on Electronic Commerce (EC-2003), 2003

Certifying Data from Multiple Sources.
Proceedings of the Data and Applications Security XVII: Status and Prospects, 2003

2002
The expected complexity of Prim's minimum spanning tree algorithm.
Inf. Process. Lett., 2002

The Structure and Complexity of Sports Elimination Numbers.
Algorithmica, 2002

2001
Flexible authentication of XML documents.
Proceedings of the CCS 2001, 2001

2000
Authentic Third-party Data Publication.
Proceedings of the Data and Application Security, 2000

1999
Tresholds for Sports Elimination Numbers Algorithms and Complexity.
Proceedings of the Algorithms and Data Structures, 6th International Workshop, 1999

1998
Optimal Circuits for Parallel Multipliers.
IEEE Trans. Computers, 1998

Graph and Hashing Algorithms for Modern Architectures: Design and Performance.
Proceedings of the Algorithm Engineering, 1998

1997
A Fast Algorithm for Optimally Increasing the Edge Connectivity.
SIAM J. Comput., 1997

1996
Dynamic Prioritized Conflict Resolution on Multiple Access Broadcast Networks.
IEEE Trans. Computers, 1996

Analyzing Self-Adjusting Linear List Algorithms with Deletions and Unsuccessful Searches.
Inf. Process. Lett., 1996

Randomized Competitive Algorithms for Successful and Unsuccessful Search.
Comput. J., 1996

Parallel Algorithms Using Unreliable Broadcasts.
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

Design Strategies for Optimal Multiplier Circuits.
Proceedings of the 12th Symposium on Computer Arithmetic (ARITH-12 '95), 1995

1994
Asynchronous PRAMs with Memory Latency.
J. Parallel Distributed Comput., 1994

On the Complexity of Certified Write-All Algorithms.
J. Algorithms, 1994

Maximum Finding on a Multiple Access Broadcast Network.
Inf. Process. Lett., 1994

Analysing Deletions in Competitive Self-Adjusting Linear List.
Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

1993
Unsuccessful Search in Self-Adjusting Data Structures.
J. Algorithms, 1993

Randomized Competitive Algorithms for Successful and Unsuccessful Search on Self-adjusting Linear Lists.
Proceedings of the Algorithms and Computation, 4th International Symposium, 1993

1992
Work-Optimal Asynchronous Algorithms for Shared Memory Parallel Computers.
SIAM J. Comput., 1992

A Fast Algorithm for the Generalized Parametric Minimum Cut Problem and Applications.
Algorithmica, 1992

On Efficient Unsuccessful Search.
Proceedings of the Third Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1992

1991
Optimal Prioritized Conflict Resolution on a Multiple Access Channel.
IEEE Trans. Computers, 1991

Self-Adjusting Multi-Way Search Trees.
Inf. Process. Lett., 1991

Performance of Priority Queue Structures in a Virtual Memory Environment.
Comput. J., 1991

On non-preemptive scheduling of period and sporadic tasks.
Proceedings of the Real-Time Systems Symposium, 1991

General Asynchrony Is Not Expensive for PRAMs.
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

Asynchronous PRAMs Are (Almost) as Good as Synchronous PRAMs
Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

1989
A comparison of phase and nonphase network flow algorithms.
Networks, 1989

A Fast Parallel Quicksort Algorithm.
Inf. Process. Lett., 1989

Preemptive Scheduling of Two Uniform Machines to Minimize the Number of Late Jobs.
Oper. Res., 1989

On the Efficiency of Maximum-Flow Algorithms on Networks with Small Integer Capacities.
Algorithmica, 1989

1988
A Parallel Algorithm for Preemptive Scheduling of Uniform Machines.
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
Fast Algorithms for Bipartite Network Flow.
SIAM J. Comput., 1987

1986
Lower Bounds on Parallel Algorithms for Finding the First Maximal Independent Set.
Inf. Process. Lett., 1986

Polymatroidal flows with lower bounds.
Discret. Appl. Math., 1986

1985
Preemptive Scheduling to Minimize Maximum Completion Time on Uniform Processors with Memory Constraints.
Oper. Res., 1985

A Generalized Uniform Processor System.
Oper. Res., 1985

1982
Computing Maximal "Polymatroidal" Network Flows.
Math. Oper. Res., 1982

Preemptive Scheduling with Release Times, Deadlines, and Due Times.
J. ACM, 1982

1981
Scheduling Periodically Occurring Tasks on Multiple Processors.
Inf. Process. Lett., 1981


  Loading...