| |
      |
                                          |
Note: Links lead to the DBLP on the Web. Charles U. Martel 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) Glen Nuckolls , Charles U. Martel, Stuart G. Stubblebine : Certifying data from multiple sources (extended abstract). ACM Conference on Electronic Commerce 2003 : 210-211 Glen Nuckolls , Charles U. Martel, Stuart G. Stubblebine : Certifying Data from Multiple Sources. DBSec 2003 : 47-60 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) Dan Gusfield , Charles U. Martel: The Structure and Complexity of Sports Elimination Numbers. Algorithmica 32 (1): 73-86 (2002) Charles U. Martel: The expected complexity of Prim's minimum spanning tree algorithm. Inf. Process. Lett. 81 (4): 197-201 (2002) 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 Premkumar T. Devanbu , Michael Gertz , Charles U. Martel, Stuart G. Stubblebine : Authentic Third-party Data Publication. DBSec 2000 : 101-112 Dan Gusfield , Charles U. Martel: Tresholds for Sports Elimination Numbers Algorithms and Complexity. WADS 1999 : 330-341 John R. Black , Charles U. Martel, Hongbin Qi : Graph and Hashing Algorithms for Modern Architectures: Design and Performance. Algorithm Engineering 1998 : 37-48 Paul F. Stelling , Charles U. Martel, Vojin G. Oklobdzija , R. Ravi : Optimal Circuits for Parallel Multipliers. IEEE Trans. Computers 47 (3): 273-285 (1998) Dalit Naor , Dan Gusfield , Charles U. Martel: A Fast Algorithm for Optimally Increasing the Edge Connectivity. SIAM J. Comput. 26 (4): 1139-1165 (1997) John Matthews , Charles U. Martel: Parallel Algorithms Using Unreliable Broadcasts. IPPS 1996 : 692-696 Lucas Chi Kwong Hui , Charles U. Martel: Randomized Competitive Algorithms for Successful and Unsuccessful Search. Comput. J. 39 (5): 427-439 (1996) 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) 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) 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 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 Srinivasan Tridandapani , Anton T. Dahbura , Arun K. Somani , Charles U. Martel, John Mathews : Free Performance and Fault Tolerance: Using System Idle Capacity Efficiently (Panel). SIGMETRICS 1995 : 60-61 Lucas Chi Kwong Hui , Charles U. Martel: Analysing Deletions in Competitive Self-Adjusting Linear List. ISAAC 1994 : 433-441 Charles U. Martel: Maximum Finding on a Multiple Access Broadcast Network. Inf. Process. Lett. 52 (1): 7-15 (1994) Charles U. Martel, Ramesh Subramonian : On the Complexity of Certified Write-All Algorithms. J. Algorithms 16 (3): 361-387 (1994) Charles U. Martel, Arvind Raghunathan : Asynchronous PRAMs with Memory Latency. J. Parallel Distrib. Comput. 23 (1): 10-26 (1994) Lucas Chi Kwong Hui , Charles U. Martel: Randomized Competitive Algorithms for Successful and Unsuccessful Search on Self-adjusting Linear Lists. ISAAC 1993 : 426-435 Lucas Chi Kwong Hui , Charles U. Martel: Unsuccessful Search in Self-Adjusting Data Structures. J. Algorithms 15 (3): 447-481 (1993) Charles U. Martel, Ramesh Subramonian : On the Complexity of Certified Write All Algorithms. FSTTCS 1992 : 368-379 Lucas Chi Kwong Hui , Charles U. Martel: On Efficient Unsuccessful Search. SODA 1992 : 217-227 Dan Gusfield , Charles U. Martel: A Fast Algorithm for the Generalized Parametric Minimum Cut Problem and Applications. Algorithmica 7 (5&6): 499-519 (1992) Charles U. Martel, Arvin Park , Ramesh Subramonian : Work-Optimal Asynchronous Algorithms for Shared Memory Parallel Computers. SIAM J. Comput. 21 (6): 1070-1099 (1992) Jeffrey C. Becker , Charles U. Martel, Arvin Park : General Asynchrony Is Not Expensive for PRAMs. IPPS 1991 : 70-75 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) Charles U. Martel, W. Melody Moh : Optimal Prioritized Conflict Resolution on a Multiple Access Channel. IEEE Trans. Computers 40 (10): 1102-1108 (1991) Charles U. Martel: Self-Adjusting Multi-Way Search Trees. Inf. Process. Lett. 38 (3): 135-141 (1991) Charles U. Martel, Ramesh Subramonian , Arvin Park : Asynchronous PRAMs Are (Almost) as Good as Synchronous PRAMs FOCS 1990 : 590-599 Dalit Naor , Dan Gusfield , Charles U. Martel: A Fast Algorithm for Optimally Increasing the Edge-Connectivity FOCS 1990 : 698-707 Charles U. Martel, Ramesh Subramonian : Asynchronous PRAM Algorithms for List Ranking and Transitive Closure. ICPP (3) 1990 : 60-63 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) Charles U. Martel, Dan Gusfield : A Fast Parallel Quicksort Algorithm. Inf. Process. Lett. 30 (2): 97-102 (1989) Charles U. Martel, Thomas P. Vayda : The Complexity of Selection Resolution, Conflict Resolution and Maximum Finding on Multiple Access Channels. AWOC 1988 : 401-410 Charles U. Martel: A Parallel Algorithm for Preemptive Scheduling of Uniform Machines. J. Parallel Distrib. Comput. 5 (6): 700-715 (1988) Dan Gusfield , Charles U. Martel, David Fernández-Baca : Fast Algorithms for Bipartite Network Flow. SIAM J. Comput. 16 (2): 237-251 (1987) Charles U. Martel: Lower Bounds on Parallel Algorithms for Finding the First Maximal Independent Set. Inf. Process. Lett. 22 (2): 81-85 (1986) Charles U. Martel: Preemptive Scheduling with Release Times, Deadlines, and Due Times. J. ACM 29 (3): 812-829 (1982) Eugene L. Lawler , Charles U. Martel: Scheduling Periodically Occurring Tasks on Multiple Processors. Inf. Process. Lett. 12 (1): 9-12 (1981) 1 [ 15 ] 2 [ 35 ] 3 [ 26 ] 4 [ 37 ] [ 38 ] [ 41 ] [ 44 ] 5 [ 4 ] [ 8 ] 6 [ 37 ] [ 38 ] [ 41 ] [ 44 ] 7 [ 4 ] [ 7 ] [ 10 ] [ 17 ] [ 33 ] [ 36 ] [ 40 ] 8 [ 18 ] [ 20 ] [ 21 ] [ 25 ] [ 29 ] [ 31 ] 9 [ 38 ] [ 44 ] 10 [ 1 ] 11 [ 26 ] 12 [ 14 ] 13 [ 32 ] 14 [ 27 ] [ 30 ] 15 [ 13 ] [ 27 ] [ 30 ] 16 [ 10 ] [ 14 ] [ 33 ] 17 [ 38 ] [ 42 ] [ 43 ] [ 44 ] 18 [ 28 ] [ 34 ] 19 [ 11 ] [ 15 ] [ 16 ] 20 [ 35 ] 21 [ 22 ] 22 [ 28 ] [ 34 ] 23 [ 26 ] 24 [ 28 ] [ 34 ] 25 [ 37 ] [ 38 ] [ 41 ] [ 42 ] [ 43 ] [ 44 ] 26 [ 9 ] [ 11 ] [ 16 ] [ 19 ] [ 23 ] 27 [ 26 ] 28 [ 6 ]  ©2005 Association for Computing Machinery |
