Chip Martel | Academic Influence

Chip Martel's AcademicInfluence.com Rankings

Chip Martel

Computer Science

#3059

World Rank

#3209

Historical Rank

#1225

USA Rank

Database

#1188

World Rank

#1251

Historical Rank

#328

USA Rank

computer-science Degrees

Download Badge

Computer Science

Chip Martel's Degrees

PhD Computer Science Stanford University
Masters Computer Science Stanford University
Bachelors Computer Science Stanford University

Similar Degrees You Can Earn

Why Is Chip Martel Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Charles U. "Chip" Martel is an American computer scientist and bridge player. Martel was Inducted into the ACBL Hall of Fame in 2014. He is married to Jan Martel, also in the ACBL Hall of Fame. Academic life Martel received a B.S. degree from Massachusetts Institute of Technology in 1975, and a Ph.D. from UC Berkeley in 1980. He helped establish the computer science department at UC Davis, received tenure there in 1985–86, and retired in 2013. At UC Davis he is Charles U. Martel, Professor Emeritus. His academic interests involved designing and analyzing algorithms.

(See a Problem?)

Chip Martel's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

On non-preemptive scheduling of period and sporadic tasks (1991) (641)
Authentic Third-party Data Publication (2000) (262)
A General Model for Authenticated Data Structures (2004) (224)
Authentic Data Publication Over the Internet (2003) (182)
Optimal Circuits for Parallel Multipliers (1998) (162)
Analyzing Kleinberg's (and other) small-world Models (2004) (156)
Scheduling Periodically Occurring Tasks on Multiple Processors (1981) (149)
Computing Maximal "Polymatroidal" Network Flows (1982) (127)
A fast algorithm for optimally increasing the edge-connectivity (1990) (117)
Dynamic Traffic Grooming in Elastic Optical Networks (2013) (107)
Preemptive Scheduling with Release Times, Deadlines, and Due Times (1982) (104)
Survivable Multipath Provisioning with Differential Delay Constraint in Telecom Mesh Networks (2008) (92)
Green Provisioning for Optical WDM Networks (2011) (80)
Greening the Optical Backbone Network: A Traffic Engineering Approach (2010) (77)
Asynchronous PRAMs are (almost) as good as synchronous PRAMs (1990) (75)
Work-Optimal Asynchronous Algorithms for Shared Memory Parallel Computers (1992) (62)
Fast Algorithms for Bipartite Network Flow (1987) (62)
Analyzing and characterizing small-world graphs (2005) (55)
Reliable Multipath Provisioning for High-Capacity Backbone Mesh Networks (2007) (55)
Survivable virtual concatenation for data over SONET/SDH in optical transport networks (2006) (54)
Preemptive Scheduling of Two Uniform Machines to Minimize the Number of Late Jobs (1989) (53)
Provisioning of Deadline-Driven Requests With Flexible Transmission Rates in WDM Mesh Networks (2010) (46)
On the Complexity of Certified Write-All Algorithms (1994) (44)
Risk-Aware Provisioning for Optical WDM Mesh Networks (2011) (42)
Integrated Provisioning of Sliding Scheduled Services Over WDM Optical Networks [Invited] (2009) (41)
Maximum Finding on a Multiple Access Broadcast Network (1994) (41)
The Structure and Complexity of Sports Elimination Numbers (2001) (33)
A General Model for Authentic Data Publication (2001) (32)
Bandwidth Provisioning for Virtual Machine Migration in Cloud: Strategy and Application (2018) (31)
Graph and Hashing Algorithms for Modern Architectures: Design and Performance (1998) (29)
A Partial-Protection Approach Using Multipath Provisioning (2009) (29)
Deadline-Driven Bandwidth Allocation with Flexible Transmission Rates in WDM Networks (2008) (24)
Phase Transitions in the Properties of Random (1995) (24)
A Multistate Multipath Provisioning Scheme for Differentiated Failures in Telecom Mesh Networks (2010) (23)
A fast algorithm for the generalized parametric minimum cut problem and applications (1992) (23)
Service-Centric Provisioning in WDM Backbone Networks for the Future Internet (2009) (22)
Degraded Service Provisioning in Mixed-Line-Rate WDM Backbone Networks Using Multipath Routing (2014) (22)
Survivable Multipath Traffic Grooming in Telecom Mesh Networks With Inverse Multiplexing (2009) (19)
Asynchronous PRAM Algorithms for List Ranking and Transitive Closure (1990) (18)
A Generalized Uniform Processor System (1985) (18)
Scheduling Uniform Machines with Release Times, Deadlines and Due Times (1982) (18)
Global versus essential post-disaster re-provisioning in telecom mesh networks (2015) (18)
A Fast Parallel Quicksort Algorithm (1989) (18)
Design strategies for optimal multiplier circuits (1995) (17)
A Novel SLA Framework for Time-Differentiated Resilience in Optical Mesh Networks (2011) (17)
The expected complexity of Prim's minimum spanning tree algorithm (2002) (16)
Self-Adjusting Multi-Way Search Trees (1991) (16)
On building the minimum number of tunnels: an ordered-split approach to manage IPSec/VPN policies (2004) (16)
Databases that tell the Truth: Authentic Data Publication (2004) (16)
Performance of Priority Queue Structures in a Virtual Memory Environment (1991) (16)
Flow Network Formulations of Polymatroid Optimization Problems (1982) (16)
RASCAR: Recovery-Aware Switch-Controller Assignment and Routing in SDN (2018) (14)
Risk-Aware Routing for Optical Transport Networks (2010) (13)
Fairness-aware degradation based multipath re-provisioning strategy for post-disaster telecom mesh networks (2016) (13)
SLA-Aware Provisioning for Revenue Maximization in Telecom Mesh Networks (2008) (13)
A Parallel Algorithm for Preemptive Scheduling of Uniform Machines (1988) (12)
On-Demand Provisioning of Data-Aggregation Sessions Over WDM Optical Networks (2009) (12)
When to use splay trees (2007) (11)
The Complexity of Selection Resolution, Conflict Resolution and Maximum Finding on Multiple Access Channels (1988) (11)
Certifying Data from Multiple Sources (2003) (11)
Joint Progressive Network and Datacenter Recovery After Large-Scale Disasters (2020) (11)
Asynchronous PRAMs with Memory Latency (1994) (11)
On-Demand Provisioning of Data-Aggregation Requests over WDM Mesh Networks (2008) (10)
Survivable provisioning in Mixed-Line-Rate networks using multipath routing (2012) (10)
A comparison of phase and nonphase network flow algorithms (1989) (10)
Stochastic shortest path with unlimited hops (2009) (10)
Optimal Prioritized Conflict Resolution on a Multiple Access Channel (1991) (10)
Provisioning Subwavelength Multicast Sessions With Flexible Scheduling Over WDM Networks (2010) (9)
Provisioning of Deadline-Driven Requests with Flexible Transmission Rates in Different WDM Network Architectures (2008) (9)
A linear time bin-packing algorithm (1985) (9)
Preemptive Scheduling to Minimize Maximum Completion Time on Uniform Processors with Memory Constraints (1985) (9)
Designing Low Cost Networks with Short Routes and Low Congestion (2006) (8)
A Novel SLA for Time-Differentiated Resilience with Efficient Resource Sharing in WDM Networks (2010) (7)
Adaptive Reliable Multipath Provisioning in Survivable WDM Mesh Networks (2010) (7)
Non-uniform Random Links in Small-world Graphs: Models, Analysis and Applications in Network Designs ⁄ (2005) (7)
IPsec/VPN security policy correctness and assurance (2006) (7)
On efficient unsuccessful search (1992) (6)
Dynamic Prioritized Conflict Resolution on Multiple Access Broadcast Networks (1996) (6)
The Complexity of Message Delivery in Kleinberg's Small-world Model (2004) (6)
Lower Bounds on Parallel Algorithms for Finding the First Maximal Independent Set (1986) (5)
A Better Approach to Reliable Multi-Path Provisioning (2007) (5)
Unsuccessful Search in Self-Adjusting Data Structures (1993) (5)
Content Fragmentation: A Redundancy Scheme to Save Energy in Cloud Networks (2018) (5)
Certifying data from multiple sources [Extended Abstract] (2003) (5)
A multistate multipath provisioning scheme for combating node failures in telecom mesh networks (2009) (5)
CLID: A general approach to validate security policies in a dynamic network (2007) (5)
New Approach to Reliable Multipath Provisioning (2011) (5)
Running the Network Harder: Connection Provisioning Under Resource Crunch (2017) (5)
Generalized network flows with an application to multiprocessor scheduling (1980) (4)
Information Flow and Search in Unstructured Keyword Based Social Networks (2009) (4)
Green and Low-Risk Content Placement in optical content delivery networks (2016) (4)
Designing Fast Graph Data Structures: An Experimental Approach (1998) (3)
Polymatroidal flows with lower bounds (1986) (3)
Provisioning Subwavelength Multicast Sessions withFlexible Scheduling over WDM Mesh Networks (2010) (3)
General asynchrony is not expensive for PRAMs (1991) (2)
Randomized Competitive Algorithms for Successful and Unsuccessful Search on Self-adjusting Linear Lists (1993) (2)
Design and Analysis of Hashing Algorithms with Cache Eeects (1998) (2)
Flexible Scheduling of Multicast Sessions with Different Granularities for Large Data Distribution over WDM Networks (2009) (2)
Post-disaster re-provisioning algorithms for optical mesh networks (2015) (2)
Provisioning Data-Aggregation Sessions in Lambda Grids ? (2008) (2)
Analysis and Models for Small-World Graphs ⁄ (2005) (2)
Dimensioning optical WDM backbone networks with mixed line rates (2012) (2)
Randomized Competitive Algorithms for Successful and Unsuccessful Search (1996) (2)
Tresholds for Sports Elimination Numbers Algorithms and Complexity (1999) (1)
Re-Provisioning Methods for Post-Disaster Optical Networks (2014) (1)
Running the Network Harder: Connection Provisioning with Degradation under Resource Crunch (2017) (1)
Analysing Deletions in Competitive Self-Adjusting Linear List (1994) (1)
On the Complexity of Certified Write All Algorithms (1992) (1)
Parallel algorithms using unreliable broadcasts (1996) (1)
Service-centric provisioning for next-generation optical networks (2010) (1)
Time-Differentiated Resilience in Telecom Mesh Networks (2011) (1)
On the efficiency of maximum-flow algorithms on networks with small integer capacities (1989) (1)
Service Cluster: A New Framework for SLA-Oriented Provisioning in WDM Mesh Networks (2009) (1)
Augmented Graph Models for Small-World Analysis with Geographic Factors (2008) (1)
Maximizing Profit Using SLA-Aware Provisioning in WDM Networks (2011) (0)
Tepper School of Business 7-1995 Design Strategies for Optimal Multiplier Circuits (2015) (0)
Free Performance and Fault Tolerance: Using System Idle Capacity Efficiently (Panel) (1995) (0)
Graph and Hashing Algorithms for Modern Ar hite tures (2007) (0)
A New Approach to Reliable Multi-Path Provisioning (2010) (0)
Using Multiple Access Broadcast Network Algorithms for CRCW PRAM Simulations (1995) (0)
Free performance and fault tolerance (extended abstract): using system idle capacity efficiently (1995) (0)
Authentication of published data (2003) (0)
Analyzing Self-Adjusting Linear List Algorithms with Deletions and Unsuccessful Searches (1996) (0)

This paper list is powered by the following services:

Other Resources About Chip Martel

en.wikipedia.org

What Schools Are Affiliated With Chip Martel?

Chip Martel is affiliated with the following schools: