conf/tacs/PfeifferS91:::Phil Pfeiffer::Rebecca Parsons Selke:::On the Adequacy of Dependence-Based Representations for Programs with Heaps.
conf/tacs/AbadiJ01:::Martín Abadi::Jan Jürjens:::Formal Eavesdropping and Its Computational Interpretation.
conf/tacs/Vardi94:::Moshe Y. Vardi:::Nontraditional Applications of Automata Theory.
conf/tagt/Bauderon94:::Michel Bauderon:::A Category-Theoretical Approach to Vertex Replacement: The Generation of Infinite Graphs.
conf/tagt/Drewes98:::Frank Drewes:::Some Remarks on the Generative Power of Collage Grammars and Chain-Code Grammars.
conf/tagt/MunchSW98:::Manfred Münch::Andy Schürr::Andreas J. Winter:::Integrity Constraints in the Multi-paradigm Language PROGRES.
conf/tagt/Wills94:::Linda M. Wills:::Using Attributed Flow Graph Parsing to Recognize Clichés in Programs.
conf/tagt/EngelfrietM98:::Joost Engelfriet::Sebastian Maneth:::Tree Languages Generated be Context-Free Graph Grammars.
conf/tagt/BlosteinFG94:::Dorothea Blostein::Hoda Fahmy::Ann Grbavec:::Issues in the Practical Use of Graph Rewriting.
conf/tagt/SkodinisW98:::Konstantin Skodinis::Egon Wanke:::Neighborhood-Preserving Node Replacements.
conf/tagt/Fracchia94:::F. David Fracchia:::Integrating Lineage and Interaction for the Visualization of Cellular Stuctures.
conf/tagt/DassowHT94:::Jürgen Dassow::Annegret Habel::Stefan Taubenberger:::Chain-Code Pictures and Collages Generated by Hyperedge Replacement.
conf/tagt/PadbergGH98:::Julia Padberg::Magdalena Gajewsky::Kathrin Hoffmann:::Incremental Development of Safety Properties in Petri Net Transformations.
conf/tagt/BusattoEMW98:::Giorgio Busatto::Gregor Engels::Katharina Mehner::Annika Wagner:::A Framework for Adding Packages to Graph Transformation Approaches.
conf/slip/StroobandtM00:::Dirk Stroobandt::Herwig Van Marck:::Efficient representation of interconnection length distributions using generating polynomials.
conf/slip/PapanikolaouMCCMRSM02:::A. Papanikolaou::Miguel Miranda::Francky Catthoor::Henk Corporaal::Hugo De Man::D. De Roest::M. Stucchi::Karen Maex:::Interconnect exploration for future wire dominated technologies.
conf/slip/DhaouT00:::Imed Ben Dhaou::Hannu Tenhunen:::Energy efficient high-speed on-chip signaling in deep-submicron CMOS technology.
conf/slip/NassifF02:::Sani R. Nassif::Onsi Fakhouri:::Technology trends in power-grid-induced noise.
conf/slip/ZhangS02:::Tianpei Zhang::Sachin S. Sapatnekar:::Optimized pin assignment for lower routing congestion after floorplanning phase.
conf/slip/Farrahi00:::Amir H. Farrahi:::Estimation and removal or routing congestion (discussion session).
conf/tapd/Nederhof98:::Mark-Jan Nederhof:::Linear Indexed Automata and Tabulation of TAG Parsing.
conf/tapd/Shemtov98:::Hadar Shemtov:::A Method for Preserving Ambiguities in Chart Generation.
conf/tark/GardenforsM88:::Peter Gärdenfors::David Makinson:::Revisions of Knowledge Systems Using Epistemic Entrenchment.
conf/tark/Voorbraak92:::Frans Voorbraak:::Generalized Kripke Models for Epistemic Logic.
conf/tark/Thomason90:::Richmond H. Thomason:::Propagating Epistemic Coordination Through Mutual Defaults I.
conf/tark/Stalnaker92:::Robert Stalnaker:::Notes on Conditional Semantics.
conf/tark/GilboaS92:::Itzhak Gilboa::David Schmeidler:::Updating Ambiguous Beliefs.
conf/tark/GilboaS94:::Itzhak Gilboa::David Schmeidler:::Case-Based Decision Theory and Knowledge Representation.
conf/tark/HortyP98:::John F. Horty::Martha E. Pollack:::Evaluating Qptions in a Context.
conf/tark/KrasuckiR94:::Paul J. Krasucki::R. Ramanujam:::Knowledge and the Ordering of Events in Distributed Systems.
conf/tark/FischerI86:::Michael J. Fischer::Neil Immerman:::Foundations of Knowledge for Distributed Systems.
conf/tark/FaginGHV92:::Ronald Fagin::John Geanakoplos::Joseph Y. Halpern::Moshe Y. Vardi:::The Expressive Power of the Kierarchical Approach to Modeling Knowledge and Common Knowledge.
conf/tark/Krasucki90:::Paul J. Krasucki:::Reaching Consensus on Decisions.
conf/tark/Kfir-DahavT96:::Noa E. Kfir-Dahav::Moshe Tennenholtz:::Multi-Agent Belief Revision.
conf/tark/McCarthy86:::John McCarthy:::Mental Situation Calculus.
conf/tark/Barwise98:::Jon Barwise:::An Architecture for Heterogeneous Reasoning (Invited Talk).
conf/tark/Levesque94:::Hector J. Levesque:::Knowledge, Action, and Ability in the Situation Calculus.
conf/tark/SchlechtaLM96:::Karl Schlechta::Daniel J. Lehmann::Menachem Magidor:::Distance Semantics for Belief Revision.
conf/tark/Moore88:::Robert C. Moore:::Is It Rational to be Logical?
conf/tark/RosenscheinK86:::Stanley J. Rosenschein::Leslie Pack Kaelbling:::The Synthesis of Digital Machines With Provable Epistemic Properties.
conf/soda/Bern01:::Marshall W. Bern:::Computing the depth of a flat.
conf/soda/Vetta01:::Adrian Vetta:::Approximating the minimum strongly connected subgraph via a matching lower bound.
conf/soda/Chan99:::Timothy M. Chan:::A Near-Linear Area Bound for Drawing Binary Trees.
conf/soda/Brodal98:::Gerth Stølting Brodal:::Finger Search Trees with Constant Insertion Time.
conf/soda/BaevR01:::Ivan D. Baev::Rajmohan Rajaraman:::Approximation algorithms for data placement in arbitrary networks.
conf/soda/ChengD99:::Siu-Wing Cheng::Tamal K. Dey:::Approximate Minimum Weight Steiner Triangulation in Three Dimensions.
conf/soda/ChengN96:::Siu-Wing Cheng::Moon-Pun Ng:::Isomorphism Testing and Display of Symmetries in Dynamic Trees.
conf/soda/DorZ95:::Dorit Dor::Uri Zwick:::Selecting the Median.
conf/soda/Parekh02:::Ojas Parekh:::Edge dominating and hypomatchable sets.
conf/soda/AmirB92:::Amihood Amir::Gary Benson:::Two-Dimensional Periodicity and Its Applications.
conf/soda/AmirF91:::Amihood Amir::Martin Farach:::Efficient 2-dimensional Approximate Matching of Non-Rectangular Figures.
conf/soda/BrodalFJ02:::Gerth Stølting Brodal::Rolf Fagerberg::Riko Jacob:::Cache oblivious search trees via binary trees of small height.
conf/soda/DwyerE94:::Rex A. Dwyer::William F. Eddy:::Maximal Empty Ellipsoids.
conf/soda/Radzik95:::Tomasz Radzik:::Fast Deterministic Approximation for the Multicommodity Flow Problem.
conf/soda/CohenK99:::Edith Cohen::Haim Kaplan:::LP-based Analysis of Greedy-dual-size.
conf/soda/CohenZ97:::Edith Cohen::Uri Zwick:::All-Pairs Small-Stretch Paths.
conf/soda/ArC94:::Sigal Ar::Jin-yi Cai:::Reliable Benchmarks Using Numerical Instability.
conf/soda/DemaineDL99:::Erik D. Demaine::Martin L. Demaine::Anna Lubiw:::Folding and One Straight Cut Suffice.
conf/soda/Pak02:::Igor Pak:::Mixing time and long paths in graphs.
conf/soda/Pan96:::Victor Y. Pan:::A New Approach to Parallel Computation of Polynomial GCD and to Related Parallel Computations over Fields and Integer Rings.
conf/soda/Miltersen98:::Peter Bro Miltersen:::Error Correcting Codes, Perfect Hashing Circuits, and Deterministic Dynamic Dictionaries.
conf/soda/Flaxman03:::Abraham Flaxman:::A spectral technique for random satisfiable 3CNF formulas.
conf/soda/McConnellS94:::Ross M. McConnell::Jeremy Spinrad:::Linear-Time Modular Decomposition and Efficient Transitive Orientation of Comparability Graphs.
conf/soda/KannanK03:::Sampath Kannan::Sanjeev Khanna:::Selection with monotone comparison cost.
conf/soda/LamY98:::Tak Wah Lam::Fung Ling Yue:::Optimal Edge Ranking of Trees in Linear Time.
conf/soda/Biedl01:::Therese C. Biedl:::Linear reductions of maximum matching.
conf/soda/BelowLR00:::Alexander Below::Jesús A. De Loera::Jürgen Richter-Gebert:::Finding minimal triangulations of convex 3-polytopes is NP-hard.
conf/soda/SchulmanZ97:::Leonard J. Schulman::David Zuckerman:::Asymptotically Good Codes Correcting Insertions, Deletions, and Transpositions (Preliminary Version).
conf/soda/ChongL96:::Ka Wong Chong::Tak Wah Lam:::Improving Biconnectivity Approximation via Local Optimization.
conf/soda/AlbersH92:::Susanne Albers::Torben Hagerup:::Improved Parallel Integer Sorting Without Concurrent Writing.
conf/soda/Ramesh93:::H. Ramesh:::On Traversing Layered Graphs On-line.
conf/soda/KolmanS02:::Petr Kolman::Christian Scheideler:::Improved bounds for the unsplittable flow problem.
conf/soda/BlumD02:::Avrim Blum::John Dunagan:::Smoothed analysis of the perceptron algorithm for linear programming.
conf/soda/ArkinMS92:::Esther M. Arkin::Joseph S. B. Mitchell::Subhash Suri:::Optimal Link Path Queries in a Simple Polygon.
conf/soda/FaginKS03:::Ronald Fagin::Ravi Kumar::D. Sivakumar:::Comparing top k lists.
conf/soda/MuthukrishnanS03:::S. Muthukrishnan::Martin Strauss:::Rangesum histograms.
conf/soda/AdlerGHKK94:::Micah Adler::Peter Gemmell::Mor Harchol-Balter::Richard M. Karp::Claire Kenyon:::Selection in the Presence of Noise: The Design of Playoff Systems.
conf/soda/BlumSZ02:::Avrim Blum::Tuomas Sandholm::Martin Zinkevich:::Online algorithms for market clearing.
conf/soda/CzumajKKL99:::Artur Czumaj::Przemyslawa Kanarek::Miroslaw Kutylowski::Krzysztof Lorys:::Delayed Path Coupling and Generating Random Permutations via Distributed Stochastic Processes.
conf/soda/Warnow93:::Tandy Warnow:::Tree Compatibility and Inferring Evoluationary History.
conf/soda/Berger-WolfR99:::Tanya Y. Berger-Wolf::Edward M. Reingold:::Optimal Multichannel Communication Under Failure.
conf/soda/QueyranneS00:::Maurice Queyranne::Maxim Svirdenko:::New and improved algorithms for minsum shop scheduling.
conf/soda/Matrices97:::Aravind Srinivasan:::Improving the Discrepancy Bound for Sparse Matrices: Better Approximations for Sparse Lattice Approximation Problems.
conf/soda/CowenW99:::Lenore Cowen::Christopher G. Wagner:::Compact Roundtrip Routing for Digraphs.
conf/soda/ChoiA02:::Sunghee Choi::Nina Amenta:::Delaunay triangulation programs on surface data.
conf/soda/Charikar02:::Moses Charikar:::On semidefinite programming relaxations for graph coloring and vertex cover.
conf/soda/BussY94:::Samuel R. Buss::Peter N. Yianilos:::Linear and O(n log n) Time Minimum-Cost Matching Algorithms for Quasi-Convex Tours.
conf/soda/Frieze00:::Alan M. Frieze:::Edge-disjoint paths in expander graphs.
conf/soda/SuzukiAN90:::Hitoshi Suzuki::Takehiro Akama::Takao Nishizeki:::Finding Steiner Forests in Planar Graphs.
conf/soda/GuhaM02a:::Sudipto Guha::Kameshwar Munagala:::Generalized clustering.
conf/soda/ChekuriKN01:::Chandra Chekuri::Sanjeev Khanna::Joseph Naor:::A deterministic algorithm for the cost-distance problem.
conf/soda/MunroPS92:::J. Ian Munro::Thomas Papadakis::Robert Sedgewick:::Deterministic Skip Lists.
conf/soda/GabowJ99:::Harold N. Gabow::Tibor Jordán:::How to Make a Square Grid Framework with Cables Rigid.
conf/soda/MotwaniPT93:::Rajeev Motwani::Steven J. Phillips::Eric Torng:::Non-Clairvoyant Scheduling.
conf/soda/DengK93:::Xiaotie Deng::Elias Koutsoupias:::Competitive Implementation of Parallel Programs.
conf/soda/FinklerM99:::Ulrich Finkler::Kurt Mehlhorn:::Checking Priority Queues.
conf/soda/AzarBM93:::Yossi Azar::Andrei Z. Broder::Mark S. Manasse:::On-line Choice of On-line Algorithms.
conf/soda/AggarwalG94:::Manica Aggarwal::Naveen Garg:::A Scaling Technique for Better Network Design.
conf/soda/AgarwalD97:::Pankaj K. Agarwal::Pavan K. Desikan:::An Efficient Algorithm for Terraine Simplification.
conf/soda/Thorup00:::Mikkel Thorup:::Even strongly universal hashing is pretty fast.
conf/soda/Witten03:::Ian H. Witten:::Browsing around a digital library.
conf/soda/CsirikJK01:::János Csirik::David S. Johnson::Claire Kenyon:::Better approximation algorithms for bin covering.
conf/soda/GoelMP01:::Ashish Goel::Adam Meyerson::Serge A. Plotkin:::Approximate majorization and fair online load balancing.
conf/soda/Fekete99:::Sándor P. Fekete:::Simplicity and Hardness of the Maximum Traveling Salesman Problem Under Geometric Distances.
conf/soda/ChvatalFSZ00:::Vasek Chvátal::Jean Fonlupt::L. Sun::A. Zemirline:::Recognizing dart-free perfect graphs.
conf/soda/GuptaZ03:::Anupam Gupta::Francis Zane:::Counting inversions in lists.
conf/soda/FarachNSSWZ95:::Martin Farach::Michiel O. Noordewier::Serap A. Savari::Larry A. Shepp::A. D. Wyner::Jacob Ziv:::On the Entropy of DNA: Algorithms and Measurements Based on Memory and Rapid Convergence.
conf/soda/IndykV00:::Piotr Indyk::Suresh Venkatasubramanian:::Approximate congruence in nearly linear time.
conf/soda/Spencer91:::Thomas H. Spencer:::Time-Work Tradeoffs for Parallel Graph Algorithms.
conf/soda/Grotschel92:::Martin Grötschel:::Theoretical and Practical Aspects of Combinatorial Problem Solving.
conf/soda/VaradarajanA99:::Kasturi R. Varadarajan::Pankaj K. Agarwal:::Approximation Algorithms for Bipartite and Non-Bipartite Matching in the Plane.
conf/soda/Makowsky01:::Johann A. Makowsky:::Colored Tutte polynomials and Kaufman brackets for graphs of bounded tree width.
conf/soda/FleischerS03a:::Lisa Fleischer::Martin Skutella:::Minimum cost flows over time without intermediate storage.
conf/soda/KhullerRY94:::Samir Khuller::Balaji Raghavachari::Neal E. Young:::Approximating the Minimum Equivalent Diagraph.
conf/soda/LandauZ00:::Gad M. Landau::Michal Ziv-Ukelson:::On the shared substring alignment problem.
conf/soda/ClarkM96:::David R. Clark::J. Ian Munro:::Efficient Suffix Trees on Secondary Storage (extended Abstract).
conf/soda/FrigioniMN96:::Daniele Frigioni::Alberto Marchetti-Spaccamela::Umberto Nanni:::Fully Dynamic Output Bounded Single Source Shortest Path Problem (Extended Abstract).
conf/soda/BaschEGHZ99:::Julien Basch::Jeff Erickson::Leonidas J. Guibas::John Hershberger::Li Zhang:::Kinetic Collision Detection Between Two Simple Polygons.
conf/soda/AsanoKOT02:::Tetsuo Asano::Naoki Katoh::Koji Obokata::Takeshi Tokuyama:::Matrix rounding under the Lp-discrepancy measure and its application to digital halftoning.
conf/soda/Shoup93:::Victor Shoup:::Fast Construction of Irreducible Polynomials over Finite Fields.
conf/soda/JansenP99:::Klaus Jansen::Lorant Porkolab:::Linear-Time Approximation Schemes for Scheduling Malleable Parallel Tasks.
conf/soda/ZhouS99:::Yunhong Zhou::Subhash Suri:::Analysis of a Bounding Box Heuristic for Object Intersection.
conf/soda/DyerG00:::Martin E. Dyer::Catherine S. Greenhill:::The complexity of counting graph homomorphisms (extended abstract).
conf/soda/PettieR02a:::Seth Pettie::Vijaya Ramachandran:::Minimizing randomness in minimum spanning tree, parallel connectivity, and set maxima algorithms.
conf/soda/DriscollST91:::James R. Driscoll::Daniel Dominic Sleator::Robert Endre Tarjan:::Fully Persistent Lists with Catenation.
conf/soda/AwerbuchAPW94:::Baruch Awerbuch::Yossi Azar::Serge A. Plotkin::Orli Waarts:::Competitive Routing of Virtual Circuits with Unknown Duration.
conf/soda/KohayakawaRT02:::Yoshiharu Kohayakawa::Vojtech Rödl::Lubos Thoma:::An optimal algorithm for checking regularity (extended abstract).
conf/soda/GuatteryMW99:::Stephen Guattery::Gary L. Miller::Noel Walkington:::Estimating Interpolation Error: A Combinatorial Approach.
conf/soda/AgarwalAS97:::Pankaj K. Agarwal::Boris Aronov::Micha Sharir:::Line Traversals of Balls and Smallest Enclosing Cylinders in Three Dimensions.
conf/soda/BoyanM01:::Justin A. Boyan::Michael Mitzenmacher:::IMproved results for route planning in stochastic transportation.
conf/soda/FiatS02:::Amos Fiat::Jared Saia:::Censorship resistant peer-to-peer content addressable networks.
conf/soda/Cheriyan94:::Joseph Cheriyan:::A Las Vegas O(n<sup>2.38</sup>) Algorithm for the Cardinality of a Maximum Matching.
conf/soda/NaorR01a:::Moni Naor::Omer Reingold:::Constructing pseudo-random permutations with a prescribed structure.
conf/soda/IwamaM99:::Kazuo Iwama::Eiji Miyano:::An O(N) Oblivious Routing Algorithm for 2-D Meshes of Constant Queue-Size.
conf/soda/Gabow96:::Harold N. Gabow:::Perfect Arborescence Packing in Preflow Mincut Graphs.
conf/soda/RobinsZ00:::Gabriel Robins::Alexander Zelikovsky:::Improved Steiner tree approximation in graphs.
conf/soda/BermanKT90:::Piotr Berman::Howard J. Karloff::Gábor Tardos:::A Competitive 3-Server Algorithm.
conf/soda/NarayananOS99:::Lata Narayanan::Jaroslav Opatrny::Dominique Sotteau:::All-to-All Optical Routing in Optimal Chordal Rings of Degree Four.
conf/soda/ParidaRFPG00:::Laxmi Parida::Isidore Rigoutsos::Aris Floratos::Daniel E. Platt::Yuan Gao:::Pattern discovery on character sets and real-valued data: linear bound on irredundant motifs and an efficient polynomial time algorithm.
conf/soda/Eppstein01:::David Eppstein:::Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction.
conf/soda/Eppstein95:::David Eppstein:::Subgraph Isomorphism in Planar Graphs and Related Problems.
conf/soda/JainMVW99:::Kamal Jain::Ion I. Mandoiu::Vijay V. Vazirani::David P. Williamson:::A Primal-Dual Schema Based Approximation Algorithm for the Element Connectivity Problem.
conf/soda/EppsteinH99:::David Eppstein::David Hart:::Shortest Paths in an Arrangement with <i>k</i> Line Orientations.
conf/soda/HoftingW93:::Franz Höfting::Egon Wanke:::Polynomial Algorithms for Minimum Cost Paths in Periodic Graphs.
conf/soda/FunkeR01:::Stefan Funke::Edgar A. Ramos:::Reconstructing a collection of curves with corners and endpoints.
conf/soda/MatiasSV00:::Yossi Matias::Eran Segal::Jeffrey Scott Vitter:::Efficient bundle sorting.
conf/soda/GoodrichOR97:::Michael T. Goodrich::Mark W. Orletsky::Kumar Ramaiyer:::Methods for Achieving Fast Query Times in Point Location Data Structures.
conf/soda/CherkasskyGS97:::Boris V. Cherkassky::Andrew V. Goldberg::Craig Silverstein:::Buckets, Heaps, Lists, and Monotone Priority Queues.
conf/soda/Fleischer98:::L. Fleischer:::Faster Algorithms for the Quickest Transshipment Problem with Zero Transit Times.
conf/soda/ElkinK03:::Michael Elkin::Guy Kortsarz:::Sublogarithmic approximation for telephone multicast: path out of jungle.
conf/soda/BuchsbaumFG02:::Adam L. Buchsbaum::Glenn S. Fowler::Raffaele Giancarlo:::Improving table compression with combinatorial optimization.
conf/soda/Goemans97:::Michel X. Goemans:::Improved Approximation Algorithms for Scheduling with Release Dates.
conf/soda/EschenS93:::Elaine M. Eschen::Jeremy Spinrad:::An O(n²) Algorithm for Circular-Arc Graph Recognition.
conf/soda/EngebretsenS02:::Lars Engebretsen::Madhu Sudan:::Harmonic broadcasting is optimal.
conf/soda/AlbertsH95:::David Alberts::Monika Rauch Henzinger:::Average Case Analysis of Dynamic Graph Algorithms.
conf/soda/MorgensternS90:::Craig A. Morgenstern::Harry Shapiro:::Coloration Neighborhood Structures for General Graph Coloring.
conf/soda/BurnikelMS94:::Christoph Burnikel::Kurt Mehlhorn::Stefan Schirra:::On Degeneracy in Geometric Computations.
conf/soda/FominT03:::Fedor V. Fomin::Dimitrios M. Thilikos:::Dominating sets in planar graphs: branch-width and exponential speed-up.
conf/soda/ArkinBFMS02:::Esther M. Arkin::Michael A. Bender::Sándor P. Fekete::Joseph S. B. Mitchell::Martin Skutella:::The freeze-tag problem: how to wake up a swarm of robots.
conf/soda/Heath91:::Lenwood S. Heath:::Edge Coloring Planar Graphs with Two Outerplanar Subgraphs.
conf/soda/BerkmanPS00:::Omer Berkman::Michal Parnas::Jiri Sgall:::Efficient dynamic traitor tracing.
conf/soda/CohenFM99:::Johanne Cohen::Pierre Fraigniaud::Margarida Mitjana:::Scheduling Calls for Multicasting in Tree-Networks.
conf/soda/BermanK02:::Piotr Berman::Marek Karpinski:::Approximating minimum unsatisfiability of linear equations.
conf/soda/Hesse03:::William Hesse:::Directed graphs requiring large numbers of shortcuts.
conf/soda/AndrewsZ00:::Matthew Andrews::Lisa Zhang:::The effects of temporary sessions on network performance.
conf/soda/KleinbergK99:::Jon M. Kleinberg::Amit Kumar:::Wavelength Conversion in Optical Networks.
conf/snpd/Broy03:::Manfred Broy:::Engineering Software Intensive Systems.
conf/snpd/LeeYC03:::Ji-Hyun Lee::Cheol-Jung Yoo::Ok-Bae Chang:::Component Contract-Based Process for High Level Design.
conf/snpd/Plosch03:::Reinhold Plösch:::The Role of Contracts and Scenarios in the Software Development Process.
conf/snpd/RodriguezPVA03:::Juan José Rodríguez::Vanesa Paniego::Leticia Villar::Carlos J. Alonso:::RBF Networks from Boosted Rules.
conf/snpd/Akingbehin03:::Kiumi Akingbehin:::A Framework for Software Engineering Metrics.
conf/snpd/JonesHD03:::D. Jones::Dave A. Harrison::Alan J. Davies:::Experience Outweighs Intelligence: An Investigation into the Use of Ant Colony System for Maza Solving.
conf/soft/NauckK00:::Detlef Nauck::Rudolf Kruse:::NEFCLASS-J - A JAVA-Based Soft Computing Tool.
conf/spaa/Mitzenmacher94:::Michael Mitzenmacher:::Bounds on the Greedy Routing Algorithm for Array Networks.
conf/spaa/Mitzenmacher97:::Michael Mitzenmacher:::On the Analysis of Randomized Load Balancing Schemes.
conf/spaa/ElsM03:::Robert Elsässer::Burkhard Monien:::Load balancing of unit size tokens and expansion properties of graphs.
conf/spaa/ParkD96:::Seungjoon Park::David L. Dill:::Verification of FLASH Cache Coherence Protocol by Aggregation of Distributed Transactions.
conf/spaa/HoZD98:::Christopher Ho::Heidi Ziegler::Michel Dubois:::In-Memory Directories: Eliminating the Cost of Directories in CC-NUMAs.
conf/spaa/Manber98:::Udi Manber:::How to Find It: Research Issues in Distributed Search (Abstract).
conf/spaa/DyerND95:::Martin E. Dyer::Jonathan M. Nash::Peter M. Dew:::An Optimal Randomized Planar Convex Hull Algorithm With Good Empirical Performance.
conf/spaa/YuG92:::Xiangdong Yu::Dipak Ghosal:::Optimal Dynamic Scheduling of Task Tree on Constant-Dimensional Architectures.
conf/spaa/GreenbergLW93:::Albert G. Greenberg::Boris D. Lubachevsky::Li-C. Wang:::Experience in Massively Parallel Discrete Event Simulation.
conf/spaa/ChaudhryHC03:::Geeta Chaudhry::Elizabeth A. Hamon::Thomas H. Cormen:::Relaxing the problem-size bound for out-of-core columnsort.
conf/spaa/LeeF91:::Fung F. Lee::Michael J. Flynn:::Architectural Mechanisms to Support Three-Dimensional Lattice Gas Simulations.
conf/spaa/Lyuu90:::Yuh-Dauh Lyuu:::Fast-Fault-Tolerant Parallel Communication and On-Line Maintenance Using Information Dispersal.
conf/spaa/KaklamanisKR92:::Christos Kaklamanis::Danny Krizanc::Satish Rao:::Simple Path Selection for Optimal Routing on Processor Arrays.
conf/spaa/CainL02:::Harold W. Cain::Mikko H. Lipasti:::Verifying sequential consistency using vector clocks.
conf/spaa/Schwabe90:::Eric J. Schwabe:::On the Computational Equivalence of Hypercube-Derived Networks.
conf/spaa/GibbonsK94:::Phillip B. Gibbons::Ephraim Korach:::On Testing Cache-Coherent Shared Memories.
conf/spaa/CypherK93:::Robert Cypher::Smaragda Konstantinidou:::Bounds on the Efficiency of Message-Passing Protocols for Parallel Computers.
conf/spaa/GuptaKT03:::Anupam Gupta::Amit Kumar::Mikkel Thorup:::Tree based MPLS routing.
conf/spaa/PongD93:::Fong Pong::Michel Dubois:::The Verification of Cache Coherence Protocols.
conf/spaa/Busch02:::Costas Busch:::Õ(congestion + dilation) hot-potato routing on leveled networks.
conf/spaa/SarkarS96:::Vivek Sarkar::Barbara Simons:::Anticipatory Instruction Scheduling.
conf/spaa/ArgeTZ03:::Lars Arge::Laura Toma::Norbert Zeh:::I/O-efficient topological sorting of planar DAGs.
conf/spaa/HagerupR90:::Torben Hagerup::Tomasz Radzik:::Every Robust CRCW PRAM Can Efficiently Simulate a PRIORITY PRAM.
conf/spaa/ChenWCK98:::Ying Chen::Marianne Winslett::Yong Cho::Szu-Wen Kuo:::Automatic Parallel I/O Performance Optimization in Panda.
conf/spaa/Matsubayashi03:::Akira Matsubayashi:::VLSI layout of trees into grids of minimum width.
conf/spaa/KaklamanisP92:::Christos Kaklamanis::Giuseppe Persiano:::Branch-and-Bound and Backtrack Search on Mesh-Connected Arrays of Processors.
conf/spaa/BeigelKS89:::Richard Beigel::S. Rao Kosaraju::G. F. Sullican:::Locating Faults in a Constant Number of Parallel Testing Rounds.
