|
|
Conferences in DBLP
- David Peleg
Localized Network Representations. [Citation Graph (0, 0)][DBLP]
CIAC, 2003, pp:1- [Conf]
- Jayme Luiz Szwarcfiter
Optimal Binary Search Trees with Costs Depending on the Access Paths. [Citation Graph (0, 0)][DBLP]
CIAC, 2003, pp:2- [Conf]
- Jayme Luiz Szwarcfiter
On the Generation of Extensions of a Partially Ordered Set. [Citation Graph (0, 0)][DBLP]
CIAC, 2003, pp:3- [Conf]
- Luca Trevisan
Error-Correcting Codes in Complexity Theory. [Citation Graph (0, 0)][DBLP]
CIAC, 2003, pp:4- [Conf]
- Charles E. Leiserson
Cache-Oblivious Algorithms. [Citation Graph (0, 0)][DBLP]
CIAC, 2003, pp:5- [Conf]
- David Peleg
Spanning Trees with Low Maximum/Average Stretch. [Citation Graph (0, 0)][DBLP]
CIAC, 2003, pp:6- [Conf]
- Michael O. Rabin
Hyper Encryption and Everlasting Secrets. [Citation Graph (0, 0)][DBLP]
CIAC, 2003, pp:7-10 [Conf]
- John E. Savage
Computing with Electronic Nanotechnologies. [Citation Graph (0, 0)][DBLP]
CIAC, 2003, pp:11- [Conf]
- Richard Bruce, Michael Hoffmann 0002, Danny Krizanc, Rajeev Raman
Efficient Update Strategies for Geometric Computing with Uncertainty. [Citation Graph (0, 0)][DBLP]
CIAC, 2003, pp:12-23 [Conf]
- Euripides Markou, Stathis Zachos, Christodoulos Fragoudakis
Maximizing the Guarded Boundary of an Art Gallery Is APX-Complete. [Citation Graph (0, 0)][DBLP]
CIAC, 2003, pp:24-35 [Conf]
- Arijit Bishnu, Sandip Das, Subhas C. Nandy, Bhargab B. Bhattacharya
An Improved Algorithm for Point Set Pattern Matching under Rigid Motion. [Citation Graph (0, 0)][DBLP]
CIAC, 2003, pp:36-45 [Conf]
- Bala Kalyanasundaram, Mahendran Velauthapillai, John G. Waclawsky
Unlocking the Advantages of Dynamic Service Selection and Pricing. [Citation Graph (0, 0)][DBLP]
CIAC, 2003, pp:46-57 [Conf]
- Joan Boyar, Lene M. Favrholdt
The Relative Worst Order Ratio for On-Line Algorithms. [Citation Graph (0, 0)][DBLP]
CIAC, 2003, pp:58-69 [Conf]
- Wun-Tat Chan, Tak Wah Lam, Hing-Fung Ting, Prudence W. H. Wong
On-Line Stream Merging, Max Span, and Min Coverage. [Citation Graph (0, 0)][DBLP]
CIAC, 2003, pp:70-82 [Conf]
- William Duckworth, Bernard Mans
Randomised Algorithms for Finding Small Weakly-Connected Dominating Sets of Regular Graphs. [Citation Graph (0, 0)][DBLP]
CIAC, 2003, pp:83-95 [Conf]
- Victor Chepoi, Feodor F. Dragan, Chenyu Yan
Additive Spanners for k-Chordal Graphs. [Citation Graph (0, 0)][DBLP]
CIAC, 2003, pp:96-107 [Conf]
- Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier
Graph-Modeled Data Clustering: Fixed-Parameter Algorithms for Clique Generation. [Citation Graph (0, 0)][DBLP]
CIAC, 2003, pp:108-119 [Conf]
- Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi
Reconciling Gene Trees to a Species Tree. [Citation Graph (0, 0)][DBLP]
CIAC, 2003, pp:120-131 [Conf]
- Jayme Luiz Szwarcfiter
Generating All Forest Extensions of a Partially Ordered Set. [Citation Graph (0, 0)][DBLP]
CIAC, 2003, pp:132-139 [Conf]
- Alessandra Gabriele, Filippo Mignosi, Antonio Restivo, Marinella Sciortino
Indexing Structures for Approximate String Matching. [Citation Graph (0, 0)][DBLP]
CIAC, 2003, pp:140-151 [Conf]
- Miroslav Chlebík, Janka Chlebíková
Approximation Hardness for Small Occurrence Instances of NP-Hard Problems. [Citation Graph (0, 0)][DBLP]
CIAC, 2003, pp:152-164 [Conf]
- Andreas Baltz, Anand Srivastav
Fast Approximation of Minimum Multicast Congestion - Implementation versus Theory. [Citation Graph (0, 0)][DBLP]
CIAC, 2003, pp:165-177 [Conf]
- Joep Aerts, Jan H. M. Korst, Frits C. R. Spieksma
Approximation of a Retrieval Problem for Parallel Disks. [Citation Graph (0, 0)][DBLP]
CIAC, 2003, pp:178-188 [Conf]
- Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger
On k-Edge-Connectivity Problems with Sharpened Triangle Inequality. [Citation Graph (0, 0)][DBLP]
CIAC, 2003, pp:189-200 [Conf]
- Klaus Holzapfel, Sven Kosub, Moritz G. Maaß, Hanjo Täubig
The Complexity of Detecting Fixed-Density Clusters. [Citation Graph (0, 0)][DBLP]
CIAC, 2003, pp:201-212 [Conf]
- Tomoyuki Yamakami
Nearly Bounded Error Probabilistic Sets. [Citation Graph (0, 0)][DBLP]
CIAC, 2003, pp:213-226 [Conf]
- Kazuyuki Amano, Akira Maruoka
Some Properties of MODm Circuits Computing Simple Functions. [Citation Graph (0, 0)][DBLP]
CIAC, 2003, pp:227-237 [Conf]
- Gian Carlo Bongiovanni, Paolo Penna
XOR-Based Schemes for Fast Parallel IP Lookups. [Citation Graph (0, 0)][DBLP]
CIAC, 2003, pp:238-250 [Conf]
- Dimitrios Koukopoulos, Marios Mavronicolas, Sotiris E. Nikoletseas, Paul G. Spirakis
The Impact of Network Structure on the Stability of Greedy Protocols. [Citation Graph (0, 0)][DBLP]
CIAC, 2003, pp:251-263 [Conf]
- Evangelos Kranakis, Paolo Penna, Konrad Schlude, David Scot Taylor, Peter Widmayer
Improving Customer Proximity to Railway Stations. [Citation Graph (0, 0)][DBLP]
CIAC, 2003, pp:264-276 [Conf]
- Cristina Bazgan, Refael Hassin, Jérôme Monnot
Differential Approximation for Some Routing Problems. [Citation Graph (0, 0)][DBLP]
CIAC, 2003, pp:277-288 [Conf]
|
