The SCEAS System
| |||||||

## Search the dblp DataBase
Charles U. Martel:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Charles U. Martel, Vojin G. Oklobdzija, R. Ravi, Paul F. Stelling
**Design Strategies for Optimal Multiplier Circuits.**[Citation Graph (0, 0)][DBLP] IEEE Symposium on Computer Arithmetic, 1995, pp:42-49 [Conf] - Charles U. Martel, Thomas P. Vayda
**The Complexity of Selection Resolution, Conflict Resolution and Maximum Finding on Multiple Access Channels.**[Citation Graph (0, 0)][DBLP] AWOC, 1988, pp:401-410 [Conf] - Premkumar T. Devanbu, Michael Gertz, April Kwong, Charles U. Martel, Glen Nuckolls, Stuart G. Stubblebine
**Flexible authentication of XML documents.**[Citation Graph (0, 0)][DBLP] ACM Conference on Computer and Communications Security, 2001, pp:136-145 [Conf] - Premkumar T. Devanbu, Michael Gertz, Charles U. Martel, Stuart G. Stubblebine
**Authentic Third-party Data Publication.**[Citation Graph (0, 0)][DBLP] DBSec, 2000, pp:101-112 [Conf] - Glen Nuckolls, Charles U. Martel, Stuart G. Stubblebine
**Certifying Data from Multiple Sources.**[Citation Graph (0, 0)][DBLP] DBSec, 2003, pp:47-60 [Conf] - Charles U. Martel, Ramesh Subramonian, Arvin Park
**Asynchronous PRAMs Are (Almost) as Good as Synchronous PRAMs**[Citation Graph (0, 0)][DBLP] FOCS, 1990, pp:590-599 [Conf] - Dalit Naor, Dan Gusfield, Charles U. Martel
**A Fast Algorithm for Optimally Increasing the Edge-Connectivity**[Citation Graph (0, 0)][DBLP] FOCS, 1990, pp:698-707 [Conf] - Charles U. Martel, Ramesh Subramonian
**On the Complexity of Certified Write All Algorithms.**[Citation Graph (0, 0)][DBLP] FSTTCS, 1992, pp:368-379 [Conf] - Charles U. Martel, Ramesh Subramonian
**Asynchronous PRAM Algorithms for List Ranking and Transitive Closure.**[Citation Graph (0, 0)][DBLP] ICPP (3), 1990, pp:60-63 [Conf] - Jeffrey C. Becker, Charles U. Martel, Arvin Park
**General Asynchrony Is Not Expensive for PRAMs.**[Citation Graph (0, 0)][DBLP] IPPS, 1991, pp:70-75 [Conf] - John Matthews, Charles U. Martel
**Parallel Algorithms Using Unreliable Broadcasts.**[Citation Graph (0, 0)][DBLP] IPPS, 1996, pp:692-696 [Conf] - Lucas Chi Kwong Hui, Charles U. Martel
**Randomized Competitive Algorithms for Successful and Unsuccessful Search on Self-adjusting Linear Lists.**[Citation Graph (0, 0)][DBLP] ISAAC, 1993, pp:426-435 [Conf] - Lucas Chi Kwong Hui, Charles U. Martel
**Analysing Deletions in Competitive Self-Adjusting Linear List.**[Citation Graph (0, 0)][DBLP] ISAAC, 1994, pp:433-441 [Conf] - W. Melody Moh, Charles U. Martel, Teng-Sheng Moh
**Using Multiple Access Broadcast Network Algorithms for CRCW PRAM Simulations.**[Citation Graph (0, 0)][DBLP] Parallel and Distributed Computing and Systems, 1995, pp:411-415 [Conf] - Charles U. Martel, Van Nguyen
**Analyzing Kleinberg's (and other) small-world Models.**[Citation Graph (0, 0)][DBLP] PODC, 2004, pp:179-188 [Conf] - Glen Nuckolls, Charles U. Martel, Stuart G. Stubblebine
**Certifying data from multiple sources (extended abstract).**[Citation Graph (0, 0)][DBLP] ACM Conference on Electronic Commerce, 2003, pp:210-211 [Conf] - Srinivasan Tridandapani, Anton T. Dahbura, Arun K. Somani, Charles U. Martel, John Matthews
**Free Performance and Fault Tolerance: Using System Idle Capacity Efficiently (Panel).**[Citation Graph (0, 0)][DBLP] SIGMETRICS, 1995, pp:60-61 [Conf] - Lucas Chi Kwong Hui, Charles U. Martel
**On Efficient Unsuccessful Search.**[Citation Graph (0, 0)][DBLP] SODA, 1992, pp:217-227 [Conf] - Van Nguyen, Charles U. Martel
**Analyzing and characterizing small-world graphs.**[Citation Graph (0, 0)][DBLP] SODA, 2005, pp:311-320 [Conf] - Dan Gusfield, Charles U. Martel
**Tresholds for Sports Elimination Numbers Algorithms and Complexity.**[Citation Graph (0, 0)][DBLP] WADS, 1999, pp:330-341 [Conf] - John R. Black, Charles U. Martel, Hongbin Qi
**Graph and Hashing Algorithms for Modern Architectures: Design and Performance.**[Citation Graph (0, 0)][DBLP] Algorithm Engineering, 1998, pp:37-48 [Conf] - David Fernández-Baca, Charles U. Martel
**On the Efficiency of Maximum-Flow Algorithms on Networks with Small Integer Capacities.**[Citation Graph (0, 0)][DBLP] Algorithmica, 1989, v:4, n:2, pp:173-189 [Journal] - Dan Gusfield, Charles U. Martel
**The Structure and Complexity of Sports Elimination Numbers.**[Citation Graph (0, 0)][DBLP] Algorithmica, 2002, v:32, n:1, pp:73-86 [Journal] - Dan Gusfield, Charles U. Martel
**A Fast Algorithm for the Generalized Parametric Minimum Cut Problem and Applications.**[Citation Graph (0, 0)][DBLP] Algorithmica, 1992, v:7, n:5&6, pp:499-519 [Journal] - Charles U. Martel, Glen Nuckolls, Premkumar T. Devanbu, Michael Gertz, April Kwong, Stuart G. Stubblebine
**A General Model for Authenticated Data Structures.**[Citation Graph (0, 0)][DBLP] Algorithmica, 2004, v:39, n:1, pp:21-41 [Journal] - Lucas Chi Kwong Hui, Charles U. Martel
**Randomized Competitive Algorithms for Successful and Unsuccessful Search.**[Citation Graph (0, 0)][DBLP] Comput. J., 1996, v:39, n:5, pp:427-439 [Journal] - Dalit Naor, Charles U. Martel, Norman S. Matloff
**Performance of Priority Queue Structures in a Virtual Memory Environment.**[Citation Graph (0, 0)][DBLP] Comput. J., 1991, v:34, n:5, pp:428-437 [Journal] - Michael Gertz, April Kwong, Charles U. Martel, Glen Nuckolls
**Databases that tell the Truth: Authentic Data Publication.**[Citation Graph (0, 0)][DBLP] IEEE Data Eng. Bull., 2004, v:27, n:1, pp:26-33 [Journal] - Lucas Chi Kwong Hui, Charles U. Martel
**Analyzing Self-Adjusting Linear List Algorithms with Deletions and Unsuccessful Searches.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1996, v:58, n:5, pp:231-236 [Journal] - Eugene L. Lawler, Charles U. Martel
**Scheduling Periodically Occurring Tasks on Multiple Processors.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1981, v:12, n:1, pp:9-12 [Journal] - Charles U. Martel, Dan Gusfield
**A Fast Parallel Quicksort Algorithm.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1989, v:30, n:2, pp:97-102 [Journal] - Charles U. Martel
**Maximum Finding on a Multiple Access Broadcast Network.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1994, v:52, n:1, pp:7-15 [Journal] - Charles U. Martel
**The expected complexity of Prim's minimum spanning tree algorithm.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2002, v:81, n:4, pp:197-201 [Journal] - Charles U. Martel
**Lower Bounds on Parallel Algorithms for Finding the First Maximal Independent Set.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1986, v:22, n:2, pp:81-85 [Journal] - Charles U. Martel
**Self-Adjusting Multi-Way Search Trees.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1991, v:38, n:3, pp:135-141 [Journal] - Charles U. Martel
**Preemptive Scheduling with Release Times, Deadlines, and Due Times.**[Citation Graph (0, 0)][DBLP] J. ACM, 1982, v:29, n:3, pp:812-829 [Journal] - Lucas Chi Kwong Hui, Charles U. Martel
**Unsuccessful Search in Self-Adjusting Data Structures.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 1993, v:15, n:3, pp:447-481 [Journal] - Charles U. Martel, Ramesh Subramonian
**On the Complexity of Certified Write-All Algorithms.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 1994, v:16, n:3, pp:361-387 [Journal] - Premkumar T. Devanbu, Michael Gertz, Charles U. Martel, Stuart G. Stubblebine
**Authentic Data Publication Over the Internet.**[Citation Graph (0, 0)][DBLP] Journal of Computer Security, 2003, v:11, n:3, pp:291-314 [Journal] - Yanyan Yang, Charles U. Martel, Zhi (Judy) Fu, Shyhtsun Felix Wu
**IPsec/VPN security policy correctness and assurance.**[Citation Graph (0, 0)][DBLP] J. High Speed Networks, 2006, v:15, n:3, pp:275-289 [Journal] - Charles U. Martel
**A Parallel Algorithm for Preemptive Scheduling of Uniform Machines.**[Citation Graph (0, 0)][DBLP] J. Parallel Distrib. Comput., 1988, v:5, n:6, pp:700-715 [Journal] - Charles U. Martel, Arvind Raghunathan
**Asynchronous PRAMs with Memory Latency.**[Citation Graph (0, 0)][DBLP] J. Parallel Distrib. Comput., 1994, v:23, n:1, pp:10-26 [Journal] - Dan Gusfield, Charles U. Martel, David Fernández-Baca
**Fast Algorithms for Bipartite Network Flow.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1987, v:16, n:2, pp:237-251 [Journal] - Charles U. Martel, Arvin Park, Ramesh Subramonian
**Work-Optimal Asynchronous Algorithms for Shared Memory Parallel Computers.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1992, v:21, n:6, pp:1070-1099 [Journal] - Dalit Naor, Dan Gusfield, Charles U. Martel
**A Fast Algorithm for Optimally Increasing the Edge Connectivity.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1997, v:26, n:4, pp:1139-1165 [Journal] - Charles U. Martel, W. Melody Moh
**Optimal Prioritized Conflict Resolution on a Multiple Access Channel.**[Citation Graph (0, 0)][DBLP] IEEE Trans. Computers, 1991, v:40, n:10, pp:1102-1108 [Journal] - Charles U. Martel, W. Melody Moh, Teng-Sheng Moh
**Dynamic Prioritized Conflict Resolution on Multiple Access Broadcast Networks.**[Citation Graph (0, 0)][DBLP] IEEE Trans. Computers, 1996, v:45, n:9, pp:1074-1079 [Journal] - Paul F. Stelling, Charles U. Martel, Vojin G. Oklobdzija, R. Ravi
**Optimal Circuits for Parallel Multipliers.**[Citation Graph (0, 0)][DBLP] IEEE Trans. Computers, 1998, v:47, n:3, pp:273-285 [Journal] - Canhui Ou, Laxman H. Sahasrabuddhe, Keyao Zhu, Charles U. Martel, Biswanath Mukherjee
**Survivable virtual concatenation for data over SONET/SDH in optical transport networks.**[Citation Graph (0, 0)][DBLP] IEEE/ACM Trans. Netw., 2006, v:14, n:1, pp:218-231 [Journal] - Yanyan Yang, Charles U. Martel, Shyhtsun Felix Wu
**CLID: A general approach to validate security policies in a dynamic network.**[Citation Graph (0, 0)][DBLP] Integrated Network Management, 2007, pp:1-10 [Conf] - Van Nguyen, Charles U. Martel
**Designing Low Cost Networks with Short Routes and Low Congestion.**[Citation Graph (0, 0)][DBLP] INFOCOM, 2006, pp:- [Conf] - Smita Rai, Omkar Deshpande, Canhui Ou, Charles U. Martel, Biswanath Mukherjee
**Reliable multipath provisioning for high-capacity backbone mesh networks.**[Citation Graph (0, 0)][DBLP] IEEE/ACM Trans. Netw., 2007, v:15, n:4, pp:803-812 [Journal] **Deadline-Driven Bandwidth Allocation with Flexible Transmission Rates in WDM Networks.**[Citation Graph (, )][DBLP]**Service Cluster: A New Framework for SLA-Oriented Provisioning in WDM Mesh Networks.**[Citation Graph (, )][DBLP]**A Partial-Protection Approach Using Multipath Provisioning.**[Citation Graph (, )][DBLP]**Survivable Multipath Provisioning with Differential Delay Constraint in Telecom Mesh Networks.**[Citation Graph (, )][DBLP]**Risk-Aware Routing for Optical Transport Networks.**[Citation Graph (, )][DBLP]**A Better Approach to Reliable Multi-Path Provisioning.**[Citation Graph (, )][DBLP]**SLA-Aware Provisioning for Revenue Maximization in Telecom Mesh Networks.**[Citation Graph (, )][DBLP]**On-Demand Provisioning of Data-Aggregation Requests over WDM Mesh Networks.**[Citation Graph (, )][DBLP]**Flexible Scheduling of Multicast Sessions with Different Granularities for Large Data Distribution over WDM Networks.**[Citation Graph (, )][DBLP]**Information Flow and Search in Unstructured Keyword Based Social Networks.**[Citation Graph (, )][DBLP]**On building the minimum number of tunnels: an ordered-split approach to manage IPSec/VPN policies.**[Citation Graph (, )][DBLP]
Search in 0.062secs, Finished in 0.065secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |