| 2009 |
|---|
| 59 | EE | Ananya Das,
Charles U. Martel:
Stochastic shortest path with unlimited hops.
Inf. Process. Lett. 109(5): 290-295 (2009) |
| 2008 |
|---|
| 58 | EE | 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 |
| 57 | EE | 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 |
| 56 | EE | 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 |
| 2007 |
|---|
| 55 | EE | Ananya Das,
Charles U. Martel,
Biswanath Mukherjee,
Smita Rai:
A Better Approach to Reliable Multi-Path Provisioning.
GLOBECOM 2007: 2724-2728 |
| 54 | EE | 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 |
| 53 | EE | 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) |
| 52 | EE | Eric K. Lee,
Charles U. Martel:
When to use splay trees.
Softw., Pract. Exper. 37(15): 1559-1575 (2007) |
| 2006 |
|---|
| 51 | EE | Van Nguyen,
Charles U. Martel:
Designing Low Cost Networks with Short Routes and Low Congestion.
INFOCOM 2006 |
| 50 | EE | 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) |
| 49 | EE | 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) |
| 2005 |
|---|
| 48 | EE | Van Nguyen,
Charles U. Martel:
Analyzing and characterizing small-world graphs.
SODA 2005: 311-320 |
| 2004 |
|---|
| 47 | EE | 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 |
| 46 | EE | Charles U. Martel,
Van Nguyen:
Analyzing Kleinberg's (and other) small-world Models.
PODC 2004: 179-188 |
| 45 | EE | 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) |
| 44 | EE | 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) |
| 2003 |
|---|
| 43 | EE | Glen Nuckolls,
Charles U. Martel,
Stuart G. Stubblebine:
Certifying data from multiple sources (extended abstract).
ACM Conference on Electronic Commerce 2003: 210-211 |
| 42 | | Glen Nuckolls,
Charles U. Martel,
Stuart G. Stubblebine:
Certifying Data from Multiple Sources.
DBSec 2003: 47-60 |
| 41 | | Premkumar T. Devanbu,
Michael Gertz,
Charles U. Martel,
Stuart G. Stubblebine:
Authentic Data Publication Over the Internet.
Journal of Computer Security 11(3): 291-314 (2003) |
| 2002 |
|---|
| 40 | EE | Dan Gusfield,
Charles U. Martel:
The Structure and Complexity of Sports Elimination Numbers.
Algorithmica 32(1): 73-86 (2002) |
| 39 | EE | Charles U. Martel:
The expected complexity of Prim's minimum spanning tree algorithm.
Inf. Process. Lett. 81(4): 197-201 (2002) |
| 2001 |
|---|
| 38 | EE | Premkumar T. Devanbu,
Michael Gertz,
April Kwong,
Charles U. Martel,
Glen Nuckolls,
Stuart G. Stubblebine:
Flexible authentication of XML documents.
ACM Conference on Computer and Communications Security 2001: 136-145 |
| 2000 |
|---|
| 37 | | Premkumar T. Devanbu,
Michael Gertz,
Charles U. Martel,
Stuart G. Stubblebine:
Authentic Third-party Data Publication.
DBSec 2000: 101-112 |
| 1999 |
|---|
| 36 | EE | Dan Gusfield,
Charles U. Martel:
Tresholds for Sports Elimination Numbers Algorithms and Complexity.
WADS 1999: 330-341 |
| 1998 |
|---|
| 35 | | John R. Black,
Charles U. Martel,
Hongbin Qi:
Graph and Hashing Algorithms for Modern Architectures: Design and Performance.
Algorithm Engineering 1998: 37-48 |
| 34 | | Paul F. Stelling,
Charles U. Martel,
Vojin G. Oklobdzija,
R. Ravi:
Optimal Circuits for Parallel Multipliers.
IEEE Trans. Computers 47(3): 273-285 (1998) |
| 1997 |
|---|
| 33 | | 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 |
|---|
| 32 | EE | John Matthews,
Charles U. Martel:
Parallel Algorithms Using Unreliable Broadcasts.
IPPS 1996: 692-696 |
| 31 | | Lucas Chi Kwong Hui,
Charles U. Martel:
Randomized Competitive Algorithms for Successful and Unsuccessful Search.
Comput. J. 39(5): 427-439 (1996) |
| 30 | | 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) |
| 29 | EE | 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) |
| 1995 |
|---|
| 28 | EE | 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 |
| 27 | | 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 |
| 26 | | 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 |
|---|
| 25 | | Lucas Chi Kwong Hui,
Charles U. Martel:
Analysing Deletions in Competitive Self-Adjusting Linear List.
ISAAC 1994: 433-441 |
| 24 | | Charles U. Martel:
Maximum Finding on a Multiple Access Broadcast Network.
Inf. Process. Lett. 52(1): 7-15 (1994) |
| 23 | | Charles U. Martel,
Ramesh Subramonian:
On the Complexity of Certified Write-All Algorithms.
J. Algorithms 16(3): 361-387 (1994) |
| 22 | | Charles U. Martel,
Arvind Raghunathan:
Asynchronous PRAMs with Memory Latency.
J. Parallel Distrib. Comput. 23(1): 10-26 (1994) |
| 1993 |
|---|
| 21 | | Lucas Chi Kwong Hui,
Charles U. Martel:
Randomized Competitive Algorithms for Successful and Unsuccessful Search on Self-adjusting Linear Lists.
ISAAC 1993: 426-435 |
| 20 | | Lucas Chi Kwong Hui,
Charles U. Martel:
Unsuccessful Search in Self-Adjusting Data Structures.
J. Algorithms 15(3): 447-481 (1993) |
| 1992 |
|---|
| 19 | | Charles U. Martel,
Ramesh Subramonian:
On the Complexity of Certified Write All Algorithms.
FSTTCS 1992: 368-379 |
| 18 | EE | Lucas Chi Kwong Hui,
Charles U. Martel:
On Efficient Unsuccessful Search.
SODA 1992: 217-227 |
| 17 | | Dan Gusfield,
Charles U. Martel:
A Fast Algorithm for the Generalized Parametric Minimum Cut Problem and Applications.
Algorithmica 7(5&6): 499-519 (1992) |
| 16 | | Charles U. Martel,
Arvin Park,
Ramesh Subramonian:
Work-Optimal Asynchronous Algorithms for Shared Memory Parallel Computers.
SIAM J. Comput. 21(6): 1070-1099 (1992) |
| 1991 |
|---|
| 15 | | Jeffrey C. Becker,
Charles U. Martel,
Arvin Park:
General Asynchrony Is Not Expensive for PRAMs.
IPPS 1991: 70-75 |
| 14 | | 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) |
| 13 | | Charles U. Martel,
W. Melody Moh:
Optimal Prioritized Conflict Resolution on a Multiple Access Channel.
IEEE Trans. Computers 40(10): 1102-1108 (1991) |
| 12 | | Charles U. Martel:
Self-Adjusting Multi-Way Search Trees.
Inf. Process. Lett. 38(3): 135-141 (1991) |
| 1990 |
|---|
| 11 | | Charles U. Martel,
Ramesh Subramonian,
Arvin Park:
Asynchronous PRAMs Are (Almost) as Good as Synchronous PRAMs
FOCS 1990: 590-599 |
| 10 | | Dalit Naor,
Dan Gusfield,
Charles U. Martel:
A Fast Algorithm for Optimally Increasing the Edge-Connectivity
FOCS 1990: 698-707 |
| 9 | | Charles U. Martel,
Ramesh Subramonian:
Asynchronous PRAM Algorithms for List Ranking and Transitive Closure.
ICPP (3) 1990: 60-63 |
| 1989 |
|---|
| 8 | | 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) |
| 7 | | Charles U. Martel,
Dan Gusfield:
A Fast Parallel Quicksort Algorithm.
Inf. Process. Lett. 30(2): 97-102 (1989) |
| 1988 |
|---|
| 6 | | Charles U. Martel,
Thomas P. Vayda:
The Complexity of Selection Resolution, Conflict Resolution and Maximum Finding on Multiple Access Channels.
AWOC 1988: 401-410 |
| 5 | | Charles U. Martel:
A Parallel Algorithm for Preemptive Scheduling of Uniform Machines.
J. Parallel Distrib. Comput. 5(6): 700-715 (1988) |
| 1987 |
|---|
| 4 | | Dan Gusfield,
Charles U. Martel,
David Fernández-Baca:
Fast Algorithms for Bipartite Network Flow.
SIAM J. Comput. 16(2): 237-251 (1987) |
| 1986 |
|---|
| 3 | | Charles U. Martel:
Lower Bounds on Parallel Algorithms for Finding the First Maximal Independent Set.
Inf. Process. Lett. 22(2): 81-85 (1986) |
| 1982 |
|---|
| 2 | EE | Charles U. Martel:
Preemptive Scheduling with Release Times, Deadlines, and Due Times.
J. ACM 29(3): 812-829 (1982) |
| 1981 |
|---|
| 1 | | Eugene L. Lawler,
Charles U. Martel:
Scheduling Periodically Occurring Tasks on Multiple Processors.
Inf. Process. Lett. 12(1): 9-12 (1981) |
