Journals in DBLP
Mitchell Wand A Short Proof of the Lexical Addressing Algorithm. [Citation Graph (0, 0)][DBLP ] Journal ] Mohan Ahuja , Yahui Zhu An O(n log n) Feasibility Algorithm for Preemptive Scheduling of n Independent Jobs on a Hypercube. [Citation Graph (0, 0)][DBLP ] Journal ] Alok Aggarwal , Subhash Suri Computing the Longest Diagonal of a Simple Polygon. [Citation Graph (0, 0)][DBLP ] Journal ] Jeremy Jacob A Model of Reconfiguration in Communicating Sequential Processes. [Citation Graph (0, 0)][DBLP ] Journal ] Chandrajit L. Bajaj , Tamal K. Dey Polygon Nesting and Robustness. [Citation Graph (0, 0)][DBLP ] Journal ] Rani Siromoney , Lisa Mathew A Public Key Cryptosystem Based on Lyndon Words. [Citation Graph (0, 0)][DBLP ] Journal ] Yu-Tai Ching , Kurt Mehlhorn , Michiel H. M. Smid Dynamic Deferred Data Structuring. [Citation Graph (0, 0)][DBLP ] Journal ] Elena Lodi , Fabrizio Luccio , Linda Pagli Routing in Times Square Mode. [Citation Graph (0, 0)][DBLP ] Journal ] Ronitt Rubinfeld The Cover Time of a Regular Expander is O(n log n). [Citation Graph (0, 0)][DBLP ] Journal ] Laurence Boxer Corrigenda: Common Intersections of Polygons. [Citation Graph (0, 0)][DBLP ] Journal ] Devendra Kumar , S. Sitharama Iyengar , Mohan B. Sharma Corrigenda: Corrections to a Distributed Depth-First Search Algorithm. [Citation Graph (0, 0)][DBLP ] Journal ] 