2004-09-07 A new method to locate saddle points for reactions in solution by using the free-energy gradient method and the mean field approximation. 1227-1233 2004 25 Journal of Computational Chemistry 10 http://dx.doi.org/10.1002/jcc.20048 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc25.html#GalvanMA04 2004-09-07 A simple computational scheme for obtaining localized bonding schemes and their weights from a CASSCF wave function. 343-367 2004 25 Journal of Computational Chemistry 3 http://dx.doi.org/10.1002/jcc.10363 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc25.html#Bachler04 2004-09-07 On the transferability of hydration-parametrized continuum electrostatics models to solvated binding calculations. 954-962 2003 24 Journal of Computational Chemistry 8 http://dx.doi.org/10.1002/jcc.10261 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#RankinSP03 2004-09-07 beta-Hairpins, alpha-helices, and the intermediates among the secondary structures in the energy landscape of a peptide from a distal beta-hairpin of SH3 domain. 310-318 2003 24 Journal of Computational Chemistry 3 http://dx.doi.org/10.1002/jcc.10160 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#IkedaGNH03 2004-09-28 The structure and stability of Si60 and Ge60 cages: A computational study. 948-953 2003 24 Journal of Computational Chemistry 8 http://dx.doi.org/10.1002/jcc.10266 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#ChenJSHYCTS03 2004-09-07 Bond energies for molecules, clusters, and deposit systems. 2013-2022 2003 24 Journal of Computational Chemistry 16 http://dx.doi.org/10.1002/jcc.10343 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#JugG03 2004-09-07 Design and training of a neural network for predicting the solvent accessibility of proteins. 1313-1320 2003 24 Journal of Computational Chemistry 11 http://dx.doi.org/10.1002/jcc.10298 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#AhmadG03 2004-09-07 Hydrolysis of cyclic phosphates by ribonuclease A: A computational study using a simplified ab initio quantum model. 1803-1811 2003 24 Journal of Computational Chemistry 14 http://dx.doi.org/10.1002/jcc.10331 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#WladkowskiOCBK03 2004-09-07 Algorithm for normal mode analysis with general internal coordinates. 826-841 2003 24 Journal of Computational Chemistry 7 http://dx.doi.org/10.1002/jcc.10247 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#KamiyaSU03 2006-07-17 Conformational analysis by intersection: CONAN. 10-20 2003 24 Journal of Computational Chemistry 1 http://dx.doi.org/10.1002/jcc.10175 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#SmellieSHT03 2004-09-07 Theoretical studies for structures and energetics of RgnN2O (RgHe, Ne, Ar) clusters. 1839-1845 2003 24 Journal of Computational Chemistry 15 http://dx.doi.org/10.1002/jcc.10347 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#ZhuXY03 2004-09-07 EVEBAT: A fast strategy for the examination of the empty space in polymer matrices. 1208-1214 2003 24 Journal of Computational Chemistry 10 http://dx.doi.org/10.1002/jcc.10254 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#CurcoZA03 2004-09-07 The SAAP force field. A simple approach to a new all-atom protein force field by using single amino acid potential (SAAP) functions in various solvents. 1192-1200 2003 24 Journal of Computational Chemistry 10 http://dx.doi.org/10.1002/jcc.10259 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#IwaokaT03 2004-09-07 Wave functions derived from experiment. V. Investigation of electron densities, electrostatic potentials, and electron localization functions for noncentrosymmetric crystals. 470-483 2003 24 Journal of Computational Chemistry 4 http://dx.doi.org/10.1002/jcc.10238 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#GrimwoodBJ03 2004-09-07 Detailed analysis of grid-based molecular docking: A case study of CDOCKER - A CHARMm-based MD docking algorithm. 1549-1562 2003 24 Journal of Computational Chemistry 13 http://dx.doi.org/10.1002/jcc.10306 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#WuRBV03 2004-09-07 MOPED: Method for optimizing physical energy parameters using decoys. 89-97 2003 24 Journal of Computational Chemistry 1 http://dx.doi.org/10.1002/jcc.10124 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#SeokRCD03 2004-09-07 Ab initio study of the mechanism of the atmospheric reaction: NO2 + O3 NO3 + O2. 1657-1663 2003 24 Journal of Computational Chemistry 13 http://dx.doi.org/10.1002/jcc.10299 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#Peiro-GarciaN03 2004-09-07 Electrostatic potentials and covalent radii. 505-511 2003 24 Journal of Computational Chemistry 4 http://dx.doi.org/10.1002/jcc.10209 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#PolitzerML03 2004-09-07 Inter- and intramolecular potential for the N-formylglycinamide-water system. A comparison between theoretical modeling and empirical force fields. 161-176 2003 24 Journal of Computational Chemistry 2 http://dx.doi.org/10.1002/jcc.10159 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#Hermida-RamonBKB03 2004-09-07 New parameterization of the Cornell et al. empirical force field covering amino group nonplanarity in nucleic acid bases. 1891-1902 2003 24 Journal of Computational Chemistry 15 http://dx.doi.org/10.1002/jcc.10352 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#RyjaekKH03 2004-09-07 A computationally inexpensive modification of the point dipole electrostatic polarization model for molecular simulations. 267-276 2003 24 Journal of Computational Chemistry 3 http://dx.doi.org/10.1002/jcc.10170 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#KaminskiFZ03 2004-09-07 Statistical analysis of the estimation of distance measures. 786-796 2003 24 Journal of Computational Chemistry 6 http://dx.doi.org/10.1002/jcc.10202 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#PinskyYA03 2004-09-07 Toward direct determination of conformations of protein building units from multidimensional NMR experiments. V. NMR chemical shielding analysis of N-formyl-serinamide, a model for polar side-chain containing peptides. 1157-1171 2003 24 Journal of Computational Chemistry 10 http://dx.doi.org/10.1002/jcc.10286 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#PerczelFC03 2004-09-07 Free energy perturbation and molecular dynamics calculations of copper binding to azurin. 779-785 2003 24 Journal of Computational Chemistry 6 http://dx.doi.org/10.1002/jcc.10213 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#PappalardoMGR03 2004-09-07 8-oxoguanine lesioned B-DNA molecule complexed with repair enzyme hOGG1: A molecular dynamics study. 898-907 2003 24 Journal of Computational Chemistry 7 http://dx.doi.org/10.1002/jcc.10248 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#Pinak03 2004-09-07 A local interpolation scheme using no derivatives in potential sampling: Application to O(1D) + H2 system. 1077-1086 2003 24 Journal of Computational Chemistry 9 http://dx.doi.org/10.1002/jcc.10252 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#IshidaS03 2004-09-07 Transferability of fragmental contributions to the octanol/water partition coefficient: An NDDO-based MST study. 32-45 2003 24 Journal of Computational Chemistry 1 http://dx.doi.org/10.1002/jcc.10155 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#CurutchetSBOL03 2004-09-07 Dependence of the rate constants on the treatment of internal rotation modes: The reaction OH + CH3SH CH3S + H2O as an example. 701-706 2003 24 Journal of Computational Chemistry 6 http://dx.doi.org/10.1002/jcc.10191 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#MasgrauGL03 2004-09-07 Predicting structural models for silicon clusters. 869-875 2003 24 Journal of Computational Chemistry 7 http://dx.doi.org/10.1002/jcc.10199 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#ZachariasLJO03 2004-09-07 Application of the quantum theory of atoms in molecules to selected physico-chemical and biophysical problems: Focus on correlation with experiment. 453-463 2003 24 Journal of Computational Chemistry 4 http://dx.doi.org/10.1002/jcc.10208 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#Matta03 2004-09-07 Reassessment of methyl rotation barriers and conformations by correlated quantum chemistry methods. 2093-2100 2003 24 Journal of Computational Chemistry 16 http://dx.doi.org/10.1002/jcc.10324 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#RioBM03 2004-09-07 Modeling zinc in biomolecules with the self consistent charge-density functional tight binding (SCC-DFTB) method: Applications to structural and energetic analysis. 565-581 2003 24 Journal of Computational Chemistry 5 http://dx.doi.org/10.1002/jcc.10201 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#ElstnerCMKFK03 2004-09-07 Intraprotein electrostatics derived from first principles: Divide-and-conquer approaches for QM/MM calculations. 1971-1979 2003 24 Journal of Computational Chemistry 16 http://dx.doi.org/10.1002/jcc.10333 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#MolinaLJ03 2004-09-07 A computational study of the LiH dimer. 1201-1207 2003 24 Journal of Computational Chemistry 10 http://dx.doi.org/10.1002/jcc.10281 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#McDowell03 2004-09-07 Inherent speedup limitations in multiple time step/particle mesh Ewald algorithms. 77-88 2003 24 Journal of Computational Chemistry 1 http://dx.doi.org/10.1002/jcc.10196 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#BarashYQS03 2004-09-07 An algorithm to delineate and integrate topological basins in a three-dimensional quantum mechanical density function. 1276-1282 2003 24 Journal of Computational Chemistry 10 http://dx.doi.org/10.1002/jcc.10250 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#MalcolmP03a 2004-09-07 Improved third-order Møller-Plesset perturbation theory. 1529-1537 2003 24 Journal of Computational Chemistry 13 http://dx.doi.org/10.1002/jcc.10320 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#Grimme03 2004-09-07 A computational study of conformational interconversions in 1, 4-dithiacyclohexane (1, 4-dithiane). 909-919 2003 24 Journal of Computational Chemistry 8 http://dx.doi.org/10.1002/jcc.10187 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#FreemanD03 2004-09-07 Assessment of the OLYP and O3LYP density functionals for first-row transition metals. 1184-1191 2003 24 Journal of Computational Chemistry 10 http://dx.doi.org/10.1002/jcc.10280 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#BakerP03 2004-09-07 Catalysis on the coastline: Theozyme, molecular dynamics, and free energy perturbation analysis of antibody 21D8 catalysis of the decarboxylation of 5-nitro-3-carboxybenzisoxazole. 98-110 2003 24 Journal of Computational Chemistry 1 http://dx.doi.org/10.1002/jcc.10151 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#UjaqueTHHHH03 2004-11-16 Flexible effective fragment QM/MM method: Validation through the challenging tests. 1410-1420 2003 24 Journal of Computational Chemistry 12 http://dx.doi.org/10.1002/jcc.10309 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#NemukhinGTB03 2004-09-07 Many-body effects on structure and dynamics of aqueous ionic solutions- Erratum. 1688 2003 24 Journal of Computational Chemistry 13 http://dx.doi.org/10.1002/10.1002/jcc.10362 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#LoefflerR03 2004-09-07 Ab initio studies for the photodissociation mechanism of hydroxyacetone. 931-938 2003 24 Journal of Computational Chemistry 8 http://dx.doi.org/10.1002/jcc.10264 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#WuXX03 2004-09-07 Geometry optimization with QM/MM, ONIOM, and other combined methods. I. Microiterations and constraints. 760-769 2003 24 Journal of Computational Chemistry 6 http://dx.doi.org/10.1002/jcc.10156 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#VrevenMFSF03 2004-09-07 Development of hardware accelerator for molecular dynamics simulations: A computation board that calculates nonbonded interactions in cooperation with fast multipole method. 582-592 2003 24 Journal of Computational Chemistry 5 http://dx.doi.org/10.1002/jcc.10193 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#AmisakiTMK03 2004-09-07 Comparison of electron density properties in frozen and relaxed electronic distributions. 416-421 2003 24 Journal of Computational Chemistry 4 http://dx.doi.org/10.1002/jcc.10204 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#AlkortaEEMM03 2004-09-07 Structural and dynamical analysis of the hydration of the Alzheimer's beta-amyloid peptide. 143-153 2003 24 Journal of Computational Chemistry 2 http://dx.doi.org/10.1002/jcc.10101 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#MassiS03 2004-09-07 Theoretical studies on structures and reactivities of organocuprate(I) and organocopper(III) species. 1401-1409 2003 24 Journal of Computational Chemistry 12 http://dx.doi.org/10.1002/jcc.10132 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#YamanakaIN03 2004-09-07 Computing motif correlations in proteins. 2032-2043 2003 24 Journal of Computational Chemistry 16 http://dx.doi.org/10.1002/jcc.10332 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#HorngHWCHH03 2004-09-07 Docking macromolecules with flexible segments. 1910-1920 2003 24 Journal of Computational Chemistry 15 http://dx.doi.org/10.1002/jcc.10329 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#BastardTLP03 2004-09-07 Exact rotamer optimization for protein design. 232-243 2003 24 Journal of Computational Chemistry 2 http://dx.doi.org/10.1002/jcc.10121 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#GordonHMP03 2004-09-07 Comparison of various implicit solvent models in molecular dynamics simulations of immunoglobulin G light chain dimer. 531-546 2003 24 Journal of Computational Chemistry 5 http://dx.doi.org/10.1002/jcc.10186 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#Krol03 2004-09-07 An ab initio study of intermolecular interactions of nitromethane dimer and nitromethane trimer. 345-352 2003 24 Journal of Computational Chemistry 3 http://dx.doi.org/10.1002/jcc.10179 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#LiZJ03 2005-03-10 Nonspecific interaction forces at water-membrane interface by forced molecular dynamics simulations. 328-339 2003 24 Journal of Computational Chemistry 3 http://dx.doi.org/10.1002/jcc.10163 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#LorenzoPB03 2004-09-07 Hydride transfer catalyzed by xylose isomerase: Mechanism and quantum effects. 177-190 2003 24 Journal of Computational Chemistry 2 http://dx.doi.org/10.1002/jcc.10154 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#Garcia-VilocaATG03 2004-09-28 Conformational properties of penicillins: Quantum chemical calculations and molecular dynamics simulations of benzylpenicillin. 1864-1873 2003 24 Journal of Computational Chemistry 15 http://dx.doi.org/10.1002/jcc.10350 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#DiazSS03 2004-09-07 Electronic excitations of the green fluorescent protein chromophore in its protonation states: SAC/SAC-CI study. 1421-1431 2003 24 Journal of Computational Chemistry 12 http://dx.doi.org/10.1002/jcc.10308 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#DasHMEN03 2004-09-07 Ab initio determination of the electric multipole moments and static (hyper)polarizability of HCCX, X = F, Cl, Br, and I. 443-452 2003 24 Journal of Computational Chemistry 4 http://dx.doi.org/10.1002/jcc.10239 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#Maroulis03 2004-09-07 Calculation of the water-cyclohexane transfer free energies of neutral amino acid side-chain analogs using the OPLS all-atom force field. 1930-1935 2003 24 Journal of Computational Chemistry 15 http://dx.doi.org/10.1002/jcc.10328 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#MacCallumT03 2004-09-07 Alcohols, ethers, carbohydrates, and related compounds. IV. carbohydrates. 1504-1513 2003 24 Journal of Computational Chemistry 12 http://dx.doi.org/10.1002/jcc.10271 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#LiiCA03 2004-09-07 Systematic and statistical error in histogram-based free energy calculations. 1437-1446 2003 24 Journal of Computational Chemistry 12 http://dx.doi.org/10.1002/jcc.10313 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#Kobrak03 2004-12-07 Single-step perturbations to calculate free energy differences from unphysical reference states: Limits on size, flexibility, and character. 1730-1739 2003 24 Journal of Computational Chemistry 14 http://dx.doi.org/10.1002/jcc.10304 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#OostenbrinkG03 2004-09-07 Improved precision and efficiency of free energy calculations for small systems using lambda-scaled atomic masses and separating conformational and transformational sampling. 1383-1389 2003 24 Journal of Computational Chemistry 12 http://dx.doi.org/10.1002/jcc.10221 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#CarlssonN03 2004-09-07 Prediction of protein secondary structure content by artificial neural network. 727-731 2003 24 Journal of Computational Chemistry 6 http://dx.doi.org/10.1002/jcc.10222 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#CaiLC03 2004-09-07 Parallelization of four-component calculations. II. Symmetry-driven parallelization of the 4-Spinor CCSD algorithm. 754-759 2003 24 Journal of Computational Chemistry 6 http://dx.doi.org/10.1002/jcc.10215 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#PernpointnerV03 2004-12-07 A novel approach for designing simple point charge models for liquid water with three interaction sites. 1087-1096 2003 24 Journal of Computational Chemistry 9 http://dx.doi.org/10.1002/jcc.10235 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#GlattliDG03 2004-09-07 Packing optimization for automated generation of complex system's initial configurations for molecular dynamics and docking. 819-825 2003 24 Journal of Computational Chemistry 7 http://dx.doi.org/10.1002/jcc.10216 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#MartinezM03 2004-09-07 Powder pattern indexing using the weighted crosscorrelation and genetic algorithms. 1043-1051 2003 24 Journal of Computational Chemistry 9 http://dx.doi.org/10.1002/jcc.10253 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#HagemanWGB03 2004-09-07 Parallel stored-integral and semidirect Hartree-Fock and DFT methods with data compression. 154-160 2003 24 Journal of Computational Chemistry 2 http://dx.doi.org/10.1002/jcc.10152 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#MitinBWP03 2004-09-07 Theoretical studies on the gas-phase pyrolysis of 2-phenoxycarboxylic acids: An ONIOM approach. 963-972 2003 24 Journal of Computational Chemistry 8 http://dx.doi.org/10.1002/jcc.10265 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#XueKKL03 2004-09-07 A simple approach for improving the hybrid MMVB force field: Application to the photoisomerization of s-cis butadiene. 1357-1363 2003 24 Journal of Computational Chemistry 11 http://dx.doi.org/10.1002/jcc.10278 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#GaravelliROBBOR03 2004-09-07 Energy decomposition in molecular complexes: Implications for the treatment of polarization in molecular simulations. 1263-1275 2003 24 Journal of Computational Chemistry 10 http://dx.doi.org/10.1002/jcc.10260 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#CurutchetBHOL03 2004-09-07 Molecular caps for full quantum mechanical computation of peptide-water interaction energy. 1846-1852 2003 24 Journal of Computational Chemistry 15 http://dx.doi.org/10.1002/jcc.10346 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#ZhangCZ03 2004-09-07 An improvement of the resolution of the identity approximation for the formation of the Coulomb matrix. 1740-1747 2003 24 Journal of Computational Chemistry 14 http://dx.doi.org/10.1002/jcc.10318 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#Neese03 2006-06-19 Comparison of localization and delocalization indices obtained with Hartree-Fock and conventional correlated methods: Effect of Coulomb correlation. 1720-1729 2003 24 Journal of Computational Chemistry 14 http://dx.doi.org/10.1002/jcc.10435 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#WangMW03 2004-09-07 Direct hydroxide attack is a plausible mechanism for amidase antibody 43C9. 1371-1377 2003 24 Journal of Computational Chemistry 12 http://dx.doi.org/10.1002/jcc.10293 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#ChongBSKK03 2004-09-07 ICFF: A new method to incorporate implicit flexibility into an internal coordinate force field. 254-265 2003 24 Journal of Computational Chemistry 2 http://dx.doi.org/10.1002/jcc.10091 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#KatritchTA03 2004-09-07 Selective descriptor pruning for QSAR/QSPR studies using artificial neural networks. 891-897 2003 24 Journal of Computational Chemistry 7 http://dx.doi.org/10.1002/jcc.10148 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#TurnerCSM03 2004-09-07 Continuum and discrete calculation of fractional contributions to solvation free energy. 1610-1623 2003 24 Journal of Computational Chemistry 13 http://dx.doi.org/10.1002/jcc.10323 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#MorrealeGLO03 2004-09-07 Possible molecular hydrogen formation mediated by the radical cations of anthracene and pyrene. 1378-1382 2003 24 Journal of Computational Chemistry 12 http://dx.doi.org/10.1002/jcc.10290 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#HiramaIA03 2004-09-07 A computational study of interactions between acetic acid and water molecules. 939-947 2003 24 Journal of Computational Chemistry 8 http://dx.doi.org/10.1002/jcc.10178 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#YamabeT03 2004-09-07 Implementation of a general multireference configuration interaction procedure with analytic gradients in a semiempirical context using the graphical unitary group approach. 714-726 2003 24 Journal of Computational Chemistry 6 http://dx.doi.org/10.1002/jcc.10210 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#KoslowskiBT03 2004-09-07 Development of a multipopulation parallel genetic algorithm for structure solution from powder diffraction data. 1766-1774 2003 24 Journal of Computational Chemistry 14 http://dx.doi.org/10.1002/jcc.10326 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#HabershonHJ03 2004-09-07 Ab initio investigation on the reaction path and rate for the gas-phase reaction of HO + H2O H2O + OH. 1538-1548 2003 24 Journal of Computational Chemistry 13 http://dx.doi.org/10.1002/jcc.10327 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#UchimaruCTSS03 2004-09-07 Mechanistic insights into oxidosqualene cyclizations through homology modeling. 741-753 2003 24 Journal of Computational Chemistry 6 http://dx.doi.org/10.1002/jcc.10147 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#Schulz-GaschS03 2004-09-07 Hirshfeld partitioning of the electron density: Atomic dipoles and their relation with functional group properties. 463-470 2003 24 Journal of Computational Chemistry 4 http://dx.doi.org/10.1002/jcc.10241 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#ProftVPAG03 2004-09-21 Critical assessment of side-chain conformational space sampling procedures designed for quantifying the effect of side-chain environment. 1950-1961 2003 24 Journal of Computational Chemistry 15 http://dx.doi.org/10.1002/jcc.10334 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#GautierT03 2004-09-07 OPEP: A tool for the optimal partitioning of electric properties. 997-1008 2003 24 Journal of Computational Chemistry 8 http://dx.doi.org/10.1002/jcc.10236 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#AngyanCDHJM03 2004-09-07 Cool walking: A new Markov chain Monte Carlo sampling method. 68-76 2003 24 Journal of Computational Chemistry 1 http://dx.doi.org/10.1002/jcc.10181 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#BrownH03 2004-09-07 A practical and efficient method to calculate AIM localization and delocalization indices at post-HF levels of theory. 379-385 2003 24 Journal of Computational Chemistry 3 http://dx.doi.org/10.1002/jcc.10188 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#WangW03 2004-09-07 Statistical thermodynamics of internal rotation in a hindering potential of mean force obtained from computer simulations. 1172-1183 2003 24 Journal of Computational Chemistry 10 http://dx.doi.org/10.1002/jcc.10289 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#HnizdoFSD03 2004-09-07 Using PC clusters to evaluate the transferability of molecular mechanics force fields for proteins. 21-31 2003 24 Journal of Computational Chemistry 1 http://dx.doi.org/10.1002/jcc.10184 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#OkurSHS03 2004-09-07 A theoretical ab initio study on the H2NO + O3 reaction. 1321-1328 2003 24 Journal of Computational Chemistry 11 http://dx.doi.org/10.1002/jcc.10287 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#Peiro-GarciaRN03 2004-09-07 Hybrid QM/MM molecular dynamics simulations for an ionic SN2 reaction in the supercritical water: OH- + CH3Cl -> CH3OH + Cl-. 209-221 2003 24 Journal of Computational Chemistry 2 http://dx.doi.org/10.1002/jcc.10134 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#HoriTN03 2004-09-07 Development of polyphosphate parameters for use with the AMBER force field. 1016-1025 2003 24 Journal of Computational Chemistry 9 http://dx.doi.org/10.1002/jcc.10262 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#MeagherRC03 2004-09-07 Alcohols, ethers, carbohydrates, and related compounds. III. The 1, 2-dimethoxyethane system. 1490-1503 2003 24 Journal of Computational Chemistry 12 http://dx.doi.org/10.1002/jcc.10270 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#LiiCGA03 2004-09-28 Optimized Slater-type basis sets for the elements 1-118. 1142-1156 2003 24 Journal of Computational Chemistry 9 http://dx.doi.org/10.1002/jcc.10255 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#LentheB03 2004-09-07 Chemometric study of liquid water simulations. I. The parameters of the TIP4P model potential. 973-981 2003 24 Journal of Computational Chemistry 8 http://dx.doi.org/10.1002/jcc.10273 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#HernandesSL03 2004-09-07 Theoretical study concerning the reactivity of imine derivatives of polycyclic aromatic hydrocarbons. 601-608 2003 24 Journal of Computational Chemistry 5 http://dx.doi.org/10.1002/jcc.10197 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#Borosky03 2004-09-07 Comparative studies of quasi-relativistic density functional methods for the description of lanthanide and actinide complexes. 850-858 2003 24 Journal of Computational Chemistry 7 http://dx.doi.org/10.1002/jcc.10228 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#VetereMA03 2004-09-07 Ab initio study on the structures of fluorinated formates and hydrogen abstraction reaction with OH radical. 396-407 2003 24 Journal of Computational Chemistry 3 http://dx.doi.org/10.1002/jcc.10180 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#ChandraUSS03 2004-09-07 New analytic approximation to the standard molecular volume definition and its application to generalized born calculations - Erratum. 1821 2003 24 Journal of Computational Chemistry 14 http://dx.doi.org/10.1002/jcc.10367 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#LeeFSB03a 2004-09-07 Isomers of C20: An energy profile II. 1287-1290 2003 24 Journal of Computational Chemistry 11 http://dx.doi.org/10.1002/jcc.10292 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#Beran03 2004-09-07 Dual-level direct dynamics studies for the reactions of dimethyl ether with hydrogen atom and methyl radical. 593-600 2003 24 Journal of Computational Chemistry 5 http://dx.doi.org/10.1002/jcc.10219 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#WuLLHS03 2006-05-03 A point-charge force field for molecular mechanics simulations of proteins based on condensed-phase quantum mechanical calculations. 1999-2012 2003 24 Journal of Computational Chemistry 16 http://dx.doi.org/10.1002/jcc.10349 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#DuanWCLXZYCLLCWK03 2005-06-22 Boundary element solution of the linear Poisson-Boltzmann equation and a multipole method for the rapid calculation of forces on macromolecules in solution. 353-367 2003 24 Journal of Computational Chemistry 3 http://dx.doi.org/10.1002/jcc.10195 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#BordnerH03 2004-09-07 Gaussian-type function set without prolapse for the Dirac-Fock-Roothaan equation. 1823-1828 2003 24 Journal of Computational Chemistry 15 http://dx.doi.org/10.1002/jcc.10330 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#TatewakiW03 2004-09-07 Motifs in nucleic acids: Molecular mechanics restraints for base pairing and base stacking. 1-9 2003 24 Journal of Computational Chemistry 1 http://dx.doi.org/10.1002/jcc.10173 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#HarveyWTL03 2004-09-07 Transferable atom equivalent multicentered multipole expansion method. 512-529 2003 24 Journal of Computational Chemistry 4 http://dx.doi.org/10.1002/jcc.10240 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#WhiteheadBSR03 2004-09-07 Adsorption of organic substances on broken clay surfaces: A quantum chemical study. 1853-1863 2003 24 Journal of Computational Chemistry 15 http://dx.doi.org/10.1002/jcc.10342 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#AquinoTHGL03 2004-09-07 Hydrogen bonding in diols and binary diol-water systems investigated using DFT methods. II. Calculated infrared OH-stretch frequencies, force constants, and NMR chemical shifts correlate with hydrogen bond geometry and electron density topology. A reevaluation of geometrical criteria for hydrogen bonding. 1120-1131 2003 24 Journal of Computational Chemistry 9 http://dx.doi.org/10.1002/jcc.10256 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#Klein03 2004-09-07 Free energy of solvation from molecular dynamics simulations for low dielectric solvents. 1758-1765 2003 24 Journal of Computational Chemistry 14 http://dx.doi.org/10.1002/jcc.10294 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#GoncalvesS03 2004-09-07 Complete graph conjecture for inner-core electrons: Homogeneous index case. 1097-1109 2003 24 Journal of Computational Chemistry 9 http://dx.doi.org/10.1002/jcc.10277 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#Pogliani03 2004-11-03 A density functional study of the hydrogen-bond network within the HIV-1 protease catalytic site cleft. 1110-1119 2003 24 Journal of Computational Chemistry 9 http://dx.doi.org/10.1002/jcc.10176 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#SiroisPTTS03 2004-09-07 Polarized basis sets of Slater-type orbitals: H to Ne atoms. 859-868 2003 24 Journal of Computational Chemistry 7 http://dx.doi.org/10.1002/jcc.10227 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#EmaVRLRMP03 2004-09-07 Rigid-body dynamics in the isothermal-isobaric ensemble: A test on the accuracy and computational efficiency. 920-930 2003 24 Journal of Computational Chemistry 8 http://dx.doi.org/10.1002/jcc.10249 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#ShinodaM03 2004-09-07 Specific empirical free energy function for automated docking of carbohydrates to proteins. 1748-1757 2003 24 Journal of Computational Chemistry 14 http://dx.doi.org/10.1002/jcc.10288 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#LaederachR03 2004-09-07 Radial quadrature for multiexponential integrands. 732-740 2003 24 Journal of Computational Chemistry 6 http://dx.doi.org/10.1002/jcc.10211 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#GillC03 2004-09-07 Implementation of the finite field perturbation method in the CRYSTAL program for calculating the dielectric constant of periodic systems. 1305-1312 2003 24 Journal of Computational Chemistry 11 http://dx.doi.org/10.1002/jcc.10274 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#DarriganRMD03 2005-11-02 Inclusion of the ligand field contribution in a polarizable molecular mechanics: SIBFA-LF. 1963-1970 2003 24 Journal of Computational Chemistry 16 http://dx.doi.org/10.1002/jcc.10354 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#PiquemalWFDGG03 2004-09-07 Novel topological index F based on incidence matrix. 1812-1820 2003 24 Journal of Computational Chemistry 14 http://dx.doi.org/10.1002/jcc.10338 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#YangWHZ03 2004-09-07 Rational determination of charge distributions for free energy calculations. 409-415 2003 24 Journal of Computational Chemistry 4 http://dx.doi.org/10.1002/jcc.10207 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#Chipot03 2004-09-07 Molecular mechanics (MM3) calculations on lithium amide compounds. 319-327 2003 24 Journal of Computational Chemistry 3 http://dx.doi.org/10.1002/jcc.10161 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#YoshidaSACLA03 2005-06-15 Molecular mechanics (MM4) calculations on carbonyl compounds. I-IV - Erratum. 1283-1286 2003 24 Journal of Computational Chemistry 10 http://dx.doi.org/10.1002/jcc.1177 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#LangleyLA03 2004-09-07 Generalized born model with a simple smoothing function. 1691-1702 2003 24 Journal of Computational Chemistry 14 http://dx.doi.org/10.1002/jcc.10321 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#ImLB03 2004-09-07 Tork: Conformational analysis method for molecules and complexes. 1987-1998 2003 24 Journal of Computational Chemistry 16 http://dx.doi.org/10.1002/jcc.10325 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#ChangG03 2004-09-07 A box-counting-based algorithm for computing Shannon entropy in molecular dynamics simulations. 707-713 2003 24 Journal of Computational Chemistry 6 http://dx.doi.org/10.1002/jcc.10192 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#LorenzoM03 2004-09-07 Density functional investigation on electron-transfer catalysis of cycloreversion of cyclobutane: Radical anion mechanism. 340-344 2003 24 Journal of Computational Chemistry 3 http://dx.doi.org/10.1002/jcc.10177 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#QuZZZ03 2004-09-07 Thermally induced phase transition in helical comblike poly(-peptide)s: An atomistic simulation. 770-778 2003 24 Journal of Computational Chemistry 6 http://dx.doi.org/10.1002/jcc.10214 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#ZanuyALM03 2004-09-07 Alcohols, ethers, carbohydrates, and related compounds. I. The MM4 force field for simple compounds. 1447-1472 2003 24 Journal of Computational Chemistry 12 http://dx.doi.org/10.1002/jcc.10268 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#AllingerCLD03 2004-09-07 An improved method for nonbonded list generation: Rapid determination of near-neighbor pairs. 222-231 2003 24 Journal of Computational Chemistry 2 http://dx.doi.org/10.1002/jcc.10123 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#PetrellaABK03 2004-09-07 Performance of time-dependent density functional and Green functions methods for calculations of excitation energies in radicals and for Rydberg electronic states. 692-700 2003 24 Journal of Computational Chemistry 6 http://dx.doi.org/10.1002/jcc.10220 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#ZyubinM03 2004-09-07 Network visualization system for computational chemistry. 1678-1687 2003 24 Journal of Computational Chemistry 13 http://dx.doi.org/10.1002/jcc.10158 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#KozhinYL03 2004-09-07 A multicentered approach to integrated QM/QM calculations. Applications to multiply hydrogen bonded systems. 1563-1568 2003 24 Journal of Computational Chemistry 13 http://dx.doi.org/10.1002/jcc.10319 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#HopkinsT03 2004-09-07 Energies, structures, and electronic properties of molecules in solution with the C-PCM solvation model. 669-681 2003 24 Journal of Computational Chemistry 6 http://dx.doi.org/10.1002/jcc.10189 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#CossiRSB03 2004-09-07 Many-body effects on structure and dynamics of aqueous ionic solutions. 1232-1239 2003 24 Journal of Computational Chemistry 10 http://dx.doi.org/10.1002/jcc.10276 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#Loeffler03 2004-09-07 Systematic errors in DFT calculations of haloalkane heats of formation. 640-646 2003 24 Journal of Computational Chemistry 5 http://dx.doi.org/10.1002/jcc.10225 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#CloudS03 2004-09-07 A partition function algorithm for nucleic acid secondary structure including pseudoknots. 1664-1677 2003 24 Journal of Computational Chemistry 13 http://dx.doi.org/10.1002/jcc.10296 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#DirksP03 2004-09-07 Performance assessment of density-functional methods for study of charge-transfer complexes. 623-631 2003 24 Journal of Computational Chemistry 5 http://dx.doi.org/10.1002/jcc.10226 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#LiaoLS03 2004-09-07 Theoretical study of the internal elimination reactions of xanthate precursors. 2023-2031 2003 24 Journal of Computational Chemistry 16 http://dx.doi.org/10.1002/jcc.10358 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#ClaesFD03 2004-09-07 The intramolecular mechanism for the second proton transfer in triosephosphate isomerase (TIM): A QM/FE approach. 46-56 2003 24 Journal of Computational Chemistry 1 http://dx.doi.org/10.1002/jcc.10153 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#AlagonaGK03 2004-09-07 A QM-MM interface between CHARMM and TURBOMOLE: Implementation and application to systems in bulk phase and biologically active systems. 1240-1249 2003 24 Journal of Computational Chemistry 10 http://dx.doi.org/10.1002/jcc.10283 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#LofererLL03 2004-09-07 Molecular integrals over the gauge-including atomic orbitals. II. The Breit-Pauli interaction. 1874-1890 2003 24 Journal of Computational Chemistry 15 http://dx.doi.org/10.1002/jcc.10348 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#Ishida03 2004-09-07 Solvent viscosity dependence of the folding rate of a small protein: Distributed computing study. 1432-1436 2003 24 Journal of Computational Chemistry 12 http://dx.doi.org/10.1002/jcc.10297 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#ZagrovicP03 2004-09-07 A flexible nudged elastic band program for optimization of minimum energy pathways using ab initio electronic structure methods. 990-996 2003 24 Journal of Computational Chemistry 8 http://dx.doi.org/10.1002/jcc.10233 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#AlfonsoJ03 2004-09-07 Localized basis orbitals: Minimization of 2-electron integrals array and orthonormality of basis set. 1132-1141 2003 24 Journal of Computational Chemistry 9 http://dx.doi.org/10.1002/jcc.10218 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#AnikinBFGL03 2004-09-07 Constructing irregular surfaces to enclose macromolecular complexes for mesoscale modeling using the discrete surface charge optimization (DISCO) algorithm. 2063-2074 2003 24 Journal of Computational Chemistry 16 http://dx.doi.org/10.1002/jcc.10337 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#ZhangBS03 2004-09-07 Electron probability distribution in AIM and ELF basins. 496-504 2003 24 Journal of Computational Chemistry 4 http://dx.doi.org/10.1002/jcc.10242 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#ChamorroFS03 2004-09-07 Structures and energies of D-galactose and galabiose conformers as calculated by ab initio and semiempirical methods. 806-818 2003 24 Journal of Computational Chemistry 7 http://dx.doi.org/10.1002/jcc.10223 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#Rahal-SekkalSKB03 2004-09-07 Theoretical approach to the mechanism of reactions between halogen atoms and unsaturated hydrocarbons: The Cl + propene reaction. 2044-2062 2003 24 Journal of Computational Chemistry 16 http://dx.doi.org/10.1002/jcc.10360 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#BranaS03 2004-09-07 FDS: Flexible ligand and receptor docking with a continuum solvent model and soft-core energy function. 1637-1656 2003 24 Journal of Computational Chemistry 13 http://dx.doi.org/10.1002/jcc.10295 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#TaylorJE03 2004-09-07 Direct INDO/SCI method for excited state calculations. 1782-1788 2003 24 Journal of Computational Chemistry 14 http://dx.doi.org/10.1002/jcc.10336 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#TomlinsonY03 2004-09-07 Theoretical study of the interaction between a high-valent manganese porphyrin oxyl-(hydroxo)-Mn(IV)-TMPyP and double-stranded DNA. 797-805 2003 24 Journal of Computational Chemistry 7 http://dx.doi.org/10.1002/jcc.10212 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#ArnaudZM03 2004-09-07 Extended method for adiabatic mode reordering. 386-395 2003 24 Journal of Computational Chemistry 3 http://dx.doi.org/10.1002/jcc.10185 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#TautermannVLKL03 2004-12-07 High-dimensional model representations generated from low order terms - lp-RS-HDMR. 647-656 2003 24 Journal of Computational Chemistry 5 http://dx.doi.org/10.1002/jcc.10232 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#LiARWGD03 2004-09-07 An extensible and systematic force field, ESFF, for molecular modeling of organic, inorganic, and organometallic systems. 1059-1076 2003 24 Journal of Computational Chemistry 9 http://dx.doi.org/10.1002/jcc.10171 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#ShiYYFT03 2004-09-07 On the kinematics of protein folding. 1364-1370 2003 24 Journal of Computational Chemistry 11 http://dx.doi.org/10.1002/jcc.10245 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#CahillCC03 2004-09-07 Deriving effective mesoscale potentials from atomistic simulations. 1624-1636 2003 24 Journal of Computational Chemistry 13 http://dx.doi.org/10.1002/jcc.10307 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#ReithPM03 2004-09-07 An improved algorithm to locate critical points in a 3D scalar field as implemented in the program MORPHY. 437-442 2003 24 Journal of Computational Chemistry 4 http://dx.doi.org/10.1002/jcc.10203 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#MalcolmP03 2004-09-07 Regional self-interaction correction of density functional theory. 1592-1598 2003 24 Journal of Computational Chemistry 13 http://dx.doi.org/10.1002/jcc.10279 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#TsunedaKH03 2004-09-07 A dynamic mean field theory for dissipative interacting many-electron systems: Markovian formalism and its implementation. 2083-2092 2003 24 Journal of Computational Chemistry 16 http://dx.doi.org/10.1002/jcc.10370 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#YokojimaCXY03 2004-09-07 Computational study of epoxy-amine reactions. 244-253 2003 24 Journal of Computational Chemistry 2 http://dx.doi.org/10.1002/jcc.10138 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#OkumotoY03 2004-09-07 Solvent effects on glycine. I. A supermolecule modeling of tautomerization via intramolecular proton transfer. 1789-1802 2003 24 Journal of Computational Chemistry 14 http://dx.doi.org/10.1002/jcc.10341 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#BaltaA03 2004-09-07 Ab initio quality one-electron properties of large molecules: Development and testing of molecular tailoring approach. 484-495 2003 24 Journal of Computational Chemistry 4 http://dx.doi.org/10.1002/jcc.10206 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#BabuG03 2004-09-07 Prediction of beta-sheet topology and disulfide bridges in polypeptides. 191-208 2003 24 Journal of Computational Chemistry 2 http://dx.doi.org/10.1002/jcc.10167 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#KlepeisF03 2004-09-07 Electrostatic component of solvation: Comparison of SCRF continuum models. 284-297 2003 24 Journal of Computational Chemistry 3 http://dx.doi.org/10.1002/jcc.10143 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#CurutchetCTRROL03 2004-09-07 Parameterization of charge model 3 for AM1, PM3, BLYP, and B3LYP. 1291-1304 2003 24 Journal of Computational Chemistry 11 http://dx.doi.org/10.1002/jcc.10244 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#ThompsonCT03 2005-11-16 Vertical spectrum of the C2H2+ system. An open shell (SC)2-CAS-SDCI study. 609-617 2003 24 Journal of Computational Chemistry 5 http://dx.doi.org/10.1002/jcc.10183 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#Pitarch-RuizSM03 2004-09-07 An ab initio study of microsolvation of LiF in water: Structures and properties of LiF-Wn, n = 1-9 complexes. 1336-1347 2003 24 Journal of Computational Chemistry 11 http://dx.doi.org/10.1002/jcc.10285 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#UpadhyayM03 2004-09-07 Chemical structures from the analysis of domain-averaged Fermi holes: Multiple metalmetal bonding in transition metal compounds. 1829-1838 2003 24 Journal of Computational Chemistry 15 http://dx.doi.org/10.1002/jcc.10322 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#PonecYC03 2004-09-07 Alcohols, ethers, carbohydrates, and related compounds. II. The anomeric effect. 1473-1489 2003 24 Journal of Computational Chemistry 12 http://dx.doi.org/10.1002/jcc.10269 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#LiiCDA03 2004-09-07 Inverse Monte Carlo procedure for conformation determination of macromolecules. 876-890 2003 24 Journal of Computational Chemistry 7 http://dx.doi.org/10.1002/jcc.10246 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#BatheR03 2004-09-07 Novel topological index for research on structure-property relationships of complex organic compounds. 842-849 2003 24 Journal of Computational Chemistry 7 http://dx.doi.org/10.1002/jcc.10237 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#JiangLHF03 2004-09-07 Low- and high-spin iron (II) complexes studied by effective crystal field method combined with molecular mechanics. 1703-1719 2003 24 Journal of Computational Chemistry 14 http://dx.doi.org/10.1002/jcc.10300 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#DarkhovskiiPT03 2004-09-07 Structural and dynamical properties of methane clathrate hydrates. 1569-1581 2003 24 Journal of Computational Chemistry 13 http://dx.doi.org/10.1002/jcc.10303 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#EnglishM03 2004-09-07 About the calculation of exchange coupling constants in polynuclear transition metal complexes. 982-989 2003 24 Journal of Computational Chemistry 8 http://dx.doi.org/10.1002/jcc.10257 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#RuizRCAA03 2004-09-07 Stochastic proximity embedding. 1215-1221 2003 24 Journal of Computational Chemistry 10 http://dx.doi.org/10.1002/jcc.10234 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#Agrafiotis03 2004-09-07 Ab initio quality properties for macromolecules using the ADMA approach. 1980-1986 2003 24 Journal of Computational Chemistry 16 http://dx.doi.org/10.1002/jcc.10340 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#ExnerM03 2004-09-07 STO and GTO field-induced polarization functions for H to Kr. 1582-1591 2003 24 Journal of Computational Chemistry 13 http://dx.doi.org/10.1002/jcc.10310 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#ChongGB03 2004-09-07 Determination of atomic valence indices from population analyses at correlated level. 1902-1909 2003 24 Journal of Computational Chemistry 15 http://dx.doi.org/10.1002/jcc.10368 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#BochicchioLT03 2004-09-07 Binding of proteins to the minor groove of DNA: What are the structural and energetic determinants for kinking a basepair step?. 682-691 2003 24 Journal of Computational Chemistry 6 http://dx.doi.org/10.1002/jcc.10200 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#BoschCP03 2004-09-07 Fast approximate methods for calculating nucleic acid base pair interaction energies. 57-67 2003 24 Journal of Computational Chemistry 1 http://dx.doi.org/10.1002/jcc.10150 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#ShererYC03 2004-09-07 A comparison of the mechanism for the reductive half-reaction between pea seedling and other copper amine oxidases (CAOs). 1599-1609 2003 24 Journal of Computational Chemistry 13 http://dx.doi.org/10.1002/jcc.10282 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#PrabhakarS03 2004-09-07 Multireference perturbation theory with optimized partitioning. II. Applications to molecular systems. 1390-1400 2003 24 Journal of Computational Chemistry 12 http://dx.doi.org/10.1002/jcc.10311 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#WitekNH03 2004-09-07 New analytic approximation to the standard molecular volume definition and its application to generalized Born calculations. 1348-1356 2003 24 Journal of Computational Chemistry 11 http://dx.doi.org/10.1002/jcc.10272 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#LeeFSB03 2004-09-07 An ab initio force field for the cofactors of bacterial photosynthesis. 129-142 2003 24 Journal of Computational Chemistry 2 http://dx.doi.org/10.1002/jcc.10198 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#CeccarelliPM03 2004-09-07 Implementation of an adaptive umbrella sampling method for the calculation of multidimensional potential of mean force of chemical reactions in solution. 1775-1781 2003 24 Journal of Computational Chemistry 14 http://dx.doi.org/10.1002/jcc.10315 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#RajamaniNG03 2004-09-07 Adaptive integration of molecular dynamics. 1921-1929 2003 24 Journal of Computational Chemistry 15 http://dx.doi.org/10.1002/jcc.10335 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#HorenkoW03 2004-09-07 Sparse matrix multiplications for linear scaling electronic structure calculations in an atom-centered basis set using multiatom blocks. 618-622 2003 24 Journal of Computational Chemistry 5 http://dx.doi.org/10.1002/jcc.10224 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#SaravananSBRH03 2004-09-07 Ground and excited state CASPT2 geometry optimizations of small organic molecules. 298-309 2003 24 Journal of Computational Chemistry 3 http://dx.doi.org/10.1002/jcc.10145 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#PageO03 2004-09-07 Coordination number of zinc ions in the phosphotriesterase active site by molecular dynamics and quantum mechanics. 368-378 2003 24 Journal of Computational Chemistry 3 http://dx.doi.org/10.1002/jcc.10217 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#KocaZRO03 2004-09-07 Theoretical studies on the molecular dependence of bond dissociation after core excitations II: CH3CO(CH2)nCN, n = 0-3. 1329-1335 2003 24 Journal of Computational Chemistry 11 http://dx.doi.org/10.1002/jcc.10284 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#TakahashiJMSI03 2004-09-07 Efficient evaluation of the effective dielectric function of a macromolecule in aqueous solution. 1936-1949 2003 24 Journal of Computational Chemistry 15 http://dx.doi.org/10.1002/jcc.10317 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#HaberthurMWC03 2004-09-07 Concerning the reaction between singlet nitrenium ions and water: A computational investigation on competitive reaction paths. 547-564 2003 24 Journal of Computational Chemistry 5 http://dx.doi.org/10.1002/jcc.10182 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#FacchiniG03 2004-09-07 Chemical information from the source function. 422-436 2003 24 Journal of Computational Chemistry 4 http://dx.doi.org/10.1002/jcc.10205 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#GattiCB03 2004-09-07 nMoldyn: A program package for a neutron scattering oriented analysis of molecular dynamics simulations. 657-667 2003 24 Journal of Computational Chemistry 5 http://dx.doi.org/10.1002/jcc.10243 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#RogMHK03 2004-09-07 Peptide models. XXXIII. Extrapolation of low-level Hartree-Fock data of peptide conformation to large basis set SCF, MP2, DFT, and CCSD(T) results. The Ramachandran surface of alanine dipeptide computed at various levels of theory. 1026-1042 2003 24 Journal of Computational Chemistry 9 http://dx.doi.org/10.1002/jcc.10267 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#PerczelFJTC03 2004-09-07 An environmental pseudopotential approach to molecular interactions: Implementation in MOLPRO. 2075-2082 2003 24 Journal of Computational Chemistry 16 http://dx.doi.org/10.1002/jcc.10353 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#ValderramaW03 2004-09-07 Correlation method for variance reduction of Monte Carlo integration in RS-HDMR. 277-283 2003 24 Journal of Computational Chemistry 3 http://dx.doi.org/10.1002/jcc.10172 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#LiRWG03 2004-09-07 A MCSCF method for ground and excited states based on full optimizations of successive Jacobi rotations. 1250-1262 2003 24 Journal of Computational Chemistry 10 http://dx.doi.org/10.1002/jcc.10291 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#IvanicR03 2004-09-07 Exploring potential energy surfaces for chemical reactions: An overview of some practical methods. 1514-1527 2003 24 Journal of Computational Chemistry 12 http://dx.doi.org/10.1002/jcc.10231 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#Schlegel03 2004-09-07 Molecular mechanics force field parameterization of the fluorescent probe rhodamine 6G using automated frequency matching. 632-639 2003 24 Journal of Computational Chemistry 5 http://dx.doi.org/10.1002/jcc.10190 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#VaianaSWSS03 2004-09-07 Foreword. 408 2003 24 Journal of Computational Chemistry 4 http://dx.doi.org/10.1002/jcc.1176 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#Gadre03 2004-09-07 Development of new pseudopotential methods: Improved model core potentials for the first-row transition metals. 1009-1015 2003 24 Journal of Computational Chemistry 9 http://dx.doi.org/10.1002/jcc.10251 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#LovalloK03 2004-09-07 Molecular mechanics force-field development for amino acid zwitterions. 111-128 2003 24 Journal of Computational Chemistry 1 http://dx.doi.org/10.1002/jcc.10174 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#KirschnerLB03 2004-09-07 Performance of hybrid methods for large-scale unconstrained optimization as applied to models of proteins. 1222-1231 2003 24 Journal of Computational Chemistry 10 http://dx.doi.org/10.1002/jcc.10275 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#DasMN03 2004-09-07 Methyl dynamics in crystalline amino acids: MD and NMR. 1052-1058 2003 24 Journal of Computational Chemistry 9 http://dx.doi.org/10.1002/jcc.10263 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc24.html#ChatfieldADW03 2005-11-02 ^.₃SH reaction: Support for an addition-elimination mechanism from ab initio calculations. 612-618 2005 26 Journal of Computational Chemistry 6 http://dx.doi.org/10.1002/jcc.20195 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#Muino05 2005-11-02 Simulations of the active transport of a neutral solute based on a kinase-channel-phosphatase topology. 201-213 2005 26 Journal of Computational Chemistry 3 http://dx.doi.org/10.1002/jcc.20160 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#FiatyCPCM05 2005-11-02 Reduced-size polarized basis sets for calculations of molecular electric properties. II. Simulation of the Raman spectra. 154-159 2005 26 Journal of Computational Chemistry 2 http://dx.doi.org/10.1002/jcc.20158 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#OakesBBS05 2005-11-02 The relationship between adsorption energies of methyl on metals and the metallic electronic properties: A first-principles DFT study. 871-878 2005 26 Journal of Computational Chemistry 9 http://dx.doi.org/10.1002/jcc.20225 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#WangLXLN05 2005-11-02 Vibrational computations beyond the harmonic approximation: Performances of the B3LYP density functional for semirigid molecules. 384-388 2005 26 Journal of Computational Chemistry 4 http://dx.doi.org/10.1002/jcc.20170 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#CarbonniereLPRB05 2005-11-02 First-principle studies of intermolecular and intramolecular catalysis of protonated cocaine. 980-986 2005 26 Journal of Computational Chemistry 10 http://dx.doi.org/10.1002/jcc.20241 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#ZhanDSHTSL05 2005-11-02 Fluctuating charge normal modes: An algorithm for implementing molecular dynamics simulations with polarizable potentials. 699-707 2005 26 Journal of Computational Chemistry 7 http://dx.doi.org/10.1002/jcc.20212 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#OlanoR05 2005-11-02 3D-Epitope-Explorer (3DEX): Localization of conformational epitopes within three-dimensional structures of proteins. 879-887 2005 26 Journal of Computational Chemistry 9 http://dx.doi.org/10.1002/jcc.20229 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#SchreiberHBD05 2005-11-02 ₂_n₂_n<i>n</i>= 1-8). 411-435 2005 26 Journal of Computational Chemistry 5 http://dx.doi.org/10.1002/jcc.20171 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#KasalovaS05 2005-11-02 Agreement between experiment and hybrid DFT calculations for OH bond dissociation enthalpies in manganese complexes. 661-667 2005 26 Journal of Computational Chemistry 7 http://dx.doi.org/10.1002/jcc.20206 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#LundbergS05 2005-11-02 Strategies for increasing the efficiency of a genetic algorithm for the structural optimization of nanoalloy clusters. 1069-1078 2005 26 Journal of Computational Chemistry 10 http://dx.doi.org/10.1002/jcc.20247 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#LloydJS05 2005-11-02 Molecular dynamics simulation of clustered DNA damage sites containing 8-oxoguanine and abasic site. 788-798 2005 26 Journal of Computational Chemistry 8 http://dx.doi.org/10.1002/jcc.20184 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#FujimotoPNOKSM05 2005-11-02 Comparative performance of MM3(92) and two TINKERTM MM3 versions for the modeling of carbohydrates. 471-483 2005 26 Journal of Computational Chemistry 5 http://dx.doi.org/10.1002/jcc.20185 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#Stortz05 2005-11-02 Charge donation to and dearomatization of benzene attending complexation: DFT estimates of binding energies of TpMXO(L) with benzene, for Tp = hydridotris(pyrazolyl) borate, MXO = MoNO, ReCO, and WNO, and L = ammonia, N-methylimidazole, pyridine, phosphine, methyl isocyanide, and carbon monoxide. 194-200 2005 26 Journal of Computational Chemistry 2 http://dx.doi.org/10.1002/jcc.20155 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#HarmanT05 2005-11-02 Role of the surface heterogeneity in adsorption of hydrogen ions on metal oxides: Theory and simulations. 1079-1088 2005 26 Journal of Computational Chemistry 10 http://dx.doi.org/10.1002/jcc.20249 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#ZarzyckiSC05 2005-11-02 Erratum to "Solvation forces on biomolecular structures: A comparison of explicit solvent and Poisson-Boltzmann models, " by Jason Wagoner and Nathan A. Baker. 863- 2005 26 Journal of Computational Chemistry 8 http://dx.doi.org/10.1002/jcc.20227 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#WagonerB05 2005-11-02 Characterization of molecular orbitals by counting nodal regions. 325-333 2005 26 Journal of Computational Chemistry 4 http://dx.doi.org/10.1002/jcc.20169 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#HatanoYT05 2005-11-02 A CSOV study of the difference between HF and DFT intermolecular interaction energy values: The importance of the charge transfer contribution. 1052-1062 2005 26 Journal of Computational Chemistry 10 http://dx.doi.org/10.1002/jcc.20242 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#PiquemalMPG05 2005-11-02 New AMBER force field parameters of heme iron for cytochrome P450s determined by quantum chemical calculations of simplified models. 818-826 2005 26 Journal of Computational Chemistry 8 http://dx.doi.org/10.1002/jcc.20221 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#OdaYH05 2005-11-02 All-electron density functional calculation on insulin with quasi-canonical localized orbitals. 987-993 2005 26 Journal of Computational Chemistry 10 http://dx.doi.org/10.1002/jcc.20239 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#InabaTNKS05 2005-11-02 An improved nucleic acid parameter set for the GROMOS force field. 725-737 2005 26 Journal of Computational Chemistry 7 http://dx.doi.org/10.1002/jcc.20193 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#SoaresHKKLLOG05 2005-11-02 XMVB: A program for ab initio nonorthogonal valence bond computations. 514-521 2005 26 Journal of Computational Chemistry 5 http://dx.doi.org/10.1002/jcc.20187 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#SongMZW05 2005-11-02 Efficient charge assignment and back interpolation in multigrid methods for molecular dynamics. 957-967 2005 26 Journal of Computational Chemistry 9 http://dx.doi.org/10.1002/jcc.20220 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#BanerjeeB05 2005-11-02 Double proton transfer and one-electron oxidation behavior in double H-bonded glycinamide-glycine complex in the gas phase. 552-560 2005 26 Journal of Computational Chemistry 6 http://dx.doi.org/10.1002/jcc.20191 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#LiB05 2005-11-02 A quantum chemical method for rapid optimization of protein structures. 160-168 2005 26 Journal of Computational Chemistry 2 http://dx.doi.org/10.1002/jcc.20154 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#WadaS05 2005-11-03 Improved greedy algorithm for protein structure reconstruction. 506-513 2005 26 Journal of Computational Chemistry 5 http://dx.doi.org/10.1002/jcc.20181 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#TufferyGD05 2005-11-02 Quantum chemical modeling of CO oxidation by the active site of molybdenum CO dehydrogenase. 888-898 2005 26 Journal of Computational Chemistry 9 http://dx.doi.org/10.1002/jcc.20230 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#SiegbahnS05 2005-11-02 DFT study and Monte Carlo simulation on proton transfers of 2-amino-2-oxazoline, 2-amino-2-thiazoline, and 2-amino-2-imidazoline in the gas phase and in water. 994-1005 2005 26 Journal of Computational Chemistry 10 http://dx.doi.org/10.1002/jcc.20243 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#XueKGXY05 2005-11-02 ₃OCl with Cl atom. 642-650 2005 26 Journal of Computational Chemistry 6 http://dx.doi.org/10.1002/jcc.20202 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#HeLLS05 2005-11-02 Theoretical calculations of homoconjugation equilibrium constants in systems modeling acid-base interactions in side chains of biomolecules using the potential of mean force. 235-242 2005 26 Journal of Computational Chemistry 3 http://dx.doi.org/10.1002/jcc.20166 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#MakowskaMLC05 2005-11-02 Accuracy and efficiency of atomic basis set methods versus plane wave calculations with ultrasoft pseudopotentials for DNA base molecules. 599-605 2005 26 Journal of Computational Chemistry 6 http://dx.doi.org/10.1002/jcc.20196 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#PulaySMB05 2005-11-02 Heuristic molecular lipophilicity potential (HMLP): A 2D-QSAR study to LADH of molecular family pyrazole and derivatives. 461-470 2005 26 Journal of Computational Chemistry 5 http://dx.doi.org/10.1002/jcc.20174 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#DuMC05 2005-11-02 <i>ab initio</i>and force field study of the gas and solid phases. 169-174 2005 26 Journal of Computational Chemistry 2 http://dx.doi.org/10.1002/jcc.20153 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#SunK05 2005-11-02 Junmei Wang, Romain M. Wolf, James W. Caldwell, Peter A. Kollman, and David A. Case, "Development and testing of a general amber force field" Journal of Computational Chemistry(2004) 25(9) 1157-1174. 114- 2005 26 Journal of Computational Chemistry 1 http://dx.doi.org/10.1002/jcc.20145 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#WangWCKC05 2005-11-02 Zori 1.0: A parallel quantum Monte Carlo electronic structure package. 856-862 2005 26 Journal of Computational Chemistry 8 http://dx.doi.org/10.1002/jcc.20215 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#Aspuru-GuzikSAPGOSDL05 2005-11-02 The MPSim-Dock hierarchical docking algorithm: Application to the eight trypsin inhibitor cocrystals. 48-71 2005 26 Journal of Computational Chemistry 1 http://dx.doi.org/10.1002/jcc.20118 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#ChoWVKFMG05 2005-11-02 _n_n<i>n</i>= 2-4) clusters. 226-234 2005 26 Journal of Computational Chemistry 3 http://dx.doi.org/10.1002/jcc.20146 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#QuB05 2005-11-03 A new analytical method for computing solvent-accessible surface area of macromolecules and its gradients. 334-343 2005 26 Journal of Computational Chemistry 4 http://dx.doi.org/10.1002/jcc.20125 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#HayryanHSHP05 2005-11-02 A simple method for faster nonbonded force evaluations. 691-698 2005 26 Journal of Computational Chemistry 7 http://dx.doi.org/10.1002/jcc.20211 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#ShenF05 2005-11-02 <i>Ab initio</i>crystal structure prediction - I. Rigid molecules. 304-324 2005 26 Journal of Computational Chemistry 3 http://dx.doi.org/10.1002/jcc.20165 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#KaramertzanisP05 2005-11-02 DommiMOE: An implementation of ligand field molecular mechanics in the molecular operating environment. 123-130 2005 26 Journal of Computational Chemistry 2 http://dx.doi.org/10.1002/jcc.20137 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#DeethFW05 2005-11-02 Stereodynamics of bond rotation in tertiary 1-naphthoic acid amides: A computational study. 365-373 2005 26 Journal of Computational Chemistry 4 http://dx.doi.org/10.1002/jcc.20172 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#CampomanesRLS05 2005-11-02 <i>Ab initio</i>quantum mechanical study of the binding energies of human estrogen receptor with its ligands: An application of fragment molecular orbital method. 1-10 2005 26 Journal of Computational Chemistry 1 http://dx.doi.org/10.1002/jcc.20130 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#FukuzawaKUNKN05 2005-11-02 New parallel software (P_Anhar) for anharmonic vibrational calculations: Application to (CH3Li)2. 743-754 2005 26 Journal of Computational Chemistry 7 http://dx.doi.org/10.1002/jcc.20204 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#GohaudBDP05 2005-11-02 Magic number silicon dioxide-based clusters: Laser ablation-mass spectrometric and density functional theory studies. 584-598 2005 26 Journal of Computational Chemistry 6 http://dx.doi.org/10.1002/jcc.20194 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#KongZWWXZLFLZ05 2005-11-02 Incorporating the effect of ionic strength in free energy calculations using explicit ions. 115-122 2005 26 Journal of Computational Chemistry 2 http://dx.doi.org/10.1002/jcc.20156 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#DonniniMJV05 2005-11-02 Theoretical study and rate constant calculation for the reactions of SH (SD) with Cl2, Br2, and BrCl. 184-193 2005 26 Journal of Computational Chemistry 2 http://dx.doi.org/10.1002/jcc.20159 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#WangLLS05 2005-11-02 OOPSE: An object-oriented parallel simulation engine for molecular dynamics. 252-271 2005 26 Journal of Computational Chemistry 3 http://dx.doi.org/10.1002/jcc.20161 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#MeinekeVLFG05 2005-11-02 Theoretical studies on the electronic and optical properties of two new alternating fluorene/carbazole copolymers. 969-979 2005 26 Journal of Computational Chemistry 10 http://dx.doi.org/10.1002/jcc.20231 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#YangFR05 2005-11-02 ₄₆. 436-442 2005 26 Journal of Computational Chemistry 5 http://dx.doi.org/10.1002/jcc.20183 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#TamaokiYN05 2005-11-02 Hydration process as an activation of trans- and cisplatin complexes in anticancer treatment. DFT and ab initio computational study of thermodynamic and kinetic parameters. 907-914 2005 26 Journal of Computational Chemistry 9 http://dx.doi.org/10.1002/jcc.20228 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#BurdaZL05 2005-11-02 Newly developed basis sets for density functional calculations. 175-184 2005 26 Journal of Computational Chemistry 2 http://dx.doi.org/10.1002/jcc.20144 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#ChiodoRS05 2005-11-02 Development of a multipoint model for sulfur in proteins: A new parametrization scheme to reproduce high-level ab initio interaction energies. 283-293 2005 26 Journal of Computational Chemistry 3 http://dx.doi.org/10.1002/jcc.20163 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#WennmohsS05 2005-11-02 Evolutionary method for the assembly of rigid protein fragments. 131-141 2005 26 Journal of Computational Chemistry 2 http://dx.doi.org/10.1002/jcc.20150 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#SanchoPRR05 2005-11-02 MoCalc: A new graphical user interface for molecular calculations. 142-144 2005 26 Journal of Computational Chemistry 2 http://dx.doi.org/10.1002/jcc.20151 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#DepizzolPSG05 2005-11-02 Two-electron integrations in the Quantum Theory of Atoms in Molecules with correlated wave functions. 344-351 2005 26 Journal of Computational Chemistry 4 http://dx.doi.org/10.1002/jcc.20173 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#PendasFB05 2005-11-02 Parallelization of MRCI based on hole-particle symmetry. 88-96 2005 26 Journal of Computational Chemistry 1 http://dx.doi.org/10.1002/jcc.20148 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#SuoZWWHL05 2005-11-02 An accurate relativistic universal Gaussian basis set for hydrogen through Nobelium without variational prolapse and to be used with both uniform sphere and Gaussian nucleus models. 932-940 2005 26 Journal of Computational Chemistry 9 http://dx.doi.org/10.1002/jcc.20223 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#HaidukeMS05 2005-11-02 An unbiased population-based search for the geometry optimization of Lennard-Jones clusters: 2 leq N leq 372. 899-906 2005 26 Journal of Computational Chemistry 9 http://dx.doi.org/10.1002/jcc.20226 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#Pullan05 2005-11-02 Electrostatic energies and forces computed without explicit interparticle interactions: A linear time complexity formulation. 755-787 2005 26 Journal of Computational Chemistry 8 http://dx.doi.org/10.1002/jcc.20197 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#PetrellaK05 2005-11-02 Transferability of parameters of strictly local geminals' wave function and possibility of sequential derivation of molecular mechanics. 491-505 2005 26 Journal of Computational Chemistry 5 http://dx.doi.org/10.1002/jcc.20188 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#TokmachevT05 2005-11-02 Empirical force-field assessment: The interplay between backbone torsions and noncovalent term scaling. 682-690 2005 26 Journal of Computational Chemistry 7 http://dx.doi.org/10.1002/jcc.20208 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#SorinP05 2005-11-02 ₆₀₂₆₀₂_N, and their anions. 803-806 2005 26 Journal of Computational Chemistry 8 http://dx.doi.org/10.1002/jcc.20214 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#Owens05 2005-11-02 Attaining exponential convergence for the flux error with second- and fourth-order accurate finite-difference equations. I. Presentation of the basic concept and application to a pure diffusion system. 619-632 2005 26 Journal of Computational Chemistry 6 http://dx.doi.org/10.1002/jcc.20200 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#Rudolph05 2005-11-02 Electronic structure study of the initiation routes of the dimethyl sulfide oxidation by OH. 569-583 2005 26 Journal of Computational Chemistry 6 http://dx.doi.org/10.1002/jcc.20190 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#Gonzalez-GarciaGL05 2005-11-02 Method and algorithm of obtaining the molecular intrinsic characteristic contours (MICCs) of organic molecules. 35-47 2005 26 Journal of Computational Chemistry 1 http://dx.doi.org/10.1002/jcc.20140 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#YangGZZ05 2005-11-02 Method for computing protein binding affinity. 243-251 2005 26 Journal of Computational Chemistry 3 http://dx.doi.org/10.1002/jcc.20167 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#KarneyFB05 2005-11-02 ₂₆. 716-724 2005 26 Journal of Computational Chemistry 7 http://dx.doi.org/10.1002/jcc.20209 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#LiivatAT05 2005-11-02 ₃₂₄] by methyl thiolate anion. 865-870 2005 26 Journal of Computational Chemistry 9 http://dx.doi.org/10.1002/jcc.20224 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#Dobrogorskaia-MereauN05 2005-11-02 Quantum vs. classical models of the nitro group for proton chemical shift calculations and conformational analysis. 389-398 2005 26 Journal of Computational Chemistry 4 http://dx.doi.org/10.1002/jcc.20177 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#MobliA05 2005-11-02 <i>in silico</i>protein synthesis. 1063-1068 2005 26 Journal of Computational Chemistry 10 http://dx.doi.org/10.1002/jcc.20237 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#ParsonsHRTS05 2005-11-02 A sparse algorithm for the evaluation of the local energy in quantum Monte Carlo. 708-715 2005 26 Journal of Computational Chemistry 7 http://dx.doi.org/10.1002/jcc.20205 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#Aspuru-GuzikSAL05 2005-11-02 Incorporating hidden Markov models for identifying protein kinase-specific phosphorylation sites. 1032-1041 2005 26 Journal of Computational Chemistry 10 http://dx.doi.org/10.1002/jcc.20235 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#HuangLTWHTH05 2005-11-02 Continuous medium theory for nonequilibrium solvation: III. Solvation shift by monopole approximation and multipole expansion in spherical cavity. 399-409 2005 26 Journal of Computational Chemistry 4 http://dx.doi.org/10.1002/jcc.20178 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#ZhuFLGM05 2005-11-02 ₂peroxy radicals. 836-845 2005 26 Journal of Computational Chemistry 8 http://dx.doi.org/10.1002/jcc.20216 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#Dibble05 2005-11-02 A scalable parallel Monte Carlo method for free energy simulations of molecular systems. 72-77 2005 26 Journal of Computational Chemistry 1 http://dx.doi.org/10.1002/jcc.20143 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#KhanKC05 2005-11-02 An efficient molecular docking using conformational space annealing. 78-87 2005 26 Journal of Computational Chemistry 1 http://dx.doi.org/10.1002/jcc.20147 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#LeeCKL05 2005-11-02 Reduced-size polarized basis sets for calculations of molecular electric properties. I. The basis set generation. 145-153 2005 26 Journal of Computational Chemistry 2 http://dx.doi.org/10.1002/jcc.20149 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#BenkovaSOB05 2005-11-02 Charge distribution in the water molecule - A comparison of methods. 97-105 2005 26 Journal of Computational Chemistry 1 http://dx.doi.org/10.1002/jcc.20157 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#MartinZ05 2006-09-29 Maximal probability domains in linear molecules. 455-460 2005 26 Journal of Computational Chemistry 5 http://dx.doi.org/10.1002/jcc.20180 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#GallegosCLCS05 2005-11-02 Adaptive approach for nonlinear sensitivity analysis of reaction kinetics. 941-948 2005 26 Journal of Computational Chemistry 9 http://dx.doi.org/10.1002/jcc.20234 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#HorenkoLSH05 2005-11-02 Optimal virtual orbitals to relax wave functions built up with transferred extremely localized molecular orbitals. 827-835 2005 26 Journal of Computational Chemistry 8 http://dx.doi.org/10.1002/jcc.20213 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#GenoniFS05 2005-11-02 Attaining exponential convergence for the flux error with second- and fourth-order accurate finite-difference equations. II. Application to systems comprising first-order chemical reactions. 633-641 2005 26 Journal of Computational Chemistry 6 http://dx.doi.org/10.1002/jcc.20201 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#Rudolph05a 2005-11-02 Translation of STO charge distributions. 846-855 2005 26 Journal of Computational Chemistry 8 http://dx.doi.org/10.1002/jcc.20219 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#RicoLER05 2005-11-02 Registering the Amica electronic structure code in the Extensible Computational Chemistry Environment. 214-225 2005 26 Journal of Computational Chemistry 3 http://dx.doi.org/10.1002/jcc.20152 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#GdanitzBLPS05 2005-11-02 A scoring function for docking ligands to low-resolution protein structures. 374-383 2005 26 Journal of Computational Chemistry 4 http://dx.doi.org/10.1002/jcc.20175 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#BindewaldS05 2005-11-02 <i>ab initio</i>benchmark and DFT validation study. 1006-1020 2005 26 Journal of Computational Chemistry 10 http://dx.doi.org/10.1002/jcc.20233 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#JongGDSB05 2005-11-02 A free energy calculation study of the effect of HF substitution on binding affinity in ligand-antibody interactions. 272-282 2005 26 Journal of Computational Chemistry 3 http://dx.doi.org/10.1002/jcc.20162 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#SaitoOOF05 2005-11-02 Carbon boronyls: Species with higher viable possibility than boron carbonyls at the density functional theory. 799-802 2005 26 Journal of Computational Chemistry 8 http://dx.doi.org/10.1002/jcc.20218 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#LiMGR05 2005-11-02 Theoretical insights into the mechanism of acetylcholinesterase-catalyzed acylation of acetylcholine. 606-611 2005 26 Journal of Computational Chemistry 6 http://dx.doi.org/10.1002/jcc.20199 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#ManojkumarCK05 2005-11-02 A combined freeze-and-cut strategy for the description of large molecular systems using a localized orbitals approach. 1042-1051 2005 26 Journal of Computational Chemistry 10 http://dx.doi.org/10.1002/jcc.20236 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#BoriniME05 2005-11-02 Structure-breaking effects of solvated Rb(I) in dilute aqueous solution - An ab initio QM/MM MD approach. 949-956 2005 26 Journal of Computational Chemistry 9 http://dx.doi.org/10.1002/jcc.20232 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#HoferRR05 2005-11-02 ⁺. 106-113 2005 26 Journal of Computational Chemistry 1 http://dx.doi.org/10.1002/jcc.20126 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#ZouL05 2005-11-02 Exploring the potential energy surface of retinal, a comparison of the performance of different methods. 738-742 2005 26 Journal of Computational Chemistry 7 http://dx.doi.org/10.1002/jcc.20210 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#BlomgrenL05 2005-11-02 ^r-phosphate (PLP)-dependent beta-lyase protein. The importance of protein environment. 443-446 2005 26 Journal of Computational Chemistry 5 http://dx.doi.org/10.1002/jcc.20179 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#PrabhakarMM05 2005-11-02 Chemical structures from the analysis of domain-averaged fermi holes. Nature of the Mn-Mn bond in bis(pentacarbonylmanganese). 447-454 2005 26 Journal of Computational Chemistry 5 http://dx.doi.org/10.1002/jcc.20182 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#PonecYS05 2005-11-02 QMQSAR: Utilization of a semiempirical probe potential in a field-based QSAR method. 23-34 2005 26 Journal of Computational Chemistry 1 http://dx.doi.org/10.1002/jcc.20142 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#DixonMLI05 2005-11-02 The behavior of transition metal nitrido bonds towards protonation rationalized by means of localized bonding schemes and their weights. 532-551 2005 26 Journal of Computational Chemistry 6 http://dx.doi.org/10.1002/jcc.20189 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#Bachler05 2005-11-02 Interaction of sodium and potassium ions with sandwiched cytosine-, guanine-, thymine-, and uracil-base tetrads. 352-364 2005 26 Journal of Computational Chemistry 4 http://dx.doi.org/10.1002/jcc.20176 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#MeyerHS05 2005-11-02 Computational methods for the study of enzymic reaction mechanisms III: A perturbation plus QM/MM approach for calculating relative free energies of protonation. 561-568 2005 26 Journal of Computational Chemistry 6 http://dx.doi.org/10.1002/jcc.20192 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#CumminsG05 2006-01-24 Relative contributions of desolvation, inter- and intramolecular interactions to binding affinity in protein kinase systems. 668-681 2005 26 Journal of Computational Chemistry 7 http://dx.doi.org/10.1002/jcc.20207 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#SimsWVMS05 2005-11-02 Fitting complex potential energy surfaces to simple model potentials: Application of the simplex-annealing method. 523-531 2005 26 Journal of Computational Chemistry 6 http://dx.doi.org/10.1002/jcc.20168 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#MarunCF05 2005-11-02 MDSIMAID: Automatic parameter optimization in fast electrostatic algorithms. 1021-1031 2005 26 Journal of Computational Chemistry 10 http://dx.doi.org/10.1002/jcc.20240 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#CrockerHMI05 2005-11-02 Theoretical study on the reaction mechanism of the methyl radical with nitrogen oxides. 807-817 2005 26 Journal of Computational Chemistry 8 http://dx.doi.org/10.1002/jcc.20217 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#ZhangLLS05 2005-11-02 Study of electronic spectra of free-base porphin and Mg-porphin: Comprehensive comparison of variety of ab initio, DFT, and semiempirical methods. 294-303 2005 26 Journal of Computational Chemistry 3 http://dx.doi.org/10.1002/jcc.20164 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#SedaBL05 2005-11-02 SARS-CoV protease inhibitors design using virtual screening method from natural products libraries. 484-490 2005 26 Journal of Computational Chemistry 5 http://dx.doi.org/10.1002/jcc.20186 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#LiuZ05 2005-11-02 Evaluation of library ranking efficacy in virtual screening. 11-22 2005 26 Journal of Computational Chemistry 1 http://dx.doi.org/10.1002/jcc.20141 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#KontoyianniSM05 2005-11-02 Importance of accurate charges in molecular docking: Quantum mechanical/molecular mechanical (QM/MM) approach. 915-931 2005 26 Journal of Computational Chemistry 9 http://dx.doi.org/10.1002/jcc.20222 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#ChoGBF05 2005-11-02 Estimation of the absolute internal-rotation entropy of molecules with two torsional degrees of freedom from stochastic simulations. 651-660 2005 26 Journal of Computational Chemistry 7 http://dx.doi.org/10.1002/jcc.20198 http://www.informatik.uni-trier.de/~ley/db/journals/jcc/jcc26.html#DarianHFSD05 2003-10-02 The ergonomics of hypertext narative: usability testing as a tool for evaluation and redesign. 3-16 2001 25 ACM Journal of Computer Documentation 1 http://doi.acm.org/10.1145/383948.383950 http://www.informatik.uni-trier.de/~ley/db/journals/jcd/jcd25.html#X01 2003-10-02 The complexity of online groups: a case study of asynchronous collaboration. 17-24 2001 25 ACM Journal of Computer Documentation 1 http://doi.acm.org/10.1145/383948.383951 http://www.informatik.uni-trier.de/~ley/db/journals/jcd/jcd25.html#X01a 2003-10-02 Producing quality technical information. 66-117 2002 26 ACM Journal of Computer Documentation 3 http://doi.acm.org/10.1145/604228.604232 http://www.informatik.uni-trier.de/~ley/db/journals/jcd/jcd26.html#Dean02 2003-10-02 SIGDOC reminiscences. 40-41 2001 25 ACM Journal of Computer Documentation 2 http://doi.acm.org/10.1145/504776.504780 http://www.informatik.uni-trier.de/~ley/db/journals/jcd/jcd25.html#Brockman01 2003-10-02 Commentary on international learning. 31-32 2000 24 ACM Journal of Computer Documentation 1 http://doi.acm.org/10.1145/330409.330414 http://www.informatik.uni-trier.de/~ley/db/journals/jcd/jcd24.html#Russell00 2003-10-02 Nardi and O'Day's information ecologies: using technology with heart. 78 2000 24 ACM Journal of Computer Documentation 2 http://doi.acm.org/10.1145/337271.337286 http://www.informatik.uni-trier.de/~ley/db/journals/jcd/jcd24.html#Johnson00 2003-10-02 Introduction to commentaries on "Spurious Coin: A History of Science, Management, and Technical Writing" by Bernadette Longo. 47 2001 25 ACM Journal of Computer Documentation 2 http://doi.acm.org/10.1145/504776.504782 http://www.informatik.uni-trier.de/~ley/db/journals/jcd/jcd25.html#Johnson01 2003-10-02 Participating from the sidelines, online: facilitating telementoring projects. 227-236 2000 24 ACM Journal of Computer Documentation 4 http://doi.acm.org/10.1145/353927.353934 http://www.informatik.uni-trier.de/~ley/db/journals/jcd/jcd24.html#HarrisF00 2003-10-02 Reflections on NoteCards: seven issues for the next generation of hypermedia systems. 71-87 2001 25 ACM Journal of Computer Documentation 3 http://doi.acm.org/10.1145/507317.507321 http://www.informatik.uni-trier.de/~ley/db/journals/jcd/jcd25.html#Halasz01 2003-10-02 Introduction to this classic reprint and commentaries. 105-106 2000 24 ACM Journal of Computer Documentation 3 http://doi.acm.org/10.1145/344599.344626 http://www.informatik.uni-trier.de/~ley/db/journals/jcd/jcd24.html#Waite00 2003-10-02 Hypermedia systems in the new millenium. 69-70 2001 25 ACM Journal of Computer Documentation 3 http://doi.acm.org/10.1145/507317.507319 http://www.informatik.uni-trier.de/~ley/db/journals/jcd/jcd25.html#Waite01 2003-10-02 Consequences of the engineering approach to technical writing. 22-26 2002 26 ACM Journal of Computer Documentation 1 http://doi.acm.org/10.1145/584731.584737 http://www.informatik.uni-trier.de/~ley/db/journals/jcd/jcd26.html#Waite02 2003-10-02 Quality technical information: paving the way for usable print and web interface design. 118-125 2002 26 ACM Journal of Computer Documentation 3 http://doi.acm.org/10.1145/604228.604234 http://www.informatik.uni-trier.de/~ley/db/journals/jcd/jcd26.html#Mandel02 2003-10-02 Third commentary on "XML and the new design regime". 48-49 2002 26 ACM Journal of Computer Documentation 2 http://doi.acm.org/10.1145/602364.602372 http://www.informatik.uni-trier.de/~ley/db/journals/jcd/jcd26.html#Payne02 2003-10-02 Planning and information foraging theories: social implicaitons and extensions. 176-180 2002 26 ACM Journal of Computer Documentation 4 http://doi.acm.org/10.1145/882061.882065 http://www.informatik.uni-trier.de/~ley/db/journals/jcd/jcd26.html#Jack02 2003-10-02 Hypermedia systems in the new millenium: introduction to this classic reprint and commentaries. 148-152 2001 25 ACM Journal of Computer Documentation 4 http://doi.acm.org/10.1145/586569.586579 http://www.informatik.uni-trier.de/~ley/db/journals/jcd/jcd25.html#Waite01a 2003-10-02 Introduction. 64-65 2002 26 ACM Journal of Computer Documentation 3 http://doi.acm.org/10.1145/604228.604230 http://www.informatik.uni-trier.de/~ley/db/journals/jcd/jcd26.html#Waite02a 2003-10-02 Expanding beyond a cognitivist framework. 21-24 2000 24 ACM Journal of Computer Documentation 1 http://doi.acm.org/10.1145/330409.330412 http://www.informatik.uni-trier.de/~ley/db/journals/jcd/jcd24.html#KirkleyD00 2003-10-02 A computing research repository: why not solve the problems first? 64-71 2000 24 ACM Journal of Computer Documentation 2 http://doi.acm.org/10.1145/337271.337281 http://www.informatik.uni-trier.de/~ley/db/journals/jcd/jcd24.html#Loon00 2003-10-02 Egoless writing: improving quality by replacing artistic impulse with engineering discipline. 3-10 2002 26 ACM Journal of Computer Documentation 1 http://doi.acm.org/10.1145/584731.584733 http://www.informatik.uni-trier.de/~ley/db/journals/jcd/jcd26.html#Weiss02 2003-10-02 CoRR: a computing research repository. 41-48 2000 24 ACM Journal of Computer Documentation 2 http://doi.acm.org/10.1145/337271.337274 http://www.informatik.uni-trier.de/~ley/db/journals/jcd/jcd24.html#Halpern00 2003-10-02 Information technology and the emergence of a worker-centered organization. 204-212 2000 24 ACM Journal of Computer Documentation 4 http://doi.acm.org/10.1145/353927.353930 http://www.informatik.uni-trier.de/~ley/db/journals/jcd/jcd24.html#Carlson00 2003-10-02 Readability and computer documentation. 122-131 2000 24 ACM Journal of Computer Documentation 3 http://doi.acm.org/10.1145/344599.344634 http://www.informatik.uni-trier.de/~ley/db/journals/jcd/jcd24.html#Hargis00 2003-10-02 A usage based analysis of CoRR. 54-59 2000 24 ACM Journal of Computer Documentation 2 http://doi.acm.org/10.1145/337271.337277 http://www.informatik.uni-trier.de/~ley/db/journals/jcd/jcd24.html#CarrHHH00 2003-10-02 At the heart of information ecologies: invisibility and technical communication. 85-90 2000 24 ACM Journal of Computer Documentation 2 http://doi.acm.org/10.1145/337271.337290 http://www.informatik.uni-trier.de/~ley/db/journals/jcd/jcd24.html#Ranney00 2003-10-02 Deep realities: the fit of usability in business. 220-226 2000 24 ACM Journal of Computer Documentation 4 http://doi.acm.org/10.1145/353927.353932 http://www.informatik.uni-trier.de/~ley/db/journals/jcd/jcd24.html#Wiebe00 2003-10-02 NoteCards in the age of the web: practice meets perfect. 96-103 2001 25 ACM Journal of Computer Documentation 3 http://doi.acm.org/10.1145/507317.507325 http://www.informatik.uni-trier.de/~ley/db/journals/jcd/jcd25.html#Marshall01 2003-10-02 SIGDOC reminiscences. 31-33 2001 25 ACM Journal of Computer Documentation 2 http://doi.acm.org/10.1145/504776.504778 http://www.informatik.uni-trier.de/~ley/db/journals/jcd/jcd25.html#Rigo01 2003-10-02 <i>Spurious Coin</i>. 63-65 2001 25 ACM Journal of Computer Documentation 2 http://doi.acm.org/10.1145/504776.504784 http://www.informatik.uni-trier.de/~ley/db/journals/jcd/jcd25.html#Trim01 2003-10-02 Second commentary on "XML and the new design regime". 45-47 2002 26 ACM Journal of Computer Documentation 2 http://doi.acm.org/10.1145/602364.602371 http://www.informatik.uni-trier.de/~ley/db/journals/jcd/jcd26.html#Haynes02 2003-10-02 Genre ecologies: an open-system approach to understanding and constructing documentation. 169-181 2000 24 ACM Journal of Computer Documentation 3 http://doi.acm.org/10.1145/344599.344646 http://www.informatik.uni-trier.de/~ley/db/journals/jcd/jcd24.html#SpinuzziZ00 2003-10-02 XML and the new design regime: disputes between designers, application developers, authors, and readers in changing technological conditions and perceptions of social and professional need. 33-42 2002 26 ACM Journal of Computer Documentation 2 http://doi.acm.org/10.1145/602364.602368 http://www.informatik.uni-trier.de/~ley/db/journals/jcd/jcd26.html#Wilkes02 2003-10-02 First commentary on "XML and the new design regime". 43-44 2002 26 ACM Journal of Computer Documentation 2 http://doi.acm.org/10.1145/602364.602370 http://www.informatik.uni-trier.de/~ley/db/journals/jcd/jcd26.html#Burch02 2003-10-02 Conversations on context: some incomplete thoughts. 145-147 2001 25 ACM Journal of Computer Documentation 4 http://doi.acm.org/10.1145/586569.586577 http://www.informatik.uni-trier.de/~ley/db/journals/jcd/jcd25.html#Johnson-Eilola01a 2003-10-02 Notes toward a socially informed pedagogy for computer documentation. 132-140 2001 25 ACM Journal of Computer Documentation 4 http://doi.acm.org/10.1145/586569.586574 http://www.informatik.uni-trier.de/~ley/db/journals/jcd/jcd25.html#Selber01 2003-10-02 A review and applications of information ecologies. 91-102 2000 24 ACM Journal of Computer Documentation 2 http://doi.acm.org/10.1145/337271.337291 http://www.informatik.uni-trier.de/~ley/db/journals/jcd/jcd24.html#SelfeH00 2003-10-02 Readable computer documentation. 148-168 2000 24 ACM Journal of Computer Documentation 3 http://doi.acm.org/10.1145/344599.344645 http://www.informatik.uni-trier.de/~ley/db/journals/jcd/jcd24.html#Klare00a 2003-10-02 International learning in an international world. 3-20 2000 24 ACM Journal of Computer Documentation 1 http://doi.acm.org/10.1145/330409.330411 http://www.informatik.uni-trier.de/~ley/db/journals/jcd/jcd24.html#Martinez00 2003-10-02 <i>Producing Quality Technical Information:</i>the common sense of producing quality technical information. 148-154 2002 26 ACM Journal of Computer Documentation 3 http://doi.acm.org/10.1145/604228.604239 http://www.informatik.uni-trier.de/~ley/db/journals/jcd/jcd26.html#Dean02a 2003-10-02 A conversation and commentary on from Millwrights to Shipwrights. 254-259 2000 24 ACM Journal of Computer Documentation 4 http://doi.acm.org/10.1145/353927.353936 http://www.informatik.uni-trier.de/~ley/db/journals/jcd/jcd24.html#Jobst00 2003-10-02 Exploring the blind spot: audience, purpose, and context in "product, process, and profit". 213-219 2000 24 ACM Journal of Computer Documentation 4 http://doi.acm.org/10.1145/353927.353931 http://www.informatik.uni-trier.de/~ley/db/journals/jcd/jcd24.html#Spinuzzi00 2003-10-02 A commentary on Frank Halasz's "Reflections on NoteCards: Seven Issues for the Next Generation of Hypertext Systems". 104-108 2001 25 ACM Journal of Computer Documentation 3 http://doi.acm.org/10.1145/507317.507326 http://www.informatik.uni-trier.de/~ley/db/journals/jcd/jcd25.html#Mylonas01 2003-10-02 Editorial. 1-2 2001 25 ACM Journal of Computer Documentation 1 http://doi.acm.org/10.1145/383948.383949 http://www.informatik.uni-trier.de/~ley/db/journals/jcd/jcd25.html#Dicks01 2003-10-02 Editorial. 31-32 2002 26 ACM Journal of Computer Documentation 2 http://doi.acm.org/10.1145/602364.602366 http://www.informatik.uni-trier.de/~ley/db/journals/jcd/jcd26.html#Dicks02 2003-10-02 The measurement of readability: useful information for communicators. 107-121 2000 24 ACM Journal of Computer Documentation 3 http://doi.acm.org/10.1145/344599.344630 http://www.informatik.uni-trier.de/~ley/db/journals/jcd/jcd24.html#Klare00 2003-10-02 Metaphor in theory and practice: the influence of metaphors on expectations. 237-253 2000 24 ACM Journal of Computer Documentation 4 http://doi.acm.org/10.1145/353927.353935 http://www.informatik.uni-trier.de/~ley/db/journals/jcd/jcd24.html#Hamilton00 2003-10-02 Commentary on "planning and information foraging theories and their value to the novice technical communicator. 181-183 2002 26 ACM Journal of Computer Documentation 4 http://doi.acm.org/10.1145/882061.882066 http://www.informatik.uni-trier.de/~ley/db/journals/jcd/jcd26.html#Eaton02 2003-10-02 Intentionality and other nonsignificant in issues learning: commentary on Margaret Martinez's Intentional Learning in an Intentional World? 25-30 2000 24 ACM Journal of Computer Documentation 1 http://doi.acm.org/10.1145/330409.330413 http://www.informatik.uni-trier.de/~ley/db/journals/jcd/jcd24.html#Mehlenbacher00 2003-10-02 Repley to commentaries on "XML and the new design regime". 50-53 2002 26 ACM Journal of Computer Documentation 2 http://doi.acm.org/10.1145/602364.602374 http://www.informatik.uni-trier.de/~ley/db/journals/jcd/jcd26.html#Wilkes02a 2003-10-02 We neurotic amateurs: a commentary on Edmond H. Weiss's Egoless Writing: Improving Quality by Replacing Artistic Impulse with Engineering Discipline. 17-21 2002 26 ACM Journal of Computer Documentation 1 http://doi.acm.org/10.1145/584731.584736 http://www.informatik.uni-trier.de/~ley/db/journals/jcd/jcd26.html#Sauer02 2003-10-02 Little machines: understanding users understanding interfaces. 119-127 2001 25 ACM Journal of Computer Documentation 4 http://doi.acm.org/10.1145/586569.586571 http://www.informatik.uni-trier.de/~ley/db/journals/jcd/jcd25.html#Johnson-Eilola01 2003-10-02 Issues of online research repositories from the perspective of the biomedical sciences. 49-53 2000 24 ACM Journal of Computer Documentation 2 http://doi.acm.org/10.1145/337271.337275 http://www.informatik.uni-trier.de/~ley/db/journals/jcd/jcd24.html#Armbruster00 2003-10-02 Planning and information foraging theories and their value to the novice technical communicator. 168-175 2002 26 ACM Journal of Computer Documentation 4 http://doi.acm.org/10.1145/882061.882063 http://www.informatik.uni-trier.de/~ley/db/journals/jcd/jcd26.html#Gattis02 2003-10-02 A virtual conversation on Bernadette Longo's Spurious Coin: A History of Science, Management, and Technical Writing. 48-62 2001 25 ACM Journal of Computer Documentation 2 http://doi.acm.org/10.1145/504776.504783 http://www.informatik.uni-trier.de/~ley/db/journals/jcd/jcd25.html#GaskillBHP01 2003-10-02 Readability formulas have even more limitations than Klare discusses. 132-137 2000 24 ACM Journal of Computer Documentation 3 http://doi.acm.org/10.1145/344599.344637 http://www.informatik.uni-trier.de/~ley/db/journals/jcd/jcd24.html#Redish00 2003-10-02 Assessing quality documents. 130-140 2002 26 ACM Journal of Computer Documentation 3 http://doi.acm.org/10.1145/604228.604236 http://www.informatik.uni-trier.de/~ley/db/journals/jcd/jcd26.html#Smart02 2003-10-02 Integrating academics and industry: a challenge for both sides. 33-38 2000 24 ACM Journal of Computer Documentation 1 http://doi.acm.org/10.1145/330409.330415 http://www.informatik.uni-trier.de/~ley/db/journals/jcd/jcd24.html#Sutliff00 2003-10-02 Reply to commentaries on: "Egoless Writing: Improving Quality by Replacing Artistic Impulse with Engineering Discipline". 27-28 2002 26 ACM Journal of Computer Documentation 1 http://doi.acm.org/10.1145/584731.584739 http://www.informatik.uni-trier.de/~ley/db/journals/jcd/jcd26.html#Weiss02a 2003-10-02 The metaphysics of information quality: comments on producing quality technical information. 141-147 2002 26 ACM Journal of Computer Documentation 3 http://doi.acm.org/10.1145/604228.604237 http://www.informatik.uni-trier.de/~ley/db/journals/jcd/jcd26.html#Weiss02b 2003-10-02 The dilemma of credibility vs. speed. 60-63 2000 24 ACM Journal of Computer Documentation 2 http://doi.acm.org/10.1145/337271.337279 http://www.informatik.uni-trier.de/~ley/db/journals/jcd/jcd24.html#Prekeges00 2003-10-02 Readability formulas in the new millenium: what's the use? 138-140 2000 24 ACM Journal of Computer Documentation 3 http://doi.acm.org/10.1145/344599.344638 http://www.informatik.uni-trier.de/~ley/db/journals/jcd/jcd24.html#Schriver00 2003-10-02 Editorial: a publishing pla fulfilled. 1-2 2000 24 ACM Journal of Computer Documentation 1 http://doi.acm.org/10.1145/330409.330410 http://www.informatik.uni-trier.de/~ley/db/journals/jcd/jcd24.html#Girill00 2003-10-02 Editorial. 29 2001 25 ACM Journal of Computer Documentation 2 http://doi.acm.org/10.1145/504776.504777 http://www.informatik.uni-trier.de/~ley/db/journals/jcd/jcd25.html#Dicks01a 2003-10-02 Product, process, and profit: the politics of usability in a software venture. 185-203 2000 24 ACM Journal of Computer Documentation 4 http://doi.acm.org/10.1145/353927.353928 http://www.informatik.uni-trier.de/~ley/db/journals/jcd/jcd24.html#Mirel00 2003-10-02 A response to the commentaries on CoRR. 72-77 2000 24 ACM Journal of Computer Documentation 2 http://doi.acm.org/10.1145/337271.337283 http://www.informatik.uni-trier.de/~ley/db/journals/jcd/jcd24.html#Halpern00a 2003-10-02 SIGDOC reminiscences 1981-88. 34-39 2001 25 ACM Journal of Computer Documentation 2 http://doi.acm.org/10.1145/504776.504779 http://www.informatik.uni-trier.de/~ley/db/journals/jcd/jcd25.html#Patterson01 2003-10-02 From NoteCards to the web: the role of Halasz's seven issues. 88-91 2001 25 ACM Journal of Computer Documentation 3 http://doi.acm.org/10.1145/507317.507323 http://www.informatik.uni-trier.de/~ley/db/journals/jcd/jcd25.html#Dobroth01 2003-10-02 SIGDOC reminiscences. 42-46 2001 25 ACM Journal of Computer Documentation 2 http://doi.acm.org/10.1145/504776.504781 http://www.informatik.uni-trier.de/~ley/db/journals/jcd/jcd25.html#Haramundanis01 2003-10-02 Commentary on: "Egoless Writing: Improving Quality by Replacing Artistic Impulse with Engineering Discipline". 11-16 2002 26 ACM Journal of Computer Documentation 1 http://doi.acm.org/10.1145/584731.584735 http://www.informatik.uni-trier.de/~ley/db/journals/jcd/jcd26.html#Haramundanis02 2003-10-02 Halasz's "seven issues" in context. 92-95 2001 25 ACM Journal of Computer Documentation 3 http://doi.acm.org/10.1145/507317.507324 http://www.informatik.uni-trier.de/~ley/db/journals/jcd/jcd25.html#Furuta01 2003-10-02 Commentary on: "Little Machines: Understanding Users Understanding Interfaces". 128-131 2001 25 ACM Journal of Computer Documentation 4 http://doi.acm.org/10.1145/586569.586573 http://www.informatik.uni-trier.de/~ley/db/journals/jcd/jcd25.html#Haramundanis01a 2003-10-02 Mapping the expanding landscape of usability: the case of distributed education. 159-167 2002 26 ACM Journal of Computer Documentation 4 http://doi.acm.org/10.1145/882061.882062 http://www.informatik.uni-trier.de/~ley/db/journals/jcd/jcd26.html#GriceH02 2003-10-02 Confessions of a gardener: a review of information ecologies. 79-84 2000 24 ACM Journal of Computer Documentation 2 http://doi.acm.org/10.1145/337271.337287 http://www.informatik.uni-trier.de/~ley/db/journals/jcd/jcd24.html#Hart-Davidson00 2003-10-02 Klare's "useful information" ist useful for Web designers. 141-147 2000 24 ACM Journal of Computer Documentation 3 http://doi.acm.org/10.1145/344599.344641 http://www.informatik.uni-trier.de/~ley/db/journals/jcd/jcd24.html#Zibell00 2003-10-02 Reflections on "Seven Issues": hypertext in the era of the web. 109-114 2001 25 ACM Journal of Computer Documentation 3 http://doi.acm.org/10.1145/507317.507328 http://www.informatik.uni-trier.de/~ley/db/journals/jcd/jcd25.html#Halasz01a 2003-10-02 Our little help machines and their invisibilities. 141-144 2001 25 ACM Journal of Computer Documentation 4 http://doi.acm.org/10.1145/586569.586575 http://www.informatik.uni-trier.de/~ley/db/journals/jcd/jcd25.html#Farkas01 2003-10-02 Some reflections on the emergence of a profession. 126-129 2002 26 ACM Journal of Computer Documentation 3 http://doi.acm.org/10.1145/604228.604235 http://www.informatik.uni-trier.de/~ley/db/journals/jcd/jcd26.html#Grice02 2004-02-05 A Combined D.C. Optimization - Ellipsoidal Branch-and-Bound Algorithm for Solving Nonconvex Quadratic Programming Problems. 9-28 1998 2 J. Comb. Optim. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco2.html#AnTM98 2004-02-05 The Enhanced Double Digest Problem for DNA Physical Mapping. 69-78 2003 7 J. Comb. Optim. 1 http://dx.doi.org/10.1023/A:1021946523069 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco7.html#KaoSS03 2004-02-05 Editorial. 5-5 2000 4 J. Comb. Optim. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco4.html#Du00 2004-02-05 Book Review: Discrete Analysis and Operation Research. 105 1997 1 J. Comb. Optim. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco1.html#Du97 2004-02-05 Analysis of the List Scheduling Algorithm for Precedence Constrained Parallel Tasks. 73-88 1999 3 J. Comb. Optim. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco3.html#Li99 2006-05-08 On the Complexity of the Steiner Problem. 187-195 2000 4 J. Comb. Optim. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco4.html#BrazilTW00 2004-02-05 A Two-Phase Exact Algorithm for MAX-SAT and Weighted MAX-SAT Problems. 299-306 1998 2 J. Comb. Optim. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco2.html#BorchersF98 2004-02-05 Graph Algorithms with Small Communication Costs. 291-305 2000 4 J. Comb. Optim. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco4.html#ZhouDD00 2004-02-05 Scheduling Problems in a Practical Allocation Model. 129-149 1997 1 J. Comb. Optim. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco1.html#HollermannHLV97 2004-02-05 Approximate and Exact Algorithms for Constrained (Un) Weighted Two-dimensional Two-staged Cutting Stock Problems. 465-494 2001 5 J. Comb. Optim. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco5.html#HifiR01 2004-02-05 The Knapsack Sharing Problem: An Exact Algorithm. 35-54 2002 6 J. Comb. Optim. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco6.html#HifiS02 2005-11-09 Some Results on Node Lifting of TSP Inequalities. 395-414 2000 4 J. Comb. Optim. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco4.html#Carr00 2004-02-05 Semidefinite Programming Relaxations for the Quadratic Assignment Problem. 71-109 1998 2 J. Comb. Optim. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco2.html#ZhaoKRW98 2004-02-05 Constructing Near Optimal Schedules for the Flow-Shop Lot Streaming Problem with Sublot-Attached Setups. 23-44 2003 7 J. Comb. Optim. 1 http://dx.doi.org/10.1023/A:1021942422161 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco7.html#KalirS03 2004-02-05 ^°Angle Constraint for Plane Minimal T1 Trees. 271-284 2000 4 J. Comb. Optim. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco4.html#Cole00 2004-02-05 3-Partitioning Problems for Maximizing the Minimum Load. 67-80 2002 6 J. Comb. Optim. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco6.html#ChenHL02 2004-02-05 On-Line Scheduling of Two-Machine Open Shops Where Jobs Arrive Over Time. 355-365 1998 1 J. Comb. Optim. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco1.html#ChenVW98 2004-02-05 Closed-Form Deterministic End-to-End Performance Bounds for the Generalized Processor Sharing Scheduling Discipline. 457-481 1998 1 J. Comb. Optim. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco1.html#ZhangLT98 2004-02-05 On Disjunctive Cuts for Combinatorial Optimization. 299-315 2001 5 J. Comb. Optim. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco5.html#Letchford01 2004-02-05 On Shortest k-Edge-Connected Steiner Networks in Metric Spaces. 99-107 2000 4 J. Comb. Optim. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco4.html#DuHJ00 2004-02-05 Transversal Graphs for Partially Ordered Sets: Sequencing, Merging and Scheduling Problems. 417-435 1999 3 J. Comb. Optim. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco3.html#MiddendorfT99 2004-02-05 Combining Linear and Non-Linear Objectives in Spanning Tree Problems. 253-269 2000 4 J. Comb. Optim. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco4.html#DellAmicoM00 2004-02-05 Reduction of the Three-Partition Problem. 17-30 1999 3 J. Comb. Optim. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco3.html#DellAmicoM99 2004-02-05 Approximation Algorithms in Batch Processing. 247-257 2003 7 J. Comb. Optim. 3 http://dx.doi.org/10.1023/A:1027316504440 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco7.html#DengPZ03 2004-02-05 On Integer Programming Approaches for Morphological Template Decomposition Problems in Computer Vision. 165-178 1997 1 J. Comb. Optim. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco1.html#SussnerPR97 2004-02-05 Approximation Algorithms for Bounded Facility Location Problems. 233-247 2001 5 J. Comb. Optim. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco5.html#KrystaS01 2004-02-05 Skeletonization of Volumetric Vascular Images - Distance Information Utilized for Visualization. 27-41 2001 5 J. Comb. Optim. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco5.html#NystromS01 2004-02-05 Approximation Algorithms for Quadratic Programming. 29-50 1998 2 J. Comb. Optim. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco2.html#FuLY98 2004-02-05 Using Prices More Realistically as Decision Variables in Perishable-Asset Revenue Management Problems. 277-304 1997 1 J. Comb. Optim. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco1.html#Weatherford97 2004-02-05 Moments of Inertia and Graph Separators. 79-104 1997 1 J. Comb. Optim. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco1.html#GrembanMT97 2004-02-05 Attacking the Market Split Problem with Lattice Point Enumeration. 5-16 2002 6 J. Comb. Optim. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco6.html#Wassermann02 2004-02-05 On the Addition and Comparison of Graphs Labeled with Stochastic Variables: Learnable Anatomical Catalogs. 43-58 2001 5 J. Comb. Optim. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco5.html#Hall01 2004-02-05 Sequence Independent Lifting in Mixed Integer Programming. 109-129 2000 4 J. Comb. Optim. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco4.html#GuNS00 2004-02-05 Inverse Problems of Matroid Intersection. 465-474 1999 3 J. Comb. Optim. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco3.html#Cai99 2004-02-05 Ordinal On-Line Scheduling for Maximizing the Minimum Machine Completion Time. 199-206 2002 6 J. Comb. Optim. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco6.html#HeT02 2004-02-05 Efficient Detection and Protection of Information in Cross Tabulated Tables II: Minimal Linear Invariants. 187-202 1997 1 J. Comb. Optim. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco1.html#Kao97 2004-02-05 All-Different Polytopes. 335-352 2002 6 J. Comb. Optim. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco6.html#Lee02 2004-02-05 Practical Human-Machine Identification over Insecure Channels. 347-361 1999 3 J. Comb. Optim. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco3.html#LiT99 2004-02-05 Polynomial Time Approximation Scheme for the Rectilinear Steiner Arborescence Problem. 357-363 2000 4 J. Comb. Optim. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco4.html#LuR00 2004-02-05 A Note on the Max-Min 0-1 Knapsack Problem. 89-94 1999 3 J. Comb. Optim. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco3.html#Iida99 2004-02-05 A Unifying Augmentation Algorithm for Two-Edge Connectivity and Biconnectivity. 237-256 1998 2 J. Comb. Optim. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco2.html#HsuK98 2004-02-05 Facility Dispersion Problems Under Capacity and Cost Constraints. 7-33 2000 4 J. Comb. Optim. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco4.html#RosenkrantzTR00 2004-02-05 Near-Optimal Conflict-Free Channel Set Assignments for an Optical Cluster-Based Hypercube Network. 179-186 1997 1 J. Comb. Optim. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco1.html#Wan97 2004-02-05 Local Optimality and Its Application on Independent Sets for k-claw Free Graphs. 151-164 1997 1 J. Comb. Optim. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco1.html#YuG97 2004-02-05 Improved Bounds on Relaxations of a Parallel Machine Scheduling Problem. 413-426 1998 1 J. Comb. Optim. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco1.html#PhillipsSSSW98 2004-02-05 The Greedier the Better: An Efficient Algorithm for Approximating Maximum Independent. 411-420 2001 5 J. Comb. Optim. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco5.html#LauT01 2006-05-08 Efficient Heuristics for Orientation Metric and Euclidean Steiner Tree Problems. 79-98 2000 4 J. Comb. Optim. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco4.html#LiLW00 2006-03-30 Steiner k-Edge Connected Subgraph Polyhedra. 131-144 2000 4 J. Comb. Optim. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco4.html#BihaM00 2004-02-05 Minimizing the Number of Late Jobs under the Group Technology Assumption. 5-15 1999 3 J. Comb. Optim. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco3.html#LiuY99 2004-02-05 Fitting Distances by Tree Metrics with Increment Error. 213-225 1999 3 J. Comb. Optim. 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco3.html#MaWZ99 2004-02-05 Optimization Model and Algorithm for Crew Management During Airline Irregular Operations. 305-321 1997 1 J. Comb. Optim. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco1.html#WeiYS97 2004-02-05 Compression Theorems and Steiner Ratios on Spheres. 67-78 1997 1 J. Comb. Optim. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco1.html#RubinsteinW97 2004-02-05 Combinatorial Optimization in Real-Time Scheduling: Theory and Algorithms. 345-375 2001 5 J. Comb. Optim. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco5.html#HwangC01 2006-04-21 Efficient Algorithms for Similarity Search. 125-132 2001 5 J. Comb. Optim. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco5.html#RajasekaranHLNPSS01 2004-02-05 Aligning DNA Sequences to Minimize the Change in Protein. 227-245 1999 3 J. Comb. Optim. 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco3.html#HuaJW99 2005-03-18 Constructing the Maximum Consensus Tree from Rooted Triples. 29-39 2004 8 J. Comb. Optim. 1 http://www.springerlink.com/index/10.1023/B:JOCO.0000021936.04215.68 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco8.html#Wu04 2004-02-05 A New Subgraph of Minimum Weight Triangulations. 115-127 1997 1 J. Comb. Optim. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco1.html#WangCX97 2004-02-05 On Some Polyhedra Covering Problems. 437-447 2000 4 J. Comb. Optim. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco4.html#WangYZ00 2004-02-05 Efficient Algorithms for a Scheduling Problem and its Applications to Illicit Drug Market Crackdowns. 367-376 1998 1 J. Comb. Optim. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco1.html#CaiCN98 2004-02-05 Inverse Polymatroidal Flow Problem. 115-126 1999 3 J. Comb. Optim. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco3.html#CaiYL99 2005-11-09 A 2\frac{1}{10}-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem. 317-326 2001 5 J. Comb. Optim. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco5.html#CarrFKP01 2004-02-05 A Greedy Randomized Adaptive Search Procedure for the Feedback Vertex Set Problem. 399-412 1998 2 J. Comb. Optim. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco2.html#PardalosQR98 2004-02-05 Hybrid Evolutionary Algorithms for Graph Coloring. 379-397 1999 3 J. Comb. Optim. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco3.html#GalinierH99 2004-02-05 A Case Study of De-randomization Methods for Combinatorial Approximation Algorithms. 219-236 1998 2 J. Comb. Optim. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco2.html#RolimT98 2004-02-05 New Approximation Algorithms for the Steiner Tree Problems. 47-65 1997 1 J. Comb. Optim. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco1.html#KarpinskiZ97 2004-02-05 "Mobile Networks and Computing". 297-298 2001 5 J. Comb. Optim. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco5.html#Resende01 2004-02-05 On the Complexity of Constructing Evolutionary Trees. 183-197 1999 3 J. Comb. Optim. 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco3.html#GasieniecJLO99 2004-02-05 A Parametric Approach for a Nonlinear Discrete Location Problem. 119-132 2002 6 J. Comb. Optim. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco6.html#SunG02 2004-02-05 Resolution Search and Dynamic Branch-and-Bound. 401-423 2002 6 J. Comb. Optim. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco6.html#HanafiG02 2004-02-05 Approximating the Independence Number and the Chromatic Number in Expected Polynomial Time. 143-155 2002 6 J. Comb. Optim. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco6.html#KrivelevichV02 2004-02-05 A Novel Eigenvector Technique for Large Scale Combinatorial Problems in VLSI Layout. 271-286 2002 6 J. Comb. Optim. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco6.html#BehjatKV02 2004-02-05 Job Shop Scheduling With Deadlines. 329-353 1998 1 J. Comb. Optim. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco1.html#BalasLSV98 2004-02-05 Medial Axis and Optimal Locations for Min-Max Sphere Packing. 487-503 2000 4 J. Comb. Optim. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco4.html#Wang00 2004-02-05 Optimization Problems in Medical Applications. 7-8 2001 5 J. Comb. Optim. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco5.html#Wang01 2004-02-05 Packing of Unequal Spheres and Automated Radiosurgical Treatment Planning. 453-463 1999 3 J. Comb. Optim. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco3.html#Wang99 2004-02-05 A Heuristic for the Maximum Independent Set Problem Based on Optimization of a Quadratic Over a Sphere. 287-297 2002 6 J. Comb. Optim. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco6.html#BusyginBP02 2004-02-05 Randomized Online Scheduling with Delivery Times. 399-416 1999 3 J. Comb. Optim. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco3.html#Seiden99 2004-02-05 A Tabu Search Heuristic for the Location of Multi-Type Protection Devices on Electrical Supply Tree Networks. 81-98 2002 6 J. Comb. Optim. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco6.html#JamesS02 2004-02-05 Improved Approximation for Breakpoint Graph Decomposition and Sorting by Reversals. 157-182 2002 6 J. Comb. Optim. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco6.html#CapraraR02 2004-02-05 Approximation and Exact Algorithms for Constructing Minimum Ultrametric Trees from Distance Matrices. 199-211 1999 3 J. Comb. Optim. 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco3.html#WuCT99 2004-02-05 Close Approximations of Minimum Rectangular Coverings. 437-452 1999 3 J. Comb. Optim. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco3.html#GudmundssonL99 2004-02-05 Center and Distinguisher for Strings with Unbounded Alphabet. 383-400 2002 6 J. Comb. Optim. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco6.html#DengLW02 2004-02-05 Robot Map Verification of a Graph World. 383-395 2001 5 J. Comb. Optim. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco5.html#DengMM01 2004-02-05 Foreword. 147-148 1999 3 J. Comb. Optim. 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco3.html#XuMH99 2004-02-05 Proof of Toft's Conjecture: Every Graph Containing No Fully Odd K4 is 3-Colorable. 117-188 1998 2 J. Comb. Optim. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco2.html#Zang98 2004-02-05 Traffic Partition in WDM/SONET Rings to Minimize SONET ADMs. 425-453 2002 6 J. Comb. Optim. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco6.html#CalinescuW02 2004-02-05 Analyses on the 2 and 3-Flip Neighborhoods for the MAX SAT. 95-114 1999 3 J. Comb. Optim. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco3.html#YagiuraI99 2004-02-05 An Approximation Scheme for Bin Packing with Conflicts. 363-377 1999 3 J. Comb. Optim. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco3.html#Jansen99 2004-02-05 New Approximation Algorithms for Map Labeling with Sliding Labels. 99-110 2002 6 J. Comb. Optim. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco6.html#ZhuQ02 2004-02-05 Constant-Level Greedy Triangulations Approximate the MWT Well. 361-369 1998 2 J. Comb. Optim. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco2.html#AichholzerARX98 2004-02-05 Simple and Efficient Graph Compression Schemes for Dense and Complement Graphs. 351-359 1998 2 J. Comb. Optim. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco2.html#KaoOT98 2004-02-05 A Tight Semidefinite Relaxation of the MAX CUT Problem. 237-245 2003 7 J. Comb. Optim. 3 http://dx.doi.org/10.1023/A:1027364420370 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco7.html#LiuLX03 2004-02-05 Structure Prediction and Computation of Sparse Matrix Products. 307-332 1998 2 J. Comb. Optim. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco2.html#Cohen98 2004-02-05 A Probabilistic Feasibility and Value Analysis of the Generalized Assignment Problem. 325-355 2000 4 J. Comb. Optim. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco4.html#RomeijnP00 2004-02-05 Incrementing Bipartite Digraph Edge-Connectivity. 449-486 2000 4 J. Comb. Optim. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco4.html#GabowJ00 2004-02-05 Preface. 235-236 2002 6 J. Comb. Optim. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco6.html#PardalosW02 2004-02-05 Preface. 7-7 1998 2 J. Comb. Optim. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco2.html#PardalosW98 2004-02-05 On Multiprocessor System Scheduling. 377-392 1998 1 J. Comb. Optim. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco1.html#DengD98 2004-02-05 On the Robust Single Machine Scheduling Problem. 17-33 2002 6 J. Comb. Optim. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco6.html#YangY02 2005-06-28 Minimum Cost Edge Subset Covering Exactly k Vertices of a Graph. 275-286 2001 5 J. Comb. Optim. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco5.html#Plesnik01 2004-02-05 A New Approximation Algorithm for the Capacitated Vehicle Routing Problem on a Tree. 213-231 2001 5 J. Comb. Optim. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco5.html#AsanoKK01 2004-02-05 Deterministic Õ(nm) Time Edge-Splitting in Undirected Graphs. 5-46 1997 1 J. Comb. Optim. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco1.html#NagamochiI97 2004-02-05 Simplicial Pivoting Algorithms for a Tractable Class of Integer Programs. 133-142 2002 6 J. Comb. Optim. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco6.html#MaarenD02 2004-02-05 Multichannel Optical Networks: Theory and Practice. 495-496 2001 5 J. Comb. Optim. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco5.html#Resende01a 2004-12-07 Polynomial Primal-Dual Affine Scaling Algorithms in Semidefinite Programming. 51-69 1998 2 J. Comb. Optim. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco2.html#KlerkRT98 2004-02-05 The Steiner Tree Problem in Kalmanson Matrices and in Circulant Matrices. 51-58 1999 3 J. Comb. Optim. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco3.html#KlinzW99 2004-02-05 A Polynomial Time Approximation Scheme for the Problem of Interconnecting Highways. 327-343 2001 5 J. Comb. Optim. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco5.html#ChengKL01 2004-02-05 A Simulated Annealing Approach to Communication Network Design. 55-65 2002 6 J. Comb. Optim. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco6.html#RandallMS02 2004-02-05 Quadratic Assignment Problems and M/G/C/C/ State Dependent Network Flows. 421-443 2001 5 J. Comb. Optim. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco5.html#SmithL01 2004-02-05 The Travelling Salesman Problem on Permuted Monge Matrices. 333-350 1998 2 J. Comb. Optim. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco2.html#BurkardDW98 2004-02-05 Approximation and Exact Algorithms for RNA Secondary Structure Prediction and Recognition of Stochastic Context-free Languages. 321-336 1999 3 J. Comb. Optim. 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco3.html#Akutsu99 2004-02-05 Optimal Randomized Scheduling by Replacement. 427-456 1998 1 J. Comb. Optim. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco1.html#Saias98 2004-02-05 An Approximation Algorithm for Alignment of Multiple Sequences using Motif Discovery. 247-275 1999 3 J. Comb. Optim. 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco3.html#ParidaFR99 2004-02-05 An Efficient Algorithm for Delay Buffer Minimization. 217-233 2000 4 J. Comb. Optim. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco4.html#XueSDS00 2004-02-05 Tight Performance Bounds of CP-Scheduling on Out-Trees. 445-464 2001 5 J. Comb. Optim. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco5.html#Vakhania01 2004-02-05 Generalized Steiner Problems and Other Variants. 415-436 2000 4 J. Comb. Optim. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco4.html#DrorH00 2004-02-05 Determining an Optimal Penetration Among Weighted Regions in Two and Three Dimensions. 59-79 2001 5 J. Comb. Optim. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco5.html#ChenDHWX01 2004-02-05 Generalized Diameters and Rabin Numbers of Networks. 371-384 1998 2 J. Comb. Optim. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco2.html#LiawC98 2004-02-05 A Probabilistic Analysis of the Capacitated Facility Location Problem. 31-50 1999 3 J. Comb. Optim. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco3.html#Piersma99 2004-02-05 Restarting after Branching in the SDP Approach to MAX-CUT and Similar Combinatorial Optimization Problems. 151-166 2001 5 J. Comb. Optim. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco5.html#Mitchell01 2004-02-05 A Heuristic Algorithm for Multiple Sequence Alignment Based on Blocks. 95-115 2001 5 J. Comb. Optim. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco5.html#ZhaoJ01 2004-02-05 On Approximating a Scheduling Problem. 287-297 2001 5 J. Comb. Optim. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco5.html#CrescenziDP01 2004-02-05 Tagged Probe Interval Graphs. 133-142 2001 5 J. Comb. Optim. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco5.html#ShengWZ01 2004-02-05 Efficient Algorithms for Local Alignment Search. 117-124 2001 5 J. Comb. Optim. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco5.html#RajasekaranNPSS01 2004-06-03 Sortabilities of Partition Properties. 413-427 1998 2 J. Comb. Optim. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco2.html#ChangCHHNRSWY98 2004-02-05 Combinatorial Optimization in Rapidly Mutating Drug-Resistant Viruses. 301-320 1999 3 J. Comb. Optim. 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco3.html#LathropP99 2004-02-05 Horn Clause Computation with DNA Molecules. 277-299 1999 3 J. Comb. Optim. 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco3.html#Kobayashi99 2004-02-05 On Integrality, Stability and Composition of Dicycle Packings and Covers. 235-251 2000 4 J. Comb. Optim. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco4.html#NutovP00 2004-02-05 A Grasp for Aircraft Routing in Response to Groundings and Delays. 211-228 1997 1 J. Comb. Optim. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco1.html#ArguelloBY97 2004-02-05 Finding a Noncrossing Steiner Forest in Plane Graphs Under a 2-Face Condition. 249-266 2001 5 J. Comb. Optim. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco5.html#KusakariMN01 2004-02-05 A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs. 151-169 2000 4 J. Comb. Optim. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco4.html#NagamochiKI00 2006-01-02 Quadratic Binary Programming and Dynamical System Approach to Determine the Predictability of Epileptic Seizures. 9-26 2001 5 J. Comb. Optim. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco5.html#IasemidisPSS01 2004-02-05 Augmenting a Submodular and Posi-modular Set Function by a Multigraph. 175-212 2001 5 J. Comb. Optim. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco5.html#NagamochiSI01 2004-02-05 A New Fully Polynomial Time Approximation Scheme for the Knapsack Problem. 59-71 1999 3 J. Comb. Optim. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco3.html#KellererP99 2004-02-05 Medical Surveillance, Frequent Sets, and Closure Operations. 81-94 2001 5 J. Comb. Optim. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco5.html#SpragueB01 2004-02-05 Simple Approximation Algorithms for MAXNAESP and Hypergraph 2-colorability. 167-173 2001 5 J. Comb. Optim. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco5.html#GaurK01 2004-07-16 Approximation Algorithms for the Multiple Knapsack Problem with Assignment Restrictions. 171-186 2000 4 J. Comb. Optim. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco4.html#DawandeKKSR00 2004-02-05 Geometry of Semidefinite Max-Cut Relaxations via Matrix Ranks. 237-270 2002 6 J. Comb. Optim. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco6.html#AnjosW02 2004-02-05 Decision Support for Airline Schedule Planning. 251-275 1997 1 J. Comb. Optim. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco1.html#Mathaisel97 2004-02-05 Facility Location with Dynamic Distance Functions. 199-217 1998 2 J. Comb. Optim. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco2.html#BhatiaGKS98 2004-02-05 Quelling Cabin Noise in Turboprop Aircraft via Active Control. 229-250 1997 1 J. Comb. Optim. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco1.html#KincaidLP97 2004-02-05 Composition of Graphs and the Triangle-Free Subgraph Polytope. 359-381 2002 6 J. Comb. Optim. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco6.html#BendaliMM02 2004-02-05 Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts. 397-410 2001 5 J. Comb. Optim. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco5.html#ZhaoNI01 2004-02-05 A General Model of Some Inverse Combinatorial Optimization Problems and Its Solution Method Under l-Norm. 207-227 2002 6 J. Comb. Optim. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco6.html#ZhangL02 2004-02-05 Solution Structure of Some Inverse Combinatorial Optimization Problems. 127-139 1999 3 J. Comb. Optim. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco3.html#ZhangM99 2004-02-05 Performance Analysis and Improvement for Some Linear On-Line Bin-Packing Algorithms. 455-471 2002 6 J. Comb. Optim. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco6.html#GuCGHJ02 2004-02-05 A Genetic Algorithm for the Weight Setting Problem in OSPF Routing. 299-333 2002 6 J. Comb. Optim. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco6.html#EricssonRP02 2006-05-19 The Structural Birnbaum Importance of Consecutive-k Systems. 183-197 2002 6 J. Comb. Optim. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco6.html#ChangCH02 2004-02-05 Localizing Combinatorial Properties for Partitions on Block Graphs. 429-441 1998 2 J. Comb. Optim. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco2.html#ChangHY98 2004-02-05 Computing Optimal Beams in Two and Three Dimensions. 111-136 2003 7 J. Comb. Optim. 2 http://dx.doi.org/10.1023/A:1024484412699 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco7.html#ChenHX03 2004-02-05 Facets of an Assignment Problem with 0-1 Side Constraint. 365-388 2000 4 J. Comb. Optim. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco4.html#AlfakihYM00 2004-02-05 Approximation Algorithms for Certain Network Improvement Problems. 257-288 1998 2 J. Comb. Optim. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco2.html#KrumkeMNRR98 2004-02-05 Necessary Edges in k-Chordalisations of Graphs. 283-290 2003 7 J. Comb. Optim. 3 http://dx.doi.org/10.1023/A:1027320705349 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco7.html#Bodlaender03 2004-02-05 Optimal Augmentation of a 2-Vertex-Connected Multigraph to a k-Edge-Connected and 3-Vertex-Connected Multigraph. 35-77 2000 4 J. Comb. Optim. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco4.html#IshiiNI00 2004-02-05 Optimal On-Line Scheduling of Parallel Jobs with Dependencies. 393-411 1998 1 J. Comb. Optim. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco1.html#FeldmannKST98 2004-02-05 On the Tightness of the Alternating-Cycle Lower Bound for Sorting by Reversals. 149-182 1999 3 J. Comb. Optim. 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco3.html#Caprara99 2004-02-05 A Semidefinite Programming Approach to the Quadratic Knapsack Problem. 197-215 2000 4 J. Comb. Optim. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco4.html#HelmbergRW00 2004-02-05 Group Testing with Relatively Small Pools and DNA Library Screening. 385-397 1998 2 J. Comb. Optim. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco2.html#Macula98 2004-02-05 Multi-phase Algorithms for Throughput Maximization for Real-Time Scheduling. 307-323 2000 4 J. Comb. Optim. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco4.html#BermanD00 2004-02-05 Upper Bounds for the SPOT 5 Daily Photograph Scheduling Problem. 87-103 2003 7 J. Comb. Optim. 1 http://dx.doi.org/10.1023/A:1021950608048 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco7.html#VasquezH03 2004-02-05 Iterative Converging Algorithms for Computing Bounds on Durations of Activities in Pert and Pert-Like Models. 5-22 2003 7 J. Comb. Optim. 1 http://dx.doi.org/10.1023/A:1021964105322 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco7.html#ShragowitzYL03 2006-02-07 The Flow Shop Scheduling Polyhedron with Setup Time. 291-318 2003 7 J. Comb. Optim. 3 http://dx.doi.org/10.1023/A:1027372722187 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco7.html#Rios-MercadoB03 2004-02-05 Solving Steiner Tree Problems in Graphs with Lagrangian Relaxation. 259-282 2003 7 J. Comb. Optim. 3 http://dx.doi.org/10.1023/A:1027368621279 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco7.html#BahienseBP03 2005-03-18 Wide Diameters of Cartesian Product Graphs and Digraphs. 171-181 2004 8 J. Comb. Optim. 2 http://www.springerlink.com/index/10.1023/B:JOCO.0000031418.45051.8b http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco8.html#Xu04 2004-02-05 GRASP with a New Local Search Scheme for Vehicle Routing Problems with Time Windows. 179-207 2003 7 J. Comb. Optim. 2 http://dx.doi.org/10.1023/A:1024427114516 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco7.html#ChaovalitwongseKP03 2004-08-23 Fast On-Line/Off-Line Algorithms for Optimal Reinforcement of a Network and its Connections with Principal Partition. 45-68 2003 7 J. Comb. Optim. 1 http://dx.doi.org/10.1023/A:1021994406231 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco7.html#PatkarN03 2004-02-05 Genetic Algorithm for Graph Coloring: Exploration of Galinier and Hao's Algorithm. 229-236 2003 7 J. Comb. Optim. 3 http://dx.doi.org/10.1023/A:1027312403532 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco7.html#GlassP03 2004-02-05 Zero-Lifting for Integer Block Structured Problems. 161-167 2003 7 J. Comb. Optim. 2 http://dx.doi.org/10.1023/A:1024423013607 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco7.html#FeliciG03 2004-02-05 On Inverse Problems of Optimum Perfect Matching. 215-228 2003 7 J. Comb. Optim. 3 http://dx.doi.org/10.1023/A:1027305419461 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco7.html#LiuZ03 2004-02-05 Any Maximal Planar Graph with Only One Separating Triangle is Hamiltonian. 79-86 2003 7 J. Comb. Optim. 1 http://dx.doi.org/10.1023/A:1021998507140 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco7.html#Chen03 2004-02-05 Cropped Cubes. 169-178 2003 7 J. Comb. Optim. 2 http://dx.doi.org/10.1023/A:1024475030446 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco7.html#Lee03 2004-02-05 An Edge-Splitting Algorithm in Planar Graphs. 137-159 2003 7 J. Comb. Optim. 2 http://dx.doi.org/10.1023/A:1024470929537 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco7.html#NagamochiE03 2005-03-18 DNA Screening, Pooling Design and Simplicial Complex. 389-394 2003 7 J. Comb. Optim. 4 http://www.springerlink.com/index/10.1023/B:JOCO.0000017388.06583.04 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco7.html#ParkWLWZ03 2005-03-18 The Incremental Group Testing Model for Gap Closing in Sequencing Long Molecules. 327-337 2003 7 J. Comb. Optim. 4 http://www.springerlink.com/index/10.1023/B:JOCO.0000017381.11696.c6 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco7.html#HwangL03 2005-03-18 Decoding in Pooling Designs. 385-388 2003 7 J. Comb. Optim. 4 http://www.springerlink.com/index/10.1023/B:JOCO.0000017387.34879.58 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco7.html#WuLWH03 2005-03-18 A Note on Decoding of Superimposed Codes. 381-384 2003 7 J. Comb. Optim. 4 http://www.springerlink.com/index/10.1023/B:JOCO.0000017386.09330.70 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco7.html#HuangW03 2005-03-18 Exordium for DNA Codes. 369-379 2003 7 J. Comb. Optim. 4 http://www.springerlink.com/index/10.1023/B:JOCO.0000017385.39168.0d http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco7.html#DyachkovEMRTTVW03 2005-03-18 The Independence Number of Graphs with a Forbidden Cycle and Ramsey Numbers. 353-359 2003 7 J. Comb. Optim. 4 http://www.springerlink.com/index/10.1023/B:JOCO.0000017383.13275.17 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco7.html#LiZ03 2005-03-18 Trivial Two-Stage Group Testing with High Error Rates. 361-368 2003 7 J. Comb. Optim. 4 http://www.springerlink.com/index/10.1023/B:JOCO.0000017384.94868.45 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco7.html#Macula03 2005-03-18 Random Pooling Designs Under Various Structures. 339-352 2003 7 J. Comb. Optim. 4 http://www.springerlink.com/index/10.1023/B:JOCO.0000017382.83399.0b http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco7.html#HwangL03a 2005-03-18 Minimum elsilon-equivalent Circuit Size Problem. 495-502 2004 8 J. Comb. Optim. 4 http://www.springerlink.com/index/10.1007/s10878-004-4839-5 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco8.html#ProkopyevP04a 2005-03-18 Inverse Combinatorial Optimization: A Survey on Problems, Methods, and Results. 329-361 2004 8 J. Comb. Optim. 3 http://www.springerlink.com/index/10.1023/B:JOCO.0000038914.26975.9b http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco8.html#Heuberger04 2005-03-18 Comments on the Paper: Attacking the Market Split Problem with Lattice Point Enumeration. 147-149 2004 8 J. Comb. Optim. 2 http://www.springerlink.com/index/10.1023/B:JOCO.0000031416.70875.00 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco8.html#Aardal04 2005-03-18 Protein Threading by Linear Programming: Theoretical Analysis and Computational Results. 403-418 2004 8 J. Comb. Optim. 4 http://www.springerlink.com/index/10.1007/s10878-004-4834-x http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco8.html#XuLX04 2005-03-18 On Approximability of Boolean Formula Minimization. 129-135 2004 8 J. Comb. Optim. 2 http://www.springerlink.com/index/10.1023/B:JOCO.0000031414.39556.3a http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco8.html#ProkopyevP04 2005-03-18 Algorithm for the Cost Edge-Coloring of Trees. 97-108 2004 8 J. Comb. Optim. 1 http://www.springerlink.com/index/10.1023/B:JOCO.0000021940.40066.0c http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco8.html#ZhouN04 2005-03-18 Models and Bounds for Two-Dimensional Level Packing Problems. 363-379 2004 8 J. Comb. Optim. 3 http://www.springerlink.com/index/10.1023/B:JOCO.0000038915.62826.79 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco8.html#LodiMV04 2005-03-18 Improved Dynamic Programming in Connection with an FPTAS for the Knapsack Problem. 5-11 2004 8 J. Comb. Optim. 1 http://www.springerlink.com/index/10.1023/B:JOCO.0000021934.29833.6b http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco8.html#KellererP04 2005-03-18 A Novel Evolutionary Formulation of the Maximum Independent Set Problem. 419-437 2004 8 J. Comb. Optim. 4 http://www.springerlink.com/index/10.1007/s10878-004-4835-9 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco8.html#BarbosaC04 2005-03-18 Logical Constraints as Cardinality Rules: Tight Representation. 115-128 2004 8 J. Comb. Optim. 2 http://www.springerlink.com/index/10.1023/B:JOCO.0000031413.33955.62 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco8.html#Balas04 2005-03-18 Minimal Tetrahedralizations of a Class of Polyhedra. 241-265 2004 8 J. Comb. Optim. 3 http://www.springerlink.com/index/10.1023/B:JOCO.0000038910.06360.0a http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco8.html#YangW04 2005-03-18 A Multi-Exchange Neighborhood for Minimum Makespan Parallel Machine Scheduling Problems. 195-220 2004 8 J. Comb. Optim. 2 http://www.springerlink.com/index/10.1023/B:JOCO.0000031420.05971.29 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco8.html#FrangioniNS04 2005-03-18 Even Cycles and Perfect Matching Problems with Side Constraints. 381-396 2004 8 J. Comb. Optim. 3 http://www.springerlink.com/index/10.1023/B:JOCO.0000038916.51082.5e http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco8.html#FernandezM04 2005-03-18 b-Tree Facets for the Simple Graph Partitioning Polytope. 151-170 2004 8 J. Comb. Optim. 2 http://www.springerlink.com/index/10.1023/B:JOCO.0000031417.96218.26 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco8.html#Sorensen04 2005-03-18 Dynamic Programming and Hill-Climbing Techniques for Constrained Two-Dimensional Cutting Stock Problems. 65-84 2004 8 J. Comb. Optim. 1 http://www.springerlink.com/index/10.1023/B:JOCO.0000021938.49750.91 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco8.html#Hifi04 2005-03-18 Batch-Processing Scheduling with Setup Times. 137-146 2004 8 J. Comb. Optim. 2 http://www.springerlink.com/index/10.1023/B:JOCO.0000031415.55216.2a http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco8.html#DangK04 2005-03-18 The Minimal Spanning Tree Preservation Approaches for DNA Multiple Sequence Alignment and Evolutionary Tree Construction. 453-468 2004 8 J. Comb. Optim. 4 http://www.springerlink.com/index/10.1007/s10878-004-4837-7 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco8.html#ShyuTL04 2005-03-18 Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee. 307-328 2004 8 J. Comb. Optim. 3 http://www.springerlink.com/index/10.1023/B:JOCO.0000038913.96607.c2 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco8.html#AgeevS04 2005-04-07 Two Novel Evolutionary Formulations of the Graph Coloring Problem. 41-63 2004 8 J. Comb. Optim. 1 http://www.springerlink.com/index/10.1023/B:JOCO.0000021937.26468.b2 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco8.html#BarbosaAN04 2005-03-18 Flow Shop Scheduling Problems Under Machine-Dependent Precedence Constraints. 13-28 2004 8 J. Comb. Optim. 1 http://www.springerlink.com/index/10.1023/B:JOCO.0000021935.66577.09 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco8.html#GladkySS04 2005-03-18 A Further Improved Approximation Algorithm for Breakpoint Graph Decomposition. 183-194 2004 8 J. Comb. Optim. 2 http://www.springerlink.com/index/10.1023/B:JOCO.0000031419.12290.2b http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco8.html#LinJ04 2005-03-18 On Combinatorial Approximation of Covering 0-1 Integer Programs and Partial Set Cover. 439-452 2004 8 J. Comb. Optim. 4 http://www.springerlink.com/index/10.1007/s10878-004-4836-8 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco8.html#Fujito04 2005-03-18 From Linear to Semidefinite Programming: An Algorithm to Obtain Semidefinite Relaxations for Bivalent Quadratic Problems. 469-493 2004 8 J. Comb. Optim. 4 http://www.springerlink.com/index/10.1007/s10878-004-4838-6 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco8.html#Roupin04 2005-03-18 Vertex and Tree Arboricities of Graphs. 295-306 2004 8 J. Comb. Optim. 3 http://www.springerlink.com/index/10.1023/B:JOCO.0000038912.82046.17 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco8.html#ChangCC04 2005-03-18 Equal Processing Time Bicriteria Scheduling on Parallel Machines. 227-240 2004 8 J. Comb. Optim. 3 http://www.springerlink.com/index/10.1023/B:JOCO.0000038909.06086.ed http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco8.html#SarinP04 2005-03-18 On Approximate Graph Colouring and MAX-k-CUT Algorithms Based on the theta-Function. 267-294 2004 8 J. Comb. Optim. 3 http://www.springerlink.com/index/10.1023/B:JOCO.0000038911.67280.3f http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco8.html#KlerkPW04 2005-03-18 On-Line Scheduling a Batch Processing System to Minimize Total Weighted Job Completion Time. 85-95 2004 8 J. Comb. Optim. 1 http://www.springerlink.com/index/10.1023/B:JOCO.0000021939.01674.1f http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco8.html#ChenDZ04 2005-03-18 Weighted Inverse Minimum Spanning Tree Problems Under Hamming Distance. 91-100 2005 9 J. Comb. Optim. 1 http://www.springerlink.com/index/10.1007/s10878-005-5486-1 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco9.html#HeZY05 2005-03-18 Average-Case Performance Analysis of a 2D Strip Packing Algorithm-NFDH. 19-34 2005 9 J. Comb. Optim. 1 http://www.springerlink.com/index/10.1007/s10878-005-5481-6 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco9.html#GuCX05 2005-03-18 Separating Type-I Odd-Cycle Inequalities for a Binary-Encoded Edge-Coloring Formulation. 59-67 2005 9 J. Comb. Optim. 1 http://www.springerlink.com/index/10.1007/s10878-005-5484-3 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco9.html#LeeLV05 2005-03-18 Scheduling in Switching Networks with Set-Up Delays. 49-57 2005 9 J. Comb. Optim. 1 http://www.springerlink.com/index/10.1007/s10878-005-5483-4 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco9.html#AfratiABM05 2005-03-18 Requiring Connectivity in the Set Covering Problem. 35-47 2005 9 J. Comb. Optim. 1 http://www.springerlink.com/index/10.1007/s10878-005-5482-5 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco9.html#CerdeiraP05 2005-03-18 Two Variations of the Minimum Steiner Problem. 101-120 2005 9 J. Comb. Optim. 1 http://www.springerlink.com/index/10.1007/s10878-005-5487-0 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco9.html#HsuTWL05 2005-03-18 Efficient Algorithms and Implementations for Optimizing the Sum of Linear Fractional Functions, with Applications. 69-90 2005 9 J. Comb. Optim. 1 http://www.springerlink.com/index/10.1007/s10878-005-5485-2 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco9.html#ChenDDKWX05 2005-03-18 A PTAS for Semiconductor Burn-in Scheduling. 5-17 2005 9 J. Comb. Optim. 1 http://www.springerlink.com/index/10.1007/s10878-005-5480-7 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco9.html#DengFLS05 2005-03-18 Order Consolidation for Batch Processing. 121-138 2005 9 J. Comb. Optim. 1 http://www.springerlink.com/index/10.1007/s10878-005-5488-z http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco9.html#HwangC05 2006-01-12 Robotic-Cell Scheduling: Special Polynomially Solvable Cases of the Traveling Salesman Problem on Permuted Monge Matrices. 381-399 2005 9 J. Comb. Optim. 4 http://dx.doi.org/10.1007/s10878-005-1778-8 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco9.html#DeinekoSX05 2006-01-12 The Polymatroid Steiner Problems. 281-294 2005 9 J. Comb. Optim. 3 http://dx.doi.org/10.1007/s10878-005-1412-9 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco9.html#CalinescuZ05 2006-11-09 A Framework for the Complexity of High-Multiplicity Scheduling Problems. 313-323 2005 9 J. Comb. Optim. 3 http://dx.doi.org/10.1007/s10878-005-1414-7 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco9.html#BraunerCGK05 2006-01-12 Broadcast Routing with Minimum Wavelength Conversion in WDM Optical Networks. 223-235 2005 9 J. Comb. Optim. 2 http://dx.doi.org/10.1007/s10878-005-6859-1 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco9.html#RuanW05 2006-01-12 The Center Location Improvement Problem Under the Hamming Distance. 187-198 2005 9 J. Comb. Optim. 2 http://dx.doi.org/10.1007/s10878-005-6856-4 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco9.html#ZhangZH05 2006-01-12 <i>k</i>-Tree Routing. 349-356 2005 9 J. Comb. Optim. 4 http://dx.doi.org/10.1007/s10878-005-1776-x http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco9.html#Lin05 2006-01-12 Perfect Circular Arc Coloring. 267-280 2005 9 J. Comb. Optim. 3 http://dx.doi.org/10.1007/s10878-005-1411-x http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco9.html#ChenHZ05 2006-01-12 Finding a Length-Constrained Maximum-Density Path in a Tree. 147-156 2005 9 J. Comb. Optim. 2 http://dx.doi.org/10.1007/s10878-005-6853-7 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco9.html#LinKC05 2006-01-12 On Approximation Ratios of Minimum-Energy Multicast Routing in Wireless Networks. 243-262 2005 9 J. Comb. Optim. 3 http://dx.doi.org/10.1007/s10878-005-1409-4 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco9.html#CaiZ05 2006-01-12 On 3-Stage Clos Networks with Different Nonblocking Requirements on Two Types of Calls. 263-266 2005 9 J. Comb. Optim. 3 http://dx.doi.org/10.1007/s10878-005-1410-y http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco9.html#FuH05 2006-01-12 A Combinatorial Algorithm for Minimum Weighted Colorings of Claw-Free Perfect Graphs. 331-347 2005 9 J. Comb. Optim. 4 http://dx.doi.org/10.1007/s10878-005-1775-y http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco9.html#LiZ05 2006-01-12 The 2-Edge-Connected Subgraph Polyhedron. 357-379 2005 9 J. Comb. Optim. 4 http://dx.doi.org/10.1007/s10878-005-1777-9 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco9.html#VandenbusscheN05 2006-01-12 Clustering Binary Oligonucleotide Fingerprint Vectors for DNA Clone Classification Analysis. 199-211 2005 9 J. Comb. Optim. 2 http://dx.doi.org/10.1007/s10878-005-6857-3 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco9.html#CaiHL05 2006-01-13 A Tighter Extra-Resource Analysis of Online Deadline Scheduling. 157-165 2005 9 J. Comb. Optim. 2 http://dx.doi.org/10.1007/s10878-005-6854-6 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco9.html#LamNT05 2006-04-19 On the Hardness of Approximating the Min-Hack Problem. 295-311 2005 9 J. Comb. Optim. 3 http://dx.doi.org/10.1007/s10878-005-1413-8 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco9.html#ChinchaniHINU05 2006-01-12 On-Line Scheduling Algorithms for a Batch Machine with Finite Capacity. 167-186 2005 9 J. Comb. Optim. 2 http://dx.doi.org/10.1007/s10878-005-6855-5 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco9.html#PoonY05 2006-01-12 An Improved Randomized Approximation Algorithm for Max TSP. 401-432 2005 9 J. Comb. Optim. 4 http://dx.doi.org/10.1007/s10878-005-1779-7 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco9.html#ChenW05 2006-01-12 <i>k</i>-Connectivity in Wireless Ad Hoc Networks. 213-222 2005 9 J. Comb. Optim. 2 http://dx.doi.org/10.1007/s10878-005-6858-2 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco9.html#JiaKMWY05 2006-01-12 The Wheels of the Orthogonal Latin Squares Polytope: Classification and Valid Inequalities. 365-389 2005 10 J. Comb. Optim. 4 http://dx.doi.org/10.1007/s10878-005-4924-4 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco10.html#AppaMM05 2006-10-25 An Approximation for Minimum Multicast Route in Optical Networks with Nonsplitting Nodes. 391-394 2005 10 J. Comb. Optim. 4 http://dx.doi.org/10.1007/s10878-005-4925-3 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco10.html#GuoWWT05 2006-01-12 Preemptive Machine Covering on Parallel Machines. 345-363 2005 10 J. Comb. Optim. 4 http://dx.doi.org/10.1007/s10878-005-4923-5 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco10.html#JiangTH05 2006-06-30 Ant Colony System for a Dynamic Vehicle Routing Problem. 327-343 2005 10 J. Comb. Optim. 4 http://dx.doi.org/10.1007/s10878-005-4922-6 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco10.html#MontemanniGRD05 2006-01-12 An Algorithm for the Maximum Likelihood Problem on Evolutionary Trees. 61-75 2005 10 J. Comb. Optim. 1 http://dx.doi.org/10.1007/s10878-005-1860-2 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco10.html#Oliveira05 2006-01-12 Improved Approximation Algorithms for Maximum Graph Partitioning Problems. 133-167 2005 10 J. Comb. Optim. 2 http://dx.doi.org/10.1007/s10878-005-2269-7 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco10.html#JagerS05 2006-01-12 Penta-Extensions of Hereditary Classes of Graphs. 169-178 2005 10 J. Comb. Optim. 2 http://dx.doi.org/10.1007/s10878-005-2271-0 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco10.html#ZverovichZ05 2006-01-12 Editorial. 5-5 2005 10 J. Comb. Optim. 1 http://dx.doi.org/10.1007/s10878-005-3696-1 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco10.html#Pardalos05 2006-03-08 Computational Comparison Studies of Quadratic Assignment Like Formulations for the In Silico Sequence Selection Problem in De Novo Protein Design. 41-60 2005 10 J. Comb. Optim. 1 http://dx.doi.org/10.1007/s10878-005-1859-8 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco10.html#FungRFPPR05 2006-01-12 Vertices Contained in all or in no Minimum Paired-Dominating Set of a Tree. 283-294 2005 10 J. Comb. Optim. 3 http://dx.doi.org/10.1007/s10878-005-4107-3 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco10.html#HenningP05 2006-01-12 Efficient Algorithms for Determining 3-D Bi-Plane Imaging Geometry. 113-132 2005 10 J. Comb. Optim. 2 http://dx.doi.org/10.1007/s10878-005-2266-x http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco10.html#XuXCSH05 2006-01-12 Feature Selection for Consistent Biclustering via Fractional 0-1 Programming. 7-21 2005 10 J. Comb. Optim. 1 http://dx.doi.org/10.1007/s10878-005-1856-y http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco10.html#BusyginPP05 2006-01-12 Testing Systems of Identical Components. 261-282 2005 10 J. Comb. Optim. 3 http://dx.doi.org/10.1007/s10878-005-4106-4 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco10.html#Unluyurt05 2006-01-12 Efficient Job Scheduling Algorithms with Multi-Type Contentions. 179-197 2005 10 J. Comb. Optim. 2 http://dx.doi.org/10.1007/s10878-005-2272-z http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco10.html#ChenSX05 2006-01-12 Novel Approaches for Analyzing Biological Networks. 23-39 2005 10 J. Comb. Optim. 1 http://dx.doi.org/10.1007/s10878-005-1857-x http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco10.html#BalasundaramBT05 2006-01-12 Clustering of Microarray data via Clique Partitioning. 77-92 2005 10 J. Comb. Optim. 1 http://dx.doi.org/10.1007/s10878-005-1861-1 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco10.html#KochenbergerGAW05 2006-01-12 On Split-Coloring Problems. 211-225 2005 10 J. Comb. Optim. 3 http://dx.doi.org/10.1007/s10878-005-4103-7 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco10.html#EkimW05 2006-01-12 A Hybrid Genetic-GRASP Algorithm Using Lagrangean Relaxation for the Traveling Salesman Problem. 311-326 2005 10 J. Comb. Optim. 4 http://dx.doi.org/10.1007/s10878-005-4921-7 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco10.html#MarinakisMP05 2006-01-12 A Note on Balancedness of Dominating Set Games. 303-310 2005 10 J. Comb. Optim. 4 http://dx.doi.org/10.1007/s10878-005-4920-8 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco10.html#FangK05 2006-10-25 A Note on Optical Network with Nonsplitting Nodes. 199-202 2005 10 J. Comb. Optim. 2 http://dx.doi.org/10.1007/s10878-005-2273-y http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco10.html#DuJWTL05 2006-01-12 Efficient Solutions for Special Zero-One Programming Problems. 227-238 2005 10 J. Comb. Optim. 3 http://dx.doi.org/10.1007/s10878-005-4104-6 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco10.html#BilitzkyS05 2006-02-07 Sensitivity of the Optimum to Perturbations of the Profit or Weight of an Item in the Binary Knapsack Problem. 239-260 2005 10 J. Comb. Optim. 3 http://dx.doi.org/10.1007/s10878-005-4105-5 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco10.html#HifiMS05 2006-01-12 Maximizing Profits of Routing in WDM Networks. 99-111 2005 10 J. Comb. Optim. 2 http://dx.doi.org/10.1007/s10878-005-2263-0 http://www.informatik.uni-trier.de/~ley/db/journals/jco/jco10.html#LiLWZ05 2004-06-04 Relations, Dependencies and Some Problems of System Theory. 267-285 1989 47 Inf. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/isci/isci47.html#GusevPT89 http://dx.doi.org/10.1016/0020-0255(89)90004-2 2004-06-04 Valuations in Incomplete Information Databases. 389-398 1989 47 Inf. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/isci/isci47.html#Brudno89 http://dx.doi.org/10.1016/0020-0255(89)90008-X 2004-06-02 Two Pase Gossip: Managing Distributed Event Histories. 35-57 1989 49 Inf. Sci. 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/isci/isci49.html#HeddayaHW89 http://dx.doi.org/10.1016/0020-0255(89)90023-6 2004-06-04 Finite Axiomatisation of Languages for Representation of System Properties. 339-372 1989 47 Inf. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/isci/isci47.html#Petrov89 http://dx.doi.org/10.1016/0020-0255(89)90006-6 2004-06-04 Implementing Imprecision in Information Systems. 107-141 1985 37 1-3 Inf. Sci. http://dx.doi.org/10.1016/0020-0255(85)90008-8 http://www.informatik.uni-trier.de/~ley/db/journals/isci/isci37.html#Zemankova85 2004-06-04 Relational Decomposition and Structural Analysis of Systems. 287-338 1989 47 Inf. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/isci/isci47.html#Tenenbaum89 http://dx.doi.org/10.1016/0020-0255(89)90005-4 2005-08-04 A Temporal Relational Model and a Query Language. 147-175 1989 49 Inf. Sci. 1-3 http://www.informatik.uni-trier.de/~ley/db/journals/isci/isci49.html#NavatheA89 http://dx.doi.org/10.1016/0020-0255(89)90026-1 2004-06-04 Generalizing Database Relational Algebra for the Treatment of Incomplete/Uncertain Information and Vague Queries. 115-143 1984 34 2 Inf. Sci. http://www.informatik.uni-trier.de/~ley/db/journals/isci/isci34.html#PradeT84 http://dx.doi.org/10.1016/0020-0255(84)90020-3 2004-06-04 Join Dependencies in Database Design. 373-387 1989 47 Inf. Sci. 3 http://www.informatik.uni-trier.de/~ley/db/journals/isci/isci47.html#Gorchinskaya89 http://dx.doi.org/10.1016/0020-0255(89)90007-8 2002-01-25 Relations Between Secrets: Two Formal Analyses of the Yahalom Protocol. 197-216 2001 9 Journal of Computer Security 3 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs9.html#Paulson01 2002-01-03 A Ticket-Based Access Control Architecture for Object Systems. 2000 8 Journal of Computer Security 1 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs8.html#HaleTS00 2002-01-03 Side Channel Cryptanalysis of Product Ciphers. 2000 8 Journal of Computer Security 2/3 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs8.html#KelseySWH00 2003-05-02 Inductive Verification of Smart Card Protocols. 87-132 2003 11 Journal of Computer Security 1 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs11.html#Bella03 2002-01-03 Fault-Preserving Simplifying Transformations for Security Protocols. 3-46 2001 9 Journal of Computer Security 1/2 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs9.html#HuiL01 2002-01-03 Authentication and Payment in Future Mobile Systems. 2000 8 Journal of Computer Security 2/3 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs8.html#HornP00 2003-05-02 A Comparative Experimental Evaluation Study of Intrusion Detection System Performance in a Gigabit Environment. 1-33 2003 11 Journal of Computer Security 1 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs11.html#IheagwaraBS03 2003-05-02 Distributed Credential Chain Discovery in Trust Management. 35-86 2003 11 Journal of Computer Security 1 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs11.html#LiWM03 2003-05-02 Model-Based Analysis of Configuration Vulnerabilities. 189-209 2002 10 Journal of Computer Security 1/2 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs10.html#RamakrishnanS02 2002-01-03 Towards a Completeness Result for Model Checking of Security Protocols. 1999 7 Journal of Computer Security 1 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs7.html#Lowe99 2003-05-02 Panoptis: Intrusion Detection Using a Domain-Specific Language. 159-176 2002 10 Journal of Computer Security 1/2 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs10.html#SpinellisG02 2002-10-28 Proving Security Protocols with Model Checkers by Data Independence Techniques. 1999 7 Journal of Computer Security 1 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs7.html#RoscoeB99 2002-01-03 Fixed- vs. Variable-Length Patterns for Detecting Suspicious Process Behavior. 2000 8 Journal of Computer Security 2/3 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs8.html#WespiDDN00 2004-04-27 Automated Derivation of Global Authorizations for Database Federations. 1997 5 Journal of Computer Security 4 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs5.html#CastanoVF97 271-302 2003-05-02 Hordes: a Multicast-Based Protocol for Anonymity. 213-240 2002 10 Journal of Computer Security 3 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs10.html#LevineS02 2003-05-02 Toward Cost-Sensitive Modeling for Intrusion Detection and Response. 5-22 2002 10 Journal of Computer Security 1/2 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs10.html#LeeFMSZ02 2003-05-02 STATL: An Attack Language for State-Based Intrusion Detection. 71-104 2002 10 Journal of Computer Security 1/2 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs10.html#EckmannVK02 2003-05-02 Manageable Access Control for CORBA. 301-338 2002 10 Journal of Computer Security 4 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs10.html#Brose02 2002-01-03 Probabilistic Noninterference in a Concurrent Language. 1999 7 Journal of Computer Security 1 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs7.html#VolpanoS99 2002-01-03 A Logic-Based Approach for Enforcing Access Control. 2000 8 Journal of Computer Security 2/3 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs8.html#BertinoBFR00 2002-01-03 Temporal Authorization Bases: From Specification to Integration. 2000 8 Journal of Computer Security 4 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs8.html#BertinoBFS00 2003-12-11 Verified Formal Security Models for Multiapplicative Smart Cards. 339-368 2002 10 Journal of Computer Security 4 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs10.html#SchellhornRSKAT02 2002-01-03 Intrusion Detection Using Sequences of System Calls. 151-180 1998 6 Journal of Computer Security 3 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs6.html#HofmeyrFS98 2004-04-27 A Logical View of Secure Dependencies. 1992 1 Journal of Computer Security 1 99-130 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs1.html#BieberC92 2002-01-03 Using Sample Size to Limit Exposure to Data Mining. 2000 8 Journal of Computer Security 4 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs8.html#Clifton00 2002-01-03 Modeling, Specifying and Implementing Workflow Security in Cyberspace. 1999 7 Journal of Computer Security 4 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs7.html#GudesOR99 2002-01-03 A Semantic-Based Transaction Processing Model for Multilevel Transactions. 181-217 1998 6 Journal of Computer Security 3 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs6.html#RayAJ98 2004-03-03 Human-Computer Cryptography: An Attempt. 1998 6 Journal of Computer Security 3 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs6.html#Matsumoto98 129-150 2002-03-15 Model Checking Security Properties of Control Flow Graphs. 217-250 2001 9 Journal of Computer Security 3 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs9.html#BessonJM01 2003-05-02 A Uniform Framework for Regulating Service Access and Information Release on the Web. 241-272 2002 10 Journal of Computer Security 3 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs10.html#BonattiS02 2003-05-02 An Environment for Security Protocol Intrusion Detection. 177-188 2002 10 Journal of Computer Security 1/2 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs10.html#Yasinsac02 2003-05-02 Practical Automated Detection of Stealthy Portscans. 105-136 2002 10 Journal of Computer Security 1/2 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs10.html#StanifordHM02 2003-05-02 Enhancing Profiles for Anomaly Detection Using Time Granularities. 137-158 2002 10 Journal of Computer Security 1/2 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs10.html#LiWWJ02 2002-01-03 Strand Spaces: Proving Security Protocols Correct. 1999 7 Journal of Computer Security 1 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs7.html#ThayerHG99 2002-01-03 Intrusion Confinement by Isolation in Information Systems. 2000 8 Journal of Computer Security 4 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs8.html#LiuJM00 2002-01-03 A Note on the Randomness in Dynamic Threshold Schemes. 73-85 1999 7 Journal of Computer Security 1 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs7.html#BlundoM99 2004-04-27 Towards a Definitive Paradigm for Security in Object-Oriented Systems and Applications. 1997 5 Journal of Computer Security 4 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs5.html#DemurjianT97 341-382 2002-01-03 Role-based Administration of User-Role Assignment: The URA97 Model and its Oracle Implementation. 1999 7 Journal of Computer Security 4 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs7.html#SandhuB99 2006-05-03 Checking Secure Interactions of Smart Card Applets: Extended Version. 369-398 2002 10 Journal of Computer Security 4 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs10.html#BieberCGLWZ02 2002-01-03 A Cost-Based Framework for Analysis of Denial of Service Networks. 143-164 2001 9 Journal of Computer Security 1/2 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs9.html#Meadows01 2004-04-27 Applying Formal Methods to the Analysis of a Key Management Protocol. 1992 1 Journal of Computer Security 1 5-36 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs1.html#Meadows92 2002-01-03 NetSTAT: A Network-based Intrusion Detection System. 1999 7 Journal of Computer Security 1 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs7.html#VignaK99 2002-01-03 Authorization in CORBA Security. 2000 8 Journal of Computer Security 2/3 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs8.html#Karjoth00 2006-03-14 Process Algebra and Non-Interference. 75-103 2001 9 Journal of Computer Security 1/2 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs9.html#RyanS01 2002-01-03 A Petri Net Based Safety Analysis of Workflow Authorization Models. 2000 8 Journal of Computer Security 2/3 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs8.html#AtluriH00 2004-04-27 Enforcing Mandatory and Discretionary Security in Workflow Management Systems. 1997 5 Journal of Computer Security 4 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs5.html#AtluriH97 303-340 2003-05-02 Using Reflection as a Mechanism for Enforcing Security Policies on Compiled Code. 399-432 2002 10 Journal of Computer Security 4 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs10.html#WelchS02 2004-04-27 Expressive Power of the Schematic Protection Model. 1992 1 Journal of Computer Security 1 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs1.html#Sandhu92 59-98 2002-01-03 Athena: A Novel Approach to Efficient Automatic Security Protocol Analysis. 47-74 2001 9 Journal of Computer Security 1/2 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs9.html#SongBP01 2002-01-03 A Logic for SDSI's Linked Local Name Spaces. 105-142 2001 9 Journal of Computer Security 1/2 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs9.html#HalpernM01 2002-01-03 A Semantic-Based Execution Model for Multilevel Secure Workflows. 2000 8 Journal of Computer Security 1 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs8.html#AtluriHB00 2004-04-27 Proving Noninterference and Functional Correctness Using Traces. 1992 1 Journal of Computer Security 1 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs1.html#McLean92 37-58 2002-01-25 Multilevel Security Transaction Processing. 165-195 2001 9 Journal of Computer Security 3 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs9.html#JajodiaAKMM01 2002-01-03 Secure Object Deletion and Garbage Collection in Multilevel Object Bases. 1999 7 Journal of Computer Security 4 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs7.html#BertinoF99 2002-01-03 Structured Name-Spaces in Secure Databases. 2000 8 Journal of Computer Security 1 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs8.html#SpalkaC00 2003-05-02 Using Internal Sensors and Embedded Detectors for Intrusion Detection. 23-70 2002 10 Journal of Computer Security 1/2 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs10.html#KerschbaumSZ02 2003-05-02 Eliminating Counterevidence with Applications to Accountable Certificate Management. 273-296 2002 10 Journal of Computer Security 3 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs10.html#BuldasLL02 2002-01-03 Identification of Host Audit Data to Detect Attacks on Low-level IP Vulnerabilities. 3-35 1999 7 Journal of Computer Security 1 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs7.html#DanielsS99 2004-03-03 A Compositional Logic for Proving Security Properties of Protocols. 677-722 2003 11 Journal of Computer Security 4 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs11.html#DurginMP03 2004-03-03 Authentic Data Publication Over the Internet. 291-314 2003 11 Journal of Computer Security 3 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs11.html#DevanbuGMS03 2004-03-03 A Game-based Verification of Non-repudiation and Fair Exchange Protocols. 399-430 2003 11 Journal of Computer Security 3 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs11.html#KremerR03 2004-03-03 The Economic Cost of Publicly Announced Information Security Breaches: Empirical Evidence from the Stock Market. 431-448 2003 11 Journal of Computer Security 3 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs11.html#CampbellGLZ03 2004-03-03 A Checksum-based Corruption Detection Technique. 315-330 2003 11 Journal of Computer Security 3 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs11.html#BarbaraGJ03 2004-03-03 Programmable Access Control. 331-352 2003 11 Journal of Computer Security 3 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs11.html#HalePS03 2004-03-03 A Logical Reconstruction of SPKI. 581-614 2003 11 Journal of Computer Security 4 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs11.html#HalpernM03 2004-03-03 Authenticity by Typing for Security Protocols. 451-520 2003 11 Journal of Computer Security 4 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs11.html#GordonJ03 2004-03-03 Secure Mediation: Requirements, Design, and Architecture. 365-398 2003 11 Journal of Computer Security 3 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs11.html#AltenschmidtBFK03 2004-03-03 Reasoning About Secrecy for Active Networks. 245-287 2003 11 Journal of Computer Security 2 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs11.html#KakkarGA03 2004-03-03 How to Prevent Type Flaw Attacks on Security Protocols. 217-244 2003 11 Journal of Computer Security 2 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs11.html#HeatherLS03 2004-03-03 First-order Verification of Cryptographic Protocols. 189-216 2003 11 Journal of Computer Security 2 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs11.html#Cohen03 2004-03-03 Secure Composition of Untrusted Code: Box pi, Wrappers, and Causality. 135-188 2003 11 Journal of Computer Security 2 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs11.html#SewellV03 2004-03-03 A Unifying Approach to the Security of Distributed and Multi-Threaded Programs. 615-676 2003 11 Journal of Computer Security 4 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs11.html#MantelS03 2004-03-03 Logical Relations for Encryption. 521-554 2003 11 Journal of Computer Security 4 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs11.html#SumiiP03 2004-03-03 Some Attacks Upon Authenticated Group Key Agreement Protocols. 555-580 2003 11 Journal of Computer Security 4 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs11.html#PereiraQ03 2004-03-03 WorkFlow Analyzed for Security and Privacy in Using Databases. 353-364 2003 11 Journal of Computer Security 3 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs11.html#TeepeRO03 2004-03-03 Approximate Non-interference. 37-82 2004 12 Journal of Computer Security 1 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs12.html#PierroHW04 2004-03-03 Completeness Theorems for the Abadi-Rogaway Language of Encrypted Expressions. 99-130 2004 12 Journal of Computer Security 1 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs12.html#MicciancioW04 2004-03-03 Reconstructing Trust Management. 131-164 2004 12 Journal of Computer Security 1 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs12.html#ChanderDM04 2004-03-03 Analysing Protocol Subject to Guessing Attacks. 83-98 2004 12 Journal of Computer Security 1 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs12.html#Lowe04 2004-03-03 Information Hiding, Anonymity and Privacy: a Modular Approach. 3-36 2004 12 Journal of Computer Security 1 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs12.html#HughesS04 2004-03-03 Provable Security for Cryptographic Protocols - Exact Analysis and Engineering Applications. 23-52 1998 6 Journal of Computer Security 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs6.html#GrayIL98 2004-03-03 On SDSI's Linked Local Name Spaces. 3-22 1998 6 Journal of Computer Security 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs6.html#Abadi98 2004-03-03 Enforcing Workflow Authorization Constraints Using Triggers. 257-286 1998 6 Journal of Computer Security 4 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs6.html#CasatiCF98 2004-03-03 Auditable Metering with Lightweight Security. 237-256 1998 6 Journal of Computer Security 4 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs6.html#FranklinM98 2004-03-03 The Inductive Approach to Verifying Cryptographic Protocols. 85-128 1998 6 Journal of Computer Security 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs6.html#Paulson98 2004-03-03 Casper: A Compiler for the Analysis of Security Protocols. 53-84 1998 6 Journal of Computer Security 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs6.html#Lowe98 2006-04-04 In Search of Multiple Domain Key Recovery. 219-236 1998 6 Journal of Computer Security 4 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs6.html#KnudsenM98 2004-04-27 Achieving Stricter Correctness Requirements in Multilevel Secure Database Management Systems. 311-352 1993 2 Journal of Computer Security 4 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs2.html#AtluriBJ93 2004-08-19 Standardising Authentication Protocols Based on Public-Key Techniques. 23-36 1993 2 Journal of Computer Security http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs2.html#MitchellT93 2004-04-27 Optimality of Asynchronous Two-Party Secure Data-Exchange Protocols. 191-210 1993 2 Journal of Computer Security 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs2.html#Yahalom93 2005-02-03 The Cascade Vulnerability Problem. 279-290 1993 2 Journal of Computer Security 4 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs2.html#HortonCHNWHAS93 2004-09-23 Towards Operational Measures of Computer Security. 211-230 1993 2 Journal of Computer Security 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs2.html#LittlewoodBFMPWDMG93 2004-04-27 A Kernelized Architecture for Multilevel Secure Object-Oriented Databases Supporting Write-Up. 231-275 1993 2 Journal of Computer Security 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs2.html#ThomasS93 2004-04-27 Obituary: Fighting for Computer Security - Chris Jahl - in Memoriam. 3-4 1993 2 Journal of Computer Security http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs2.html#Beth93 2005-02-07 A High Assurance Window System Prototype. 159-190 1993 2 Journal of Computer Security 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs2.html#EpsteinMOPMDMBBR93 2004-04-27 Building an Authentication Service for Distributed Systems. 73-84 1993 2 Journal of Computer Security http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs2.html#Lam93 2004-04-27 On Inter-Realm Authentication in Large Distributed Systems. 137-158 1993 2 Journal of Computer Security 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs2.html#GligorLP93 2004-04-27 Laws of Non-Interference in CSP. 37-52 1993 2 Journal of Computer Security http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs2.html#Graham-Cumming93 2004-04-27 Modelling a Fuzzy Time System. 291-310 1993 2 Journal of Computer Security 4 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs2.html#Trostle93 2004-04-27 A Resource Allocation Model for Denial of Service Protection. 89-106 1993 2 Journal of Computer Security 2-3 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs2.html#Millen93 2004-04-27 Information-Theoretic Bounds for Authentication Frauds. 53-64 1993 2 Journal of Computer Security http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs2.html#Sgarro93 2004-04-27 A Simple and Key-Economical Unconditional Authentication Scheme. 65-72 1993 2 Journal of Computer Security http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs2.html#Boer93 2004-11-12 The BirliX Security Architecture. 5-22 1993 2 Journal of Computer Security http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs2.html#HaertigKK93 2004-04-27 The Extended Schematic Protection Model 335-384 1992 1 Journal of Computer Security 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs1.html#AmmannS92 2004-04-27 An Analysis of Covert Timing Channels. 219-232 1992 1 Journal of Computer Security 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs1.html#Wray92 2004-04-27 Aggregation and Separation as Noninterference Properties. 159-188 1992 1 Journal of Computer Security 2 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs1.html#Foley92 2004-04-27 Knowledge, Belief, and Semantics in the Analysis of Cryptographic Protocols. 317-334 1992 1 Journal of Computer Security 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs1.html#Syverson92 2004-04-27 Towards a Theory of Penetration-Resistant Systems and its Applications. 133-158 1992 1 Journal of Computer Security 2 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs1.html#GuptaG92 2004-04-27 SPX: Global Authentication Using Public Key Certificates. 295-316 1992 1 Journal of Computer Security 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs1.html#TardoA92 2004-04-27 Reducing Timing Channels with Fuzzy Time. 233-254 1992 1 Journal of Computer Security 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs1.html#Hu92 2004-04-27 Toward a Mathematical Foundation for Information. 255-294 1992 1 Journal of Computer Security 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs1.html#Gray92 2004-04-27 A Unified Model for Security and Integrity in Relational Databases. 189-213 1992 1 Journal of Computer Security 2 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs1.html#Motro92 2004-04-27 Basic Theorems About Security. 385-412 1992 1 Journal of Computer Security 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs1.html#Jacob92 2004-05-11 Strong Authentication and Privacy with Standard Browsers. 191-212 1997 5 Journal of Computer Security 3 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs5.html#BergadanoCL97 2004-05-11 Merging Heterogeneous Security Orderings. 3-30 1997 5 Journal of Computer Security 1 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs5.html#BonattiSS97 2004-05-11 CWASAR: a European Infrastructure for Secure Electronic Commerce. 225-236 1997 5 Journal of Computer Security 3 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs5.html#BryceKALR97 2004-05-11 Using Digital Credentials on the World Wide Web. 255-266 1997 5 Journal of Computer Security 3 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs5.html#WinslettCJS97 2004-05-11 Authentication of Sequences with the SL2 Hash Function: Application to Video Sequences. 213-224 1997 5 Journal of Computer Security 3 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs5.html#QuisquaterJ97 2004-05-11 A High-Throughput Secure Reliable Multicast Protocol. 113-128 1997 5 Journal of Computer Security 2 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs5.html#MalkhiR97 2004-05-11 Server-Supported Signatures. 91-108 1997 5 Journal of Computer Security 1 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs5.html#AsokanTW97 2004-05-11 Action Systems for Security Specification. 129-154 1997 5 Journal of Computer Security 2 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs5.html#Sinclair97 2004-05-11 Threat Scenarios as a Means to Formally Develop Secure Systems. 31-68 1997 5 Journal of Computer Security 1 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs5.html#Lotz97 2004-05-11 Private Web Browsing. 237-248 1997 5 Journal of Computer Security 3 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs5.html#SyversonRG97 2004-05-11 Authorization Specification and Enforcement in Federated Database Systems. 155-188 1997 5 Journal of Computer Security 2 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs5.html#VimercatiS97 2004-05-11 A Network-Centric Design for Relationship-Based Security and Access Control. 249-254 1997 5 Journal of Computer Security 3 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs5.html#RoscheisenW97 2004-05-11 Digital Payment Systems With Passive Anonymity-Revoking Trustees. 69-90 1997 5 Journal of Computer Security 1 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs5.html#CamenischMS97 2004-05-11 The Omega Key Management Service. 267-288 1996 4 Journal of Computer Security 4 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs4.html#ReiterFLW96 2004-05-11 A Performance Comparison of Five Transaction Processing Algorithms for the SINTRA Replicated-Architecture Database system. 189-228 1996 4 Journal of Computer Security 2/3 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs4.html#McDermottM96 2004-05-11 Beacons for Authentication in Distributed Systems. 81-96 1996 4 Journal of Computer Security 1 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs4.html#JiwaHS96 2004-05-11 Non-interference through Determinism. 27-54 1996 4 Journal of Computer Security 1 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs4.html#RoscoeWW96 2004-05-11 Securing ATM Networks. 289-330 1996 4 Journal of Computer Security 4 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs4.html#Chuang96 2004-05-11 Detecting Illicit Leakage of Information in Operating Systems. 123-148 1996 4 Journal of Computer Security 2/3 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs4.html#ShiehG96 2004-05-11 A Sound Type System for Secure Flow Analysis. 167-188 1996 4 Journal of Computer Security 2/3 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs4.html#VolpanoIS96 2004-05-11 Secure Computer Systems: A Mathematical Model, Volume II. 229-263 1996 4 Journal of Computer Security 2/3 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs4.html#BellL96 2004-05-11 Conspiracy and Information Flow in the Take-Grant Protection Model. 331-360 1996 4 Journal of Computer Security 4 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs4.html#Bishop96 2004-05-11 Implementing Secure Dependencies over a Network by Designing a Distributed Security SubSystem. 3-26 1996 4 Journal of Computer Security 1 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs4.html#dAusbourgC96 2004-05-11 A Calculus for Security Bootstrapping in Distributed Systems. 55-80 1996 4 Journal of Computer Security 1 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs4.html#MaurerS96 2004-05-11 Robust and Secure Password and Key Change Method. 97-112 1996 4 Journal of Computer Security 1 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs4.html#HauserJMTH96 2004-05-11 The Expressive Power of Multi-parent Creation in Monotonic Access Control Models. 149-166 1996 4 Journal of Computer Security 2/3 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs4.html#AmmannLS96 2004-05-11 The Role of Trust in Information Integrity Protocols. 71-84 1995 3 Journal of Computer Security 1 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs3.html#SimmonsM95 2004-05-11 Distributing Trust Amongst Multiple Authentication Servers. 255-268 1995 3 Journal of Computer Security 4 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs3.html#ChenGM95 2004-05-11 Transaction Management for Multilevel Secure Replicated Databases. 115-146 1995 3 Journal of Computer Security 2/3 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs3.html#KangK95 2004-05-11 A Fast Algorithm for Detecting Second Paths in Database Inference Analysis. 147-168 1995 3 Journal of Computer Security 2/3 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs3.html#HinkeDC95 2004-05-11 An Extended Authorization Model for Object Databases. 169-206 1995 3 Journal of Computer Security 2/3 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs3.html#BertinoOS95 2004-05-11 Theft of Information in the Take-Grant Protection Model. 283-308 1995 3 Journal of Computer Security 4 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs3.html#Bishop95 2004-05-11 A State-Machine Approach to Non-Interference. 55-70 1995 3 Journal of Computer Security 1 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs3.html#BevierY95 2004-05-11 A Taxonomy of Security Properties for Process Algebras. 5-34 1995 3 Journal of Computer Security 1 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs3.html#FocardiG95 2004-05-11 Merging Models: Integrity, Dynamic Separation of Duty, and Trusted Data Management. 207-230 1995 3 Journal of Computer Security 2/3 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs3.html#NotargiacomoBM95 2004-05-11 Multiple Key Distribution Maintaining User Anonymity via Broadcast Channels. 309-322 1995 3 Journal of Computer Security 4 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs3.html#BlundoMS95 2004-05-11 Unwinding Forward Correctability. 35-54 1995 3 Journal of Computer Security 1 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs3.html#Millen95 2004-05-11 Concurrency Control in a Secure Database via a Two-Snapshot Algorithm. 87-114 1995 3 Journal of Computer Security 2/3 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs3.html#AmmannJJ95 2004-05-11 The Composability of Non-Interference. 269-282 1995 3 Journal of Computer Security 4 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs3.html#ZakinthinosL95 2004-05-11 Specifying Security for Computer Supported Collaborative Working. 233-254 1995 3 Journal of Computer Security 4 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs3.html#FoleyJ95 2004-05-18 Depender Graphs: A Method of Fault-Tolerant Certificate Distribution. 323-338 2001 9 Journal of Computer Security 4 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs9.html#WrightLM01 2004-05-18 Certificate Chain Discovery in SPKI/SDSI. 285-322 2001 9 Journal of Computer Security 4 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs9.html#ClarkeEEFMR01 2004-05-18 Global Infrastructure Protection System. 251-284 2001 9 Journal of Computer Security 4 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs9.html#VimercatiLRS01 2005-04-05 Formal specification and analysis of the Group Domain Of Interpretation Protocol using NPATRL and the NRL Protocol Analyzer. 893-931 2004 12 Journal of Computer Security 6 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs12.html#MeadowsSC04 2005-04-05 Key management for high bandwidth secure multicast. 693-709 2004 12 Journal of Computer Security 5 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs12.html#PietroMM04 2005-04-05 Cost effective management frameworks for intrusion detection systems. 777-798 2004 12 Journal of Computer Security 5 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs12.html#IheagwaraBS04 2005-04-05 The faithfulness of abstract protocol analysis: Message authentication. 865-891 2004 12 Journal of Computer Security 6 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs12.html#GuttmanTZ04 2005-04-05 A process-algebraic approach for the analysis of probabilistic noninterference. 191-245 2004 12 Journal of Computer Security 2 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs12.html#AldiniBG04 2005-04-05 Authentication tests and disjoint encryption: A design method for security protocols. 409-433 2004 12 Journal of Computer Security 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs12.html#Guttman04 2005-04-05 Chinese wall security for decentralized workflow management systems. 799-840 2004 12 Journal of Computer Security 6 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs12.html#AtluriCM04 2005-04-05 Providing process origin information to aid in computer forensic investigations. 753-776 2004 12 Journal of Computer Security 5 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs12.html#BuchholzS04 2005-04-05 Types and effects for asymmetric cryptographic protocols. 435-483 2004 12 Journal of Computer Security 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs12.html#GordonJ04 2005-04-05 Coordinated Internet attacks: responding to attack complexity. 165-190 2004 12 Journal of Computer Security 2 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs12.html#OurstonMSH04 2005-04-05 A group key recovery mechanism based on logical key hierarchy. 711-736 2004 12 Journal of Computer Security 5 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs12.html#ChoLK04 2005-04-05 Flexible authentication of XML documents. 841-864 2004 12 Journal of Computer Security 6 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs12.html#DevanbuGK04 2005-04-05 A formal model of rational exchange and its application to the analysis of Syverson's protocol. 551-587 2004 12 Journal of Computer Security 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs12.html#ButtyanHC04 2005-04-05 Polynomial liveness. 589-617 2004 12 Journal of Computer Security 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs12.html#BackesPW04 2005-04-05 Probabilistic analysis of an anonymity system. 355-377 2004 12 Journal of Computer Security 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs12.html#Shmatikov04 2005-04-05 Defining information flow quantity. 619-653 2004 12 Journal of Computer Security 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs12.html#Lowe04a 2005-04-05 Research on automated rollbackability of intrusion response. 737-751 2004 12 Journal of Computer Security 5 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs12.html#ZhangGD04 2005-04-05 Model checking SPKI/SDSI. 317-353 2004 12 Journal of Computer Security 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs12.html#JhaR04 2005-04-05 Embedding agents within the intruder to detect parallel attacks. 379-408 2004 12 Journal of Computer Security 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs12.html#BroadfootR04 2005-04-05 Cardinality-based inference control in data cubes. 655-692 2004 12 Journal of Computer Security 5 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs12.html#WangWJ04 2005-04-05 Multiset rewriting and the complexity of bounded security protocols. 247-311 2004 12 Journal of Computer Security 2 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs12.html#DurginLM04 2005-04-05 Type-based cryptographic operations. 485-550 2004 12 Journal of Computer Security 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs12.html#Duggan04 2005-04-05 Checking security policies through an enhanced Control Flow Analysis. 49-85 2005 13 Journal of Computer Security 1 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs13.html#BodeiDP05 2005-04-05 Relating multiset rewriting and process algebras for security protocol analysis. 3-47 2005 13 Journal of Computer Security 1 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs13.html#BistarelliCLM05 2005-04-05 Verifying information flow goals in Security-Enhanced Linux. 115-134 2005 13 Journal of Computer Security 1 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs13.html#GuttmanHRS05 2005-04-05 Non-interference proof techniques for the analysis of cryptographic protocols. 87-113 2005 13 Journal of Computer Security 1 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs13.html#BugliesiR05 2005-04-05 Reputation-based trust management. 167-190 2005 13 Journal of Computer Security 1 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs13.html#ShmatikovT05 2005-04-05 An approach to cooperative updates of XML documents in distributed systems. 191-242 2005 13 Journal of Computer Security 2 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs13.html#BertinoFM05 2005-04-05 An efficient high quality random number generator for multi-programmed systems. 243-263 2005 13 Journal of Computer Security 2 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs13.html#Zuquete05 2005-04-05 A decision procedure for the existence of a rank function. 317-344 2005 13 Journal of Computer Security 2 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs13.html#HeatherS05 2005-04-05 Decidability of context-explicit security protocols. 135-165 2005 13 Journal of Computer Security 1 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs13.html#RamanujamS05 2005-04-05 A comparison between strand spaces and multiset rewriting for security protocol analysis. 265-316 2005 13 Journal of Computer Security 2 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs13.html#CervesatoDL05 2006-03-31 A soft constraint-based approach to the cascade vulnerability problem. 699-720 2005 13 Journal of Computer Security 5 http://iospress.metapress.com/openurl.asp?genre=article&issn=0926-227X&volume=13&issue=5&spage=699 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs13.html#BistarelliFO05 2006-04-27 A comparative evaluation of two algorithms for Windows Registry Anomaly Detection. 659-693 2005 13 Journal of Computer Security 4 http://iospress.metapress.com/openurl.asp?genre=article&issn=0926-227X&volume=13&issue=4&spage=659 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs13.html#StolfoAEHHHS05 2006-03-31 Symbolic protocol analysis with an Abelian group operator or Diffie-Hellman exponentiation. 515-564 2005 13 Journal of Computer Security 3 http://iospress.metapress.com/openurl.asp?genre=article&issn=0926-227X&volume=13&issue=3&spage=515 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs13.html#MillenS05 2006-03-31 A derivation system and compositional logic for security protocols. 423-482 2005 13 Journal of Computer Security 3 http://iospress.metapress.com/openurl.asp?genre=article&issn=0926-227X&volume=13&issue=3&spage=423 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs13.html#DattaDMP05 2006-03-31 RSA-based Verifiable and Recoverable Encryption of Signatures and its application in certified e-mail delivery. 757-777 2005 13 Journal of Computer Security 5 http://iospress.metapress.com/openurl.asp?genre=article&issn=0926-227X&volume=13&issue=5&spage=757 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs13.html#NenadicZS05 2006-03-31 ⁵: A protocol for scalable anonymous communication. 839-876 2005 13 Journal of Computer Security 6 http://iospress.metapress.com/openurl.asp?genre=article&issn=0926-227X&volume=13&issue=6&spage=839 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs13.html#SherwoodBS05 2006-03-31 Static validation of security protocols. 347-390 2005 13 Journal of Computer Security 3 http://iospress.metapress.com/openurl.asp?genre=article&issn=0926-227X&volume=13&issue=3&spage=347 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs13.html#BodeiBDNN05 2006-03-31 Secure set intersection cardinality with application to association rule mining. 593-622 2005 13 Journal of Computer Security 4 http://iospress.metapress.com/openurl.asp?genre=article&issn=0926-227X&volume=13&issue=4&spage=593 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs13.html#VaidyaC05 2006-03-31 Guest Editors' preface. 697- 2005 13 Journal of Computer Security 5 http://iospress.metapress.com/openurl.asp?genre=article&issn=0926-227X&volume=13&issue=5&spage=697 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs13.html#BellaR05 2006-03-31 Experimental analysis of attacks against intradomain routing protocols. 877-903 2005 13 Journal of Computer Security 6 http://iospress.metapress.com/openurl.asp?genre=article&issn=0926-227X&volume=13&issue=6&spage=877 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs13.html#PescapeV05 2006-03-31 Anonymity and information hiding in multiagent systems. 483-512 2005 13 Journal of Computer Security 3 http://iospress.metapress.com/openurl.asp?genre=article&issn=0926-227X&volume=13&issue=3&spage=483 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs13.html#HalpernO05 2006-03-31 Symbolic protocol analysis with an Abelian group operator or Diffie-Hellman exponentiation. 695- 2005 13 Journal of Computer Security 4 http://iospress.metapress.com/openurl.asp?genre=article&issn=0926-227X&volume=13&issue=4&spage=695 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs13.html#MillenS05a 2006-03-31 Information flow in secure contexts. 391-422 2005 13 Journal of Computer Security 3 http://iospress.metapress.com/openurl.asp?genre=article&issn=0926-227X&volume=13&issue=3&spage=391 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs13.html#BossiMPR05 2006-03-31 Mitigating denial of service attacks: A tutorial. 807-837 2005 13 Journal of Computer Security 6 http://iospress.metapress.com/openurl.asp?genre=article&issn=0926-227X&volume=13&issue=6&spage=807 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs13.html#Molsa05 2006-03-31 Guest editor's preface. 345- 2005 13 Journal of Computer Security 3 http://iospress.metapress.com/openurl.asp?genre=article&issn=0926-227X&volume=13&issue=3&spage=345 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs13.html#Focardi05 2006-03-31 A computational analysis of the Needham-Schroeder-(Lowe) protocol. 565-591 2005 13 Journal of Computer Security 3 http://iospress.metapress.com/openurl.asp?genre=article&issn=0926-227X&volume=13&issue=3&spage=565 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs13.html#Warinschi05 2006-03-31 Specifying and using intrusion masking models to process distributed operations. 623-658 2005 13 Journal of Computer Security 4 http://iospress.metapress.com/openurl.asp?genre=article&issn=0926-227X&volume=13&issue=4&spage=623 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs13.html#YuLZ05 2006-03-31 One step ahead to multisensor data fusion for DDoS detection. 779-806 2005 13 Journal of Computer Security 5 http://iospress.metapress.com/openurl.asp?genre=article&issn=0926-227X&volume=13&issue=5&spage=779 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs13.html#SiaterlisM05 2006-03-31 Software watermarking in the frequency domain: Implementation, analysis, and attacks. 721-755 2005 13 Journal of Computer Security 5 http://iospress.metapress.com/openurl.asp?genre=article&issn=0926-227X&volume=13&issue=5&spage=721 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs13.html#CollbergS05 2006-03-31 A unified model for unconditionally secure key distribution. 45-64 2006 14 Journal of Computer Security 1 http://iospress.metapress.com/openurl.asp?genre=article&issn=0926-227X&volume=14&issue=1&spage=45 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs14.html#CimatoCD06 2006-03-31 Information flow security in dynamic contexts. 65-110 2006 14 Journal of Computer Security 1 http://iospress.metapress.com/openurl.asp?genre=article&issn=0926-227X&volume=14&issue=1&spage=65 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs14.html#FocardiR06 2006-03-31 A survey of algebraic properties used in cryptographic protocols. 1-43 2006 14 Journal of Computer Security 1 http://iospress.metapress.com/openurl.asp?genre=article&issn=0926-227X&volume=14&issue=1&spage=1 http://www.informatik.uni-trier.de/~ley/db/journals/jcs/jcs14.html#CortierDL06 2002-01-03 Weight-Biased Leftist Trees and Modified Skip Lists. 2 1998 3 ACM Journal of Experimental Algorithms http://www.jea.acm.org/1998/ChoWeight/ http://www.informatik.uni-trier.de/~ley/db/journals/jea/jea3.html#ChoS98 2003-05-02 Computing the Width of a Three-Dimensional Point Set: An Experimental Study. 8 1999 4 ACM Journal of Experimental Algorithms http://www.jea.acm.org/1999/SchwerdtWidth http://www.informatik.uni-trier.de/~ley/db/journals/jea/jea4.html#SchwerdtSMJ99 2003-05-02 Parallelizing Local Search for CNF Satisfiability Using Vectorization and PVM. 2 2002 7 ACM Journal of Experimental Algorithms http://www.jea.acm.org/2002/IwamaSatisfiability http://www.informatik.uni-trier.de/~ley/db/journals/jea/jea7.html#IwamaKMOU02 2002-01-03 The Influence of Caches on the Performance of Heaps. 4 1996 1 ACM Journal of Experimental Algorithms http://www.jea.acm.org/1996/LaMarcaInfluence/ http://www.informatik.uni-trier.de/~ley/db/journals/jea/jea1.html#LaMarcaL96 2002-01-03 Implementation of Dynamic Trees with In-Subtree Operations. 9 1998 3 ACM Journal of Experimental Algorithms http://www.jea.acm.org/1998/RadzikDynamic/ http://www.informatik.uni-trier.de/~ley/db/journals/jea/jea3.html#Radzik98 2003-05-02 Geometric Minimum Spanning Trees via Well-Separated Pair Decompositions. 6 2001 6 ACM Journal of Experimental Algorithms http://www.informatik.uni-trier.de/~ley/db/journals/jea/jea6.html#NarasimhanZ01 2003-05-02 Computing the nxm Shortest Paths Efficiently. 9 2000 5 ACM Journal of Experimental Algorithms http://www.jea.acm.org/2000/ShibuyaShortest http://www.informatik.uni-trier.de/~ley/db/journals/jea/jea5.html#Shibuya00 2003-05-02 A New String-Pattern Matching Algorithm Using Partitioning and Hashing Efficiently. 2 1999 4 ACM Journal of Experimental Algorithms http://www.jea.acm.org/1999/KimString http://www.informatik.uni-trier.de/~ley/db/journals/jea/jea4.html#Kim99 2003-05-02 Matrix Multiplication: A Case Study of Enhanced Data Cache Utilization. 3 1999 4 ACM Journal of Experimental Algorithms http://www.jea.acm.org/1999/EironMatrix http://www.informatik.uni-trier.de/~ley/db/journals/jea/jea4.html#EironRS99 2004-11-30 An Experimental Study of Polylogarithmic, Fully Dynamic, Connectivity Algorithms. 4 2001 6 ACM Journal of Experimental Algorithms http://www.informatik.uni-trier.de/~ley/db/journals/jea/jea6.html#IyerKRT01 2003-05-02 Performance Engineering Case Study: Heap Construction. 15 2000 5 ACM Journal of Experimental Algorithms http://www.jea.acm.org/2000/BojesenPerformance http://www.informatik.uni-trier.de/~ley/db/journals/jea/jea5.html#BojesenKS00 2003-05-02 Relational Concept Learning by Cooperative Evolution. 12 2002 7 ACM Journal of Experimental Algorithms http://www.jea.acm.org/2002/NeriRelational http://www.informatik.uni-trier.de/~ley/db/journals/jea/jea7.html#Neri02 2003-05-02 Correspondence-Based Data Structures for Double-Ended Priority Queues. 2 2000 5 ACM Journal of Experimental Algorithms http://www.jea.acm.org/2000/ChongCorrespondence http://www.informatik.uni-trier.de/~ley/db/journals/jea/jea5.html#ChongS00 2003-05-02 An Experimental Study of Online Scheduling Algorithms. 3 2002 7 ACM Journal of Experimental Algorithms http://www.jea.acm.org/2002/AlbersOnline http://www.informatik.uni-trier.de/~ley/db/journals/jea/jea7.html#AlbersS02 2002-01-03 An Empirical Study of Dynamic Graph Algorithms. 5 1997 2 ACM Journal of Experimental Algorithms http://www.jea.acm.org/1997/AlbertsDynamic/ http://www.informatik.uni-trier.de/~ley/db/journals/jea/jea2.html#AlbertsCI97 2003-05-02 Finding the Right Cutting Planes for the TSP. 6 2000 5 ACM Journal of Experimental Algorithms http://www.jea.acm.org/2000/LevineCutting http://www.informatik.uni-trier.de/~ley/db/journals/jea/jea5.html#Levine00 2003-05-02 Dijkstra's Algorithm On-Line: An Empirical Case Study from Public Railroad Transport. 12 2000 5 ACM Journal of Experimental Algorithms http://www.jea.acm.org/2000/SchulzDijkstra http://www.informatik.uni-trier.de/~ley/db/journals/jea/jea5.html#SchulzWW00 2002-01-03 Predicting String Search Speed. 2 1996 1 ACM Journal of Experimental Algorithms http://www.jea.acm.org/1996/GittlemanPredicting/ http://www.informatik.uni-trier.de/~ley/db/journals/jea/jea1.html#Gittelman96 2003-05-02 Hybrid Tree Reconstruction Methods. 5 1999 4 ACM Journal of Experimental Algorithms http://www.jea.acm.org/1999/HusonHybrid http://www.informatik.uni-trier.de/~ley/db/journals/jea/jea4.html#HusonNRWY99 2003-05-02 Finding Minimum Congestion Spanning Trees. 11 2000 5 ACM Journal of Experimental Algorithms http://www.jea.acm.org/2000/WerneckCongestion http://www.informatik.uni-trier.de/~ley/db/journals/jea/jea5.html#WerneckS00 2003-05-02 The Design and Implementation of Planar Maps in CGAL. 13 2000 5 ACM Journal of Experimental Algorithms http://www.jea.acm.org/2000/FlatoPlanar http://www.informatik.uni-trier.de/~ley/db/journals/jea/jea5.html#FlatoHHNE00 2002-01-03 The Exponential Hash Function. 3 1997 2 ACM Journal of Experimental Algorithms http://www.jea.acm.org/1997/SmithExponential/ http://www.informatik.uni-trier.de/~ley/db/journals/jea/jea2.html#SmithHA97 2003-05-02 Solving a "Hard" Problem to Approximate an "Easy" One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems. 11 2002 7 ACM Journal of Experimental Algorithms http://www.jea.acm.org/2002/FeketeHeuristics http://www.informatik.uni-trier.de/~ley/db/journals/jea/jea7.html#FeketeMRT02 2002-01-03 Lock Bypassing: An Efficient Algorithm for Concurrently Accessing Priority Heaps. 3 1998 3 ACM Journal of Experimental Algorithms http://www.jea.acm.org/1998/YanLock http://www.informatik.uni-trier.de/~ley/db/journals/jea/jea3.html#YanZ98 2003-05-02 Analysing Cache Effects in Distribution Sorting. 14 2000 5 ACM Journal of Experimental Algorithms http://www.jea.acm.org/2000/RahmanCache http://www.informatik.uni-trier.de/~ley/db/journals/jea/jea5.html#RahmanR00 2003-05-02 Adapting Radix Sort to the Memory Hierarchy. 7 2001 6 ACM Journal of Experimental Algorithms http://www.informatik.uni-trier.de/~ley/db/journals/jea/jea6.html#RahmanR01 2003-05-02 I/O-Efficient Algorithms for Problems on Grid-Based Terrains. 1 2001 6 ACM Journal of Experimental Algorithms http://www.informatik.uni-trier.de/~ley/db/journals/jea/jea6.html#ArgeTV01 2003-05-02 Planar Point Location For Large Data Sets: To Seek Or Not To Seek. 8 2002 7 ACM Journal of Experimental Algorithms http://www.jea.acm.org/2002/VahrenholdLocation http://www.informatik.uni-trier.de/~ley/db/journals/jea/jea7.html#VahrenholdH02 2003-05-02 Implementation of O(n m log n) Weighted Matchings in General Graphs: The Power of Data Structures. 4 2002 7 ACM Journal of Experimental Algorithms http://www.jea.acm.org/2002/MehlhornMatching http://www.informatik.uni-trier.de/~ley/db/journals/jea/jea7.html#MehlhornS02 2003-05-02 Fast and Flexible String Matching by Combining Bit-Parallelism and Suffix Automata. 4 2000 5 ACM Journal of Experimental Algorithms http://www.jea.acm.org/2000/NavarroString http://www.informatik.uni-trier.de/~ley/db/journals/jea/jea5.html#NavarroR00 2003-05-02 A Network-Flow-Based Scheduler: Design, Performance History, and Experimental Analysis. 3 2001 6 ACM Journal of Experimental Algorithms http://www.informatik.uni-trier.de/~ley/db/journals/jea/jea6.html#GabowK01 2003-05-02 Heuristics on Lattice Basis Reduction in Practice. 1 2002 7 ACM Journal of Experimental Algorithms http://www.jea.acm.org/2002/BackesLattice http://www.informatik.uni-trier.de/~ley/db/journals/jea/jea7.html#BackesW02 2003-05-02 An Experimental Study of Priority Queues in External Memory. 17 2000 5 ACM Journal of Experimental Algorithms http://www.jea.acm.org/2000/BrengelPriority http://www.informatik.uni-trier.de/~ley/db/journals/jea/jea5.html#BrengelCFM00 2002-01-03 Experimental Analysis of Dynamic Algorithms for the Single-Source Shortest-Path Problem. 5 1998 3 ACM Journal of Experimental Algorithms http://www.jea.acm.org/1998/FrigioniDynamic/ http://www.informatik.uni-trier.de/~ley/db/journals/jea/jea3.html#FrigioniINP98 2004-02-26 An Experimental Study of Dynamic Algorithms for Transitive Closure. 9 2001 6 ACM Journal of Experimental Algorithms http://www.informatik.uni-trier.de/~ley/db/journals/jea/jea6.html#FrigioniMNZ01 2003-05-02 Caching and Scheduling for Broadcast Disk Systems. 5 2001 6 ACM Journal of Experimental Algorithms http://www.informatik.uni-trier.de/~ley/db/journals/jea/jea6.html#Liberatore01 2002-01-03 Algorithmic Aspects in Speech Recognition: An Introduction. 1 1997 2 ACM Journal of Experimental Algorithms http://www.jea.acm.org/1997/BuchsbaumSpeech/ http://www.informatik.uni-trier.de/~ley/db/journals/jea/jea2.html#BuchsbaumG97 2002-01-03 Practical Parallel Algorithms for Personalized Communication and Integer Sorting. 3 1996 1 ACM Journal of Experimental Algorithms http://www.jea.acm.org/1996/BaderPersonalized/ http://www.informatik.uni-trier.de/~ley/db/journals/jea/jea1.html#BaderHJ96 2003-05-02 A Memetic Algorithm to Schedule Planned Maintenance for the National Grid. 1 1999 4 ACM Journal of Experimental Algorithms http://www.jea.acm.org/1999/BurkeMemetic http://www.informatik.uni-trier.de/~ley/db/journals/jea/jea4.html#BurkeS99 2002-01-03 Irredundant Intervals. 1 1996 1 ACM Journal of Experimental Algorithms http://www.jea.acm.org/1996/KnuthIntervals/ http://www.informatik.uni-trier.de/~ley/db/journals/jea/jea1.html#Knuth96 2003-05-02 Rapid Software Prototyping in Molecular Modeling Using the Biochemical Algorithms Library (BALL). 16 2000 5 ACM Journal of Experimental Algorithms http://www.jea.acm.org/2000/BoghossianPrototyping http://www.informatik.uni-trier.de/~ley/db/journals/jea/jea5.html#BoghossianKL00 2002-01-03 A New Deterministic Parallel Sorting Algorithm with an Experimental Evaluation. 4 1998 3 ACM Journal of Experimental Algorithms http://www.jea.acm.org/1998/HelmanSorting/ http://www.informatik.uni-trier.de/~ley/db/journals/jea/jea3.html#HelmanJB98 2002-01-03 Greedy Matching Algorithms: An Experimental Study. 6 1998 3 ACM Journal of Experimental Algorithms http://www.jea.acm.org/1998/MagunGreedy/ http://www.informatik.uni-trier.de/~ley/db/journals/jea/jea3.html#Magun98 2003-05-02 Fast Priority Queues for Cached Memory. 7 2000 5 ACM Journal of Experimental Algorithms http://www.jea.acm.org/2000/SandersPriority http://www.informatik.uni-trier.de/~ley/db/journals/jea/jea5.html#Sanders00 2003-05-02 Portable List Ranking: An Experimental Study. 7 2002 7 ACM Journal of Experimental Algorithms http://www.jea.acm.org/2002/GuerinRanking http://www.informatik.uni-trier.de/~ley/db/journals/jea/jea7.html#LassousG02 2003-05-02 Finding the Chromatic Number by Means of Critical Graphs. 10 2002 7 ACM Journal of Experimental Algorithms http://www.jea.acm.org/2002/HerrmannChromatic http://www.informatik.uni-trier.de/~ley/db/journals/jea/jea7.html#HerrmannH02 2002-01-03 Power Balance and Apportionment Algorithms for the United States Congress. 1 1998 3 ACM Journal of Experimental Algorithms http://www.jea.acm.org/1998/HemaspaandraPower/ http://www.informatik.uni-trier.de/~ley/db/journals/jea/jea3.html#HemaspaandraRSZ98 2003-12-17 Rwmoving Cycles for Minimizing Crossings. 2- 2001 6 ACM Journal of Experimental Algorithms http://www.informatik.uni-trier.de/~ley/db/journals/jea/jea6.html#DemestrescuF01 2003-05-02 Efficient Sorting Using Registers and Caches. 9 2002 7 ACM Journal of Experimental Algorithms http://www.jea.acm.org/2002/WickremesingheSorting http://www.informatik.uni-trier.de/~ley/db/journals/jea/jea7.html#WickremesingheACV02 2003-05-02 Experiments With List Ranking for Explicit Multi-Threaded (XMT) Instruction Parallelism. 10 2000 5 ACM Journal of Experimental Algorithms http://www.jea.acm.org/2000/DascalList http://www.informatik.uni-trier.de/~ley/db/journals/jea/jea5.html#DascalV00 2003-05-02 Implementing HEAPSORT with (n logn - 0.9n) and QUICKSORT with (n logn + 0.2n) Comparisons. 5 2002 7 ACM Journal of Experimental Algorithms http://www.jea.acm.org/2002/EdelkampHeapsort http://www.informatik.uni-trier.de/~ley/db/journals/jea/jea7.html#EdelkampS02 2003-05-02 Improving Memory Performance of Sorting Algorithms. 3 2000 5 ACM Journal of Experimental Algorithms http://www.jea.acm.org/2000/XiaoMemory http://www.informatik.uni-trier.de/~ley/db/journals/jea/jea5.html#XiaoZK00 2003-05-02 Implementing Weighted b-Matching Algorithms: Insights from a Computational Study. 8 2000 5 ACM Journal of Experimental Algorithms http://www.jea.acm.org/2000/HannemannWeighted http://www.informatik.uni-trier.de/~ley/db/journals/jea/jea5.html#Muller-HannemannS00 2003-05-02 Implementing Weighted b-Matching Algorithms: Towards a Flexible Software Design. 7 1999 4 ACM Journal of Experimental Algorithms http://www.jea.acm.org/1999/MuellerMatching http://www.informatik.uni-trier.de/~ley/db/journals/jea/jea4.html#Muller-HannemannS99 2003-05-02 Implementation of Approximation Algorithms for Weighted and Unweighted Edge-Disjoint Paths in Bidirected Trees. 6 2002 7 ACM Journal of Experimental Algorithms http://www.jea.acm.org/2002/ErlebachPaths http://www.informatik.uni-trier.de/~ley/db/journals/jea/jea7.html#ErlebachJ02 2003-05-02 Efficient Implementation of an Optimal Greedy Algorithm for Wavelength Assignment in Directed Tree Networks. 4 1999 4 ACM Journal of Experimental Algorithms http://www.jea.acm.org/1999/ErlebachWavelength http://www.informatik.uni-trier.de/~ley/db/journals/jea/jea4.html#ErlebachJ99 2003-05-02 Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs. 1 2000 5 ACM Journal of Experimental Algorithms http://www.jea.acm.org/2000/EppsteinDynamic http://www.informatik.uni-trier.de/~ley/db/journals/jea/jea5.html#Eppstein00 2003-11-25 Heuristics, Experimental Subjects, and Treatment Evaluation in Bigraph Crossing Minimization. 8 2001 6 ACM Journal of Experimental Algorithms http://www.informatik.uni-trier.de/~ley/db/journals/jea/jea6.html#StallmannBG01 2002-01-03 Reactive Search, a History-Sensitive Heuristic for MAX-SAT. 2 1997 2 ACM Journal of Experimental Algorithms http://www.jea.acm.org/1997/BattitiReactive/ http://www.informatik.uni-trier.de/~ley/db/journals/jea/jea2.html#BattitiP97 2002-01-03 An Experimental Study of the Basis for Graph Drawing Algorithms. 4 1997 2 ACM Journal of Experimental Algorithms http://www.jea.acm.org/1997/PurchaseDrawing/ http://www.informatik.uni-trier.de/~ley/db/journals/jea/jea2.html#PurchaseCJ97 2003-05-02 The Effect of Flexible Parsing for Dynamic Dictionary-Based Data Compression. 10 2001 6 ACM Journal of Experimental Algorithms http://www.informatik.uni-trier.de/~ley/db/journals/jea/jea6.html#MatiasRS01 2003-05-02 Design and Implementation of Move-Based Heuristics for VLSI Hypergraph Partitioning. 5 2000 5 ACM Journal of Experimental Algorithms http://www.jea.acm.org/2000/CaldwellDesign http://www.informatik.uni-trier.de/~ley/db/journals/jea/jea5.html#CaldwellKM00 2002-01-03 Augment or Push: A Computational Study of Bipartite Matching and Unit-Capacity Flow Algorithms. 8 1998 3 ACM Journal of Experimental Algorithms http://www.jea.acm.org/1998/CherkasskyAugment/ http://www.informatik.uni-trier.de/~ley/db/journals/jea/jea3.html#CherkasskyGM98 2002-01-03 Implementing Radixsort. 7 1998 3 ACM Journal of Experimental Algorithms http://www.jea.acm.org/1998/AnderssonRadixsort/ http://www.informatik.uni-trier.de/~ley/db/journals/jea/jea3.html#AnderssonN98 2003-09-10 A Computational Study of Routing Algorithms for Realistic Transportation Networks. 6 1999 4 ACM Journal of Experimental Algorithms http://www.jea.acm.org/1999/JacobRouting http://www.informatik.uni-trier.de/~ley/db/journals/jea/jea4.html#JacobMN99 2006-02-09 A learning algorithm for the longest common subsequence problem. 2003 8 ACM Journal of Experimental Algorithms http://doi.acm.org/10.1145/996546.996552 http://www.informatik.uni-trier.de/~ley/db/journals/jea/jea8.html#BreimerGL03 2006-02-21 Fast prefix matching of bounded strings. 2003 8 ACM Journal of Experimental Algorithms http://doi.acm.org/10.1145/996546.996550 http://www.informatik.uni-trier.de/~ley/db/journals/jea/jea8.html#BuchsbaumFKVW03 2006-02-09 Experiments on the minimum linear arrangement problem. 2003 8 ACM Journal of Experimental Algorithms http://doi.acm.org/10.1145/996546.996554 http://www.informatik.uni-trier.de/~ley/db/journals/jea/jea8.html#Petit03 2006-02-09 A blocked all-pairs shortest-paths algorithm. 2003 8 ACM Journal of Experimental Algorithms http://doi.acm.org/10.1145/996546.996553 http://www.informatik.uni-trier.de/~ley/db/journals/jea/jea8.html#VenkataramanSM03 2006-02-09 I/O-efficient point location using persistent B-trees. 2003 8 ACM Journal of Experimental Algorithms http://doi.acm.org/10.1145/996546.996549 http://www.informatik.uni-trier.de/~ley/db/journals/jea/jea8.html#ArgeDT03 2006-02-09 Approximate minimum enclosing balls in high dimensions using core-sets. 2003 8 ACM Journal of Experimental Algorithms http://doi.acm.org/10.1145/996546.996548 http://www.informatik.uni-trier.de/~ley/db/journals/jea/jea8.html#KumarMY03 2006-02-09 Twol-amalgamated priority queues. 2004 9 ACM Journal of Experimental Algorithms http://doi.acm.org/10.1145/1005813.1057625 http://www.informatik.uni-trier.de/~ley/db/journals/jea/jea9.html#GohT04 2006-02-09 A performance study of data layout techniques for improving data locality in refinement-based pathfinding. 2004 9 ACM Journal of Experimental Algorithms http://doi.acm.org/10.1145/1005813.1041511 http://www.informatik.uni-trier.de/~ley/db/journals/jea/jea9.html#NiewiadomskiAH04 2006-02-09 Generating node coordinates for shortest-path computations in transportation networks. 2004 9 ACM Journal of Experimental Algorithms http://doi.acm.org/10.1145/1005813.1005815 http://www.informatik.uni-trier.de/~ley/db/journals/jea/jea9.html#BrandesSWW04 2006-02-09 Average-optimal single and multiple approximate string matching. 2004 9 ACM Journal of Experimental Algorithms http://doi.acm.org/10.1145/1005813.1041513 http://www.informatik.uni-trier.de/~ley/db/journals/jea/jea9.html#FredrikssonN04 2006-02-09 An experimental study of a simple, distributed edge-coloring algorithm. 2004 9 ACM Journal of Experimental Algorithms http://doi.acm.org/10.1145/1005813.1041515 http://www.informatik.uni-trier.de/~ley/db/journals/jea/jea9.html#MarathePR04 2006-02-09 Cache-conscious sorting of large sets of strings with dynamic tries. 2004 9 ACM Journal of Experimental Algorithms http://doi.acm.org/10.1145/1005813.1041517 http://www.informatik.uni-trier.de/~ley/db/journals/jea/jea9.html#SinhaZ04 2006-02-09 Geometric containers for efficient shortest-path computation. 2005 10 ACM Journal of Experimental Algorithms http://doi.acm.org/10.1145/1064546.1103378 http://www.informatik.uni-trier.de/~ley/db/journals/jea/jea10.html#WagnerWZ05 2006-02-09 New heuristic and interactive approaches to 2D rectangular strip packing. 2005 10 ACM Journal of Experimental Algorithms http://doi.acm.org/10.1145/1064546.1083322 http://www.informatik.uni-trier.de/~ley/db/journals/jea/jea10.html#LeshMMM05 2006-02-09 Adaptive data structures for IP lookups. 2005 10 ACM Journal of Experimental Algorithms http://doi.acm.org/10.1145/1064546.1064548 http://www.informatik.uni-trier.de/~ley/db/journals/jea/jea10.html#IoannidisGA05 2003-12-01 Processing III-Defined Spatial Operators in Geographic Databases: A Common Sense Approach. 19-35 1999 10 J. Database Manag. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm10.html#Subramanian99 2003-12-01 Current Trends in Data Management Technology. 43 1999 10 J. Database Manag. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm10.html#Chin99 2003-12-01 Federated Process Framework in a Virtual Enterprise Using an Object-oriented Database and Extensible Markup Language. 27-47 2003 14 J. Database Manag. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm14.html#BaeKH03 2003-12-01 A Personal Perspective on the Use of Computing Technology. 37-38 1998 9 J. Database Manag. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm9.html#Allen98 2003-12-01 Object-Process Methodology Applied to Modeling Credit Card Transactions. 4-14 2001 12 J. Database Manag. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm12.html#Dori01 2003-12-01 Database: Models, Languages, Design. 40-41 1998 9 J. Database Manag. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm9.html#Johnson98 2003-12-01 Enhancing the ER Model with Integrity Methods Information Management Systems. 14-23 1999 10 J. Database Manag. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm10.html#BalabanS99 2003-12-01 Information Management and Lean Manufacturing. 43 1999 10 J. Database Manag. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm10.html#Hall99 2003-12-01 Natural Language-Enabled Data Modeling: Improving Validation and Integration. 17-25 1998 9 J. Database Manag. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm9.html#Hars98 2003-12-01 Knowledge-Based Systems as Database Design Tools: A Comparative Study. 26-40 1999 10 J. Database Manag. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm10.html#LoC99 2003-12-01 The Development of Ordered SQL Packages to Support Data Warehousing. 26-39 2001 12 J. Database Manag. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm12.html#NgL01 2003-12-01 RORIB: An Economic and Efficient Solution for Real-Time Online Remote Info Backup. 56-73 2003 14 J. Database Manag. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm14.html#LloydPLY03 2003-12-01 Metaschemas for ER, ORM and UML Data Models: A Comparison. 20-30 2002 13 J. Database Manag. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm13.html#Halpin02 2003-12-01 Providing Approximate Answers Using a Knowledge Abstraction Database. 14-24 2001 12 J. Database Manag. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm12.html#HuhL01 2003-12-01 A Case Study Evaluation of the Use of the Viable System Model in Information Systems Development. 24-32 1999 10 J. Database Manag. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm10.html#KawalekW99 2003-12-01 A Comparative Study of Conceptual Data Modeling Techniques. 26-35 1998 9 J. Database Manag. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm9.html#LeeC98 2003-12-01 An Enterprise Model Repository: Architecture and System. 16-28 2000 11 J. Database Manag. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm11.html#LeeJ00 2003-12-01 Rich Base Schema: A Unified Framework for OODB Schema Version Management. 29-37 2000 11 J. Database Manag. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm11.html#LeeK00 2003-12-01 A Prediction-Based Query Processing Strategy in Mobile Commerce Systems. 14-26 2001 12 J. Database Manag. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm12.html#LeeK01 2003-12-01 Conceptual Modeling and Ontology: Possibilities and Pitfalls. 1-20 2003 14 J. Database Manag. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm14.html#Weber03 2003-12-01 A Methodology of Constructing Canonical Form Database Schemas in a Multiple Heterogeneous Database Environment. 4-11 1998 9 J. Database Manag. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm9.html#LimS98 2003-12-01 Using Harel's Statecharts to Model Business Workflows. 17-34 2002 13 J. Database Manag. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm13.html#MokP02 2003-12-01 Relational Data Modeling for Geographic Information Systems. 27-34 1999 10 J. Database Manag. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm10.html#WestM99 2003-12-01 Data Modeling in UML and ORM: A Comparison. 4-13 1999 10 J. Database Manag. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm10.html#HalpinB99 2005-07-21 Distributed Database Design for Mobile Geographical Applications. 3-15 2000 11 J. Database Manag. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm11.html#ChoyKL00 2003-12-01 Benchmarking OODBs with a Generic Tool. 16-27 2000 11 J. Database Manag. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm11.html#DarmontS00 2003-12-01 FOOM: Functional and Object-Oriented Analysis and Design of Information Systems: An Integrated Methodology. 15-25 2001 12 J. Database Manag. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm12.html#ShovalK01 2003-12-01 Enterprise Resource Planning (ERP) Implementation Methodologies - Editorial Preface. 2004 15 J. Database Manag. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm15.html#Siau04 2003-12-01 Information Modeling and Method Engineering: A Psychological Perspective. 44-50 1999 10 J. Database Manag. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm10.html#Siau99 2003-12-01 The Essence of Databases. 39 1998 9 J. Database Manag. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm9.html#Rolland98 2004-11-10 Mobile Computing at the Department of Defense. 36-48 2001 12 J. Database Manag. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm12.html#RodgerPK01 2003-12-01 Hypermedia Document Management: A Metadata and Meta-Information System. 25-35 2001 12 J. Database Manag. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm12.html#SuhL01 2003-12-01 Knowledge and Object-Oriented Approach for Interoperability of Heterogeneous Information Management Systems. 13-25 1999 10 J. Database Manag. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm10.html#ChungK99 2003-12-01 The American Society for Engineering Education's Use of Web-based Technology to Promote Excellence in Engineering Education. 38-39 1998 9 J. Database Manag. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm9.html#BostelmanC98 2003-12-01 Database Interfaces: A Conceptual Framework and a Meta-Analysis on Natural Language Studies. 25-32 1998 9 J. Database Manag. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm9.html#ChanL98 2003-12-01 Data Protection Using Watermarking in E-Business. 1-13 2003 14 J. Database Manag. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm14.html#PonsA03 2006-04-26 On Conceptual Micro-Object Modeling. 1-16 2002 13 J. Database Manag. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm13.html#CecilCL02 2003-12-01 View Maintenance for Materialized Transitive-Closure Relations. 3-12 1998 9 J. Database Manag. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm9.html#Toroslu98 2003-12-01 Binary Equivalents of Ternary Relationships in Entity-Relationship Modeling: A Logical Decomposition Approach. 12-19 2000 11 J. Database Manag. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm11.html#JonesS00 2003-12-01 Fault-Tolerant Quorum Consensus Scheme for Replication Control in Mobile Distributed Database Systems. 16-24 1998 9 J. Database Manag. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm9.html#ByunM98 2003-12-01 The Unified Modeling Language User Guide. 51-52 1999 10 J. Database Manag. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm10.html#BoochRJ99 2003-12-01 Transaction-Relationship Oriented Log Division for Data Recovery from Information Attacks. 27-41 2003 14 J. Database Manag. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm14.html#PatnaikP03 2003-12-01 Database Programming with DBC and JAVA. 38 1999 10 J. Database Manag. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm10.html#Reese99 2003-12-01 Integrating Digital Signatures with Relational Databases: Issues and Organizational Implications. 42-51 2003 14 J. Database Manag. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm14.html#ReidD03 2003-12-01 Transformation Between UML Diagrams. 37-55 2003 14 J. Database Manag. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm14.html#SelonenKS03 2003-12-01 Mobile Commerce Agents in WAP-Based Services. 27-35 2001 12 J. Database Manag. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm12.html#MatskinT01 2003-12-01 Extended Spatiotemporal UML: Motivations, Requirements and Constructs. 14-27 2000 11 J. Database Manag. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm11.html#PriceTJ00 2003-12-01 Simplifying the Formulation of a Wide Range of Object-Oriented Complex Queries. 20-29 2000 11 J. Database Manag. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm11.html#Alhajj00 2003-12-01 Solving the Partitioning Problem in Database Design. 36-38 1999 10 J. Database Manag. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm10.html#ChengGL99 2003-12-01 CMU-WEB: A Conceptual Model for Designing Usable Web Applications. 33-43 1999 10 J. Database Manag. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm10.html#BajajK99 2003-12-01 IAIS: A Methodology to Enable Inter-Agency Information Sharing In eGovernment. 59-80 2003 14 J. Database Manag. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm14.html#BajajR03 2003-12-01 Methodology Evaluation Framework for Component-Based System Development. 1-26 2003 14 J. Database Manag. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm14.html#DahanayakeSS03 2003-12-01 Modeling Temporal Dynamics for Business Systems. 21-36 2003 14 J. Database Manag. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm14.html#AllenM03 2003-12-01 LEO: The Incredible Story of the World's First Business Computer. 44 1999 10 J. Database Manag. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm10.html#CaminerAHL99 2003-12-01 Electronic Commerce. 31-35 1998 9 J. Database Manag. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm9.html#Dogac98 2003-12-01 Regression Testing of Database Applications. 31-42 2002 13 J. Database Manag. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm13.html#HaratyMD02 2005-07-22 Methodology of Schema Integration for New Database Applications: A Practitioner's Approach. 3-18 1999 10 J. Database Manag. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm10.html#FongKLK99 2003-12-01 A Metadata Oriented Architecture for Building Datawarehouse. 15-25 2001 12 J. Database Manag. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm12.html#LeeKK01 2003-12-01 A View-Based Hypermedia Design Methodology. 3-13 1999 10 J. Database Manag. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm10.html#LeeKK99 2003-12-01 An Asynchronous Differential Join in Distributed Data Replications. 3-12 1999 10 J. Database Manag. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm10.html#LeePK99 2003-12-01 Conditional Conflict Serializability: An Application Oriented Correctness Criterion. 22-30 1998 9 J. Database Manag. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm9.html#Anfindsen98 2003-12-01 XML Integration and Toolkit for B2B Applications. 33-58 2003 14 J. Database Manag. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm14.html#NicolleYS03 2003-12-01 Formal Approaches to Systems Analysis Using UML: An Overview. 4-13 2000 11 J. Database Manag. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm11.html#Whittle00 2003-12-01 A Systematic Approach to Flexible Specification, Composition, and Restructuring of Workflow Activities. 1-40 2004 15 J. Database Manag. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm15.html#LiuPR04 2003-12-01 Protecting Data through Perturbation Techniques: The Impact on Knowledge Discovery in Databases. 14-26 2003 14 J. Database Manag. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm14.html#WilsonR03 2003-12-01 Common Sense Reasoning in Automated Database Design: An Empirical Test. 3-14 2002 13 J. Database Manag. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm13.html#StoreyGD02 2003-12-01 Using Weakly Structured Documents to Fill in a Classical Database. 3-13 2001 12 J. Database Manag. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm12.html#LaforestF01 2003-12-01 Informational and Computational Equivalence in Comparing Information Modeling Methods. 73-86 2004 15 J. Database Manag. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm15.html#Siau04a 2003-12-01 Unified Modeling Language: A Complexity Analysis. 26-34 2001 12 J. Database Manag. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm12.html#SiauC01 2003-12-01 Integrated Functional and Executional Modeling of Software Using Web-Based Databases. 12-21 1998 9 J. Database Manag. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm9.html#KulkarniM98 2004-03-30 Dynamic Semantics of UML State Machines: A Metamodeling Perspective. 20-38 2002 13 J. Database Manag. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm13.html#DominguezRZ02 2006-01-13 Issues in Mobile Electronic Commerce. 36-42 2002 13 J. Database Manag. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm13.html#DogacT02 2003-12-01 A Graphical Interface to Genome Multidatabases. 24-32 1998 9 J. Database Manag. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm9.html#TanWW98 2003-12-01 Managing Data Quality in Dynamic Decision Environments: An Information Product Approach. 14-32 2003 14 J. Database Manag. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm14.html#ShankaranarayanZW03 2003-12-01 A Rigorous Approach for Mapping Workflows to Object-Oriented IS Models. 1-19 2002 13 J. Database Manag. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm13.html#JoostenP02 2003-12-01 Using Business Rules within a Design Process of Active Databases. 3-15 2000 11 J. Database Manag. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm11.html#AmgharMF00 2003-12-01 Understanding the Role of Use Cases in UML: A Review and Research Agenda. 28-36 2000 11 J. Database Manag. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm11.html#DobingP00 2003-12-01 A New Approach To Secure Federated Information Bases Using Agent Technology. 48-68 2003 14 J. Database Manag. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm14.html#WeipplEKS03 2003-12-01 Representation and Storage of Motion Data. 46-63 2002 13 J. Database Manag. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm13.html#GelbardS02 2003-12-01 Benchmarking Data Mining Algorithms. 25-35 2002 13 J. Database Manag. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm13.html#RajagopalanK02 2003-12-01 Database and the Web. 35-36 1998 9 J. Database Manag. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm9.html#Gillenson98 2003-12-01 An Adaptive Probe-Based Technique to Optimize Join Queries in Distributed Internet Databases. 3-14 2001 12 J. Database Manag. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm12.html#KhanMS01 2003-12-01 Initiating Change in Documentation Practices. 35-37 1998 9 J. Database Manag. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm9.html#Becker98a 2003-12-01 The Dissemination of Good Practices in Database Development Work. 33-34 1998 9 J. Database Manag. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm9.html#Becker98b 2003-12-01 Mobile Commerce: Promises, Challenges and Research Agenda. 4-13 2001 12 J. Database Manag. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm12.html#SiauLS01 2003-12-01 Issues in Transaction-Time Temporal Object Database Systems. 40-51 2001 12 J. Database Manag. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm12.html#Norvag01 2003-12-01 Guide to Client/Server and Intranet Development. 41 1998 9 J. Database Manag. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm9.html#Linthicum98 2003-12-01 Discovering Objects: Which Identification and Refinement Strategies Do Analysts Really Use? 3-15 1998 9 J. Database Manag. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm9.html#JonesHL98 2003-12-01 Is the Webmaster Position Becoming Obsolete? 39-40 1998 9 J. Database Manag. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm9.html#Scheirer98 2003-12-01 Desirable Characteristics of Information Resource Dictionary Systems. 3-16 1998 9 J. Database Manag. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm9.html#BordoloiSL98 2003-12-01 Temporal Interoperability in Multi+ Temporal Databases. 14-23 1998 9 J. Database Manag. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm9.html#Grandi98 2003-12-01 A Framework for Analyzing Mobile Transaction Models. 36-47 2001 12 J. Database Manag. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm12.html#HirschCFR01 2003-12-01 Human Factors Research on Data Modeling: A Review of Prior Research, An Extended Framework and Future Research Directions. 3-19 2002 13 J. Database Manag. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm13.html#TopiR02 2003-12-01 Data Mining: New Arsenal for Strategic Decision Making. 39-43 1999 10 J. Database Manag. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm10.html#NazemS99 2003-12-01 What's New? The Challenges of Ermerging Information Technologies. 33-34 1998 9 J. Database Manag. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm9.html#LedererB98 2003-12-01 Fuzzy Database Modeling. 36 1998 9 J. Database Manag. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm9.html#YaziciG98 2003-12-01 The Use of Subtypes and Stereotypes in the UML Model. 43-50 2002 13 J. Database Manag. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm13.html#Henderson-Sellers02 2004-05-04 Online Analytical Mining of Path Traversal Patterns for Web Measurement. 39-61 2002 13 J. Database Manag. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm13.html#FungW02 2003-12-01 Database Cooperation: Classification and Middleware Tools. 3-11 2000 11 J. Database Manag. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm11.html#AtzeniCM00 2003-12-01 Applying UML and XML for designing and interchanging information for data warehouses and OLAP applications. 41-72 2004 15 J. Database Manag. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm15.html#TrujilloLS04 2006-09-18 Database Technology for Global Support of a Medical Registry: An Implementation Case. 62-73 2002 13 J. Database Manag. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm13.html#ConradLR02 2003-12-01 Process-Embedded Data Integrity. 87-103 2004 15 J. Database Manag. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm15.html#LeePSW04 2003-12-01 Normalization of Relations with Nulls in Candidate Keys. 35-45 2002 13 J. Database Manag. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm13.html#Philip02 2003-12-01 Performance Evaluation of Parallel S-Trees. 28-34 2000 11 J. Database Manag. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm11.html#TousidouVM00 2003-12-01 An Empirical Analysis of the Object-Oriented Database Concurrency Control Mechanism O2C2. 14-26 1999 10 J. Database Manag. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm10.html#OlsenR99 2003-12-01 A Practical Perspective on Data Quality Issues. 35-37 1998 9 J. Database Manag. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm9.html#Becker98 2003-12-01 A Possibility Theory Framework for Security Evaluation in National Infrastructure Protection. 1-13 2003 14 J. Database Manag. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm14.html#BaskervilleP03 2003-12-01 The Soprano Extensible Object Storage System. 15-24 2002 13 J. Database Manag. 1 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm13.html#AhnK02 2004-09-02 Reflection: Ontology in Information Systems - Foreword. 2004 15 J. Database Manag. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm15.html#WandW04 2004-09-02 Scalable QSF-Trees: Retrieving Regional Objects in High-Dimensional Spaces. 45-59 2004 15 J. Database Manag. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm15.html#OrlandicY04 2004-09-02 Data Warehouse Interoperability for the Extended Enterprise. 73-84 2004 15 J. Database Manag. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm15.html#TriantafillakisKM04 2004-09-02 An Efficient Concurrency Control Algorithm for High-Dimensional Index Structures. 60-72 2004 15 J. Database Manag. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm15.html#SongY04 2004-09-02 Ontological Analysis, Evaluation and Engineering of Business Systems Analysis Methods - Editorial Preface. 2004 15 J. Database Manag. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm15.html#GreenR04 2004-09-02 Semantic Heterogeneity in Multidatabase Systems: A Review and a Proposed Meta-Data Structure. 71-87 2004 15 J. Database Manag. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm15.html#WangM04 2004-09-02 A Template for Defining Enterprise Modeling Constructs. 39-73 2004 15 J. Database Manag. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm15.html#OpdahlH04 2004-09-02 Mobile Agent Based Self-Adaptive Join for Wide-Area Distributed Query Processing. 25-44 2004 15 J. Database Manag. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm15.html#ArcangeliHMM04 2004-09-02 Relationship Construct in Modeling Information Systems: Identifying Relationship Based on Relation Element Theory - Editorial Preface. 2004 15 J. Database Manag. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm15.html#Siau04b 2004-09-02 An Exploration of a Set of Entropy-Based Hybrid Splitting Methods for Decision Tree Induction. 1-17 2004 15 J. Database Manag. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm15.html#Osei-BrysonG04 2004-09-02 Editorial Preface. 2004 15 J. Database Manag. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm15.html#Siau04c 2004-09-02 Applying Ontologies to Business and Systems Modeling Techniques and Perspectives: Lessons Learned. 105-117 2004 15 J. Database Manag. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm15.html#GreenR04a 2004-09-02 XTOPO: An XML-Based Topology for Information Highway on the Internet. 18-44 2004 15 J. Database Manag. 3 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm15.html#FongW04 2004-09-02 An Evaluation of Inter-Organizational Workflow Modeling Formalisms. 74-104 2004 15 J. Database Manag. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm15.html#DussartAP04 2004-09-02 Clustering Schema Elements for Semantic Integration of Heterogeneous Data Sources. 88-106 2004 15 J. Database Manag. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm15.html#ZhouR04 2004-09-02 Ex Ante Evaluations of Alternate Data Structures for End User Queries: Theory and Experimental Test. 45-70 2004 15 J. Database Manag. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm15.html#BowenRB04 2004-09-02 Application of Mobile Agents in Mobile Data Access Systems: A Prototype. 1-24 2004 15 J. Database Manag. 4 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm15.html#JiaoH04 2004-09-02 ONTOMETRIC: A Method to Choose the Appropriate Ontology. 1-18 2004 15 J. Database Manag. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm15.html#TelloG04 2004-09-02 An Ontology of Data Modeling Languages: A Study Using a Common-Sense Realistic Ontology. 19-38 2004 15 J. Database Manag. 2 http://www.informatik.uni-trier.de/~ley/db/journals/jdm/jdm15.html#MiltonK04 2003-11-20 Agreement under Faulty Interfaces. 125-129 1998 65 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl65.html#Dasgupta98 http://dx.doi.org/10.1016/S0020-0190(97)00202-0 2003-11-20 A Parallel Algorithm for Recognizing Unordered Depth-First Search. 105-110 1988 28 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl28.html#SchevonV88 2003-11-20 Erratum: A Structured Program to Generate all Topological Sorting Arrangements. 64 1974 3 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl3.html#KnuthS74a 2003-11-20 Prefix Grammars: An Alternative Characterization of the Regular Languages. 67-71 1994 51 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl51.html#FrazierP94 2003-11-20 Line Arrangements and Range Search. 275-280 1988 27 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl27.html#Matousek88 2003-11-20 On-Line Computation of Convolutions. 15-16 1989 32 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl32.html#Matousek89 2003-11-20 Computing Dominances in E^n. 277-278 1991 38 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl38.html#Matousek91 2003-11-20 On Enclosing k Points by a Circle. 217-221 1995 53 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl53.html#Matousek95 http://dx.doi.org/10.1016/0020-0190(94)00190-A 2003-11-20 Some Notes on Threshold Circuits, and Multiplication in Depth 4. 219-225 1991 39 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl39.html#HofmeisterHK91 2003-11-20 An Approximate Algorithm for the Minimal Vertex Nested Polygon Problem. 35-44 1989 33 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl33.html#DasguptaM89 2003-11-20 Alternating Multicounter Machines with Constant Number of Reversals. 7-9 1985 21 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl21.html#Hromkovic85 2003-11-20 Oracle Complexities for Computational Geometry of Semi-Algebraic Sets and Voronoi Diagrams. 95-102 1990 36 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl36.html#HaldarP90 2003-11-20 Ring Based Termination Detection Algorithm for Distributed Computations. 149-153 1988 29 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl29.html#HaldarS88 2003-11-20 On the Minimization of Control Memories. 71-74 1975 3 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl3.html#DasguptaT75 2003-11-20 On the Structural Locality of Reference in LISP List Access Streams. 105-110 1987 26 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl26.html#ThazhuthaveetilP87 2003-11-20 Efficient Search for Rationals. 1-4 1979 8 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl8.html#Papadimitriou79 2003-11-20 An Algorithm for Shortest-Path Motion in Three Dimensions. 259-263 1985 20 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl20.html#Papadimitriou85 2003-11-20 A Polynomial Bound on the Number of Light Cycles in an Undirected Graph. 173-176 1995 53 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl53.html#Subramanian95 http://dx.doi.org/10.1016/0020-0190(94)00202-A 2003-11-20 A Self-Optimizing Prolog Program and the Underlying Statistical Model. 273-276 1989 31 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl31.html#Falkowski89 2003-11-20 Perceptrons Revisited. 207-213 1990 36 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl36.html#Falkowski90 2003-11-20 An Improved Algorithm to Check for Polygon Similarity. 127-128 1978 7 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl7.html#AklT78 2005-04-19 Fixed-Point Calculus. 131-136 1995 53 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl53.html#Group95 http://dx.doi.org/10.1016/0020-0190(94)00195-5 2003-11-20 Parallel evolutionary algorithms can achieve super-linear performance. 7-13 2002 82 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl82.html#Alba02 http://dx.doi.org/10.1016/S0020-0190(01)00281-2 2003-11-20 The Complexity of Number-Theoretic Constants. 145-152 1997 62 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl62.html#Bach97 http://dx.doi.org/10.1016/S0020-0190(97)00051-3 2003-11-20 The Vertex Separation Number of a Graph equals its Path-Width. 345-350 1992 42 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl42.html#Kinnersley92 2003-11-20 On the Use of Random Numbers in Asynchronous Simulation via Rollback. 139-144 1989 31 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl31.html#Tsitsiklis89 2003-11-24 A simple algorithm for edge-coloring bipartite multigraphs. 301-302 2003 85 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/S0020-0190(02)00446-5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl85.html#Alon03 2003-11-20 Generating Pseudo-Random Permutations and Maximum Flow Algorithms. 201-204 1990 35 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl35.html#Alon90 2003-11-20 A Fast Algorithm for Renaming a Set of Clauses as a Horn Set. 269-272 1985 21 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl21.html#MannilaM85 2003-11-20 A Cryptosystem for Multiple Communication. 180-183 1980 10 Inf. Process. Lett. 4/5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl10.html#LuccioM80 2003-11-20 A Simple Linear-Time Algorithm for in Situ Merging. 203-208 1984 18 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl18.html#MannilaU84 2003-11-20 Storage for Consecutive Retrieval. 68-71 1976 5 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl5.html#LuccioP76 2003-11-20 A Linear Algorithm to Determine Minimal Spanning Forests in Chain Graphs. 1-4 1982 15 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl15.html#LuccioP82 2003-11-20 On the Upper Bound on the Rotation Distance of Binary Trees. 57-60 1989 31 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl31.html#LuccioP89 2003-11-20 An Efficient Algorithm for Some Tree Matching Problems. 51-57 1991 39 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl39.html#LuccioP91 2004-12-10 A Parallel List Update Problem. 277-284 1994 52 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl52.html#LuccioP94 2003-11-20 An Insight on PRAM Computational Bounds. 331-336 1997 63 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl63.html#LuccioP97 http://dx.doi.org/10.1016/S0020-0190(97)00130-0 2003-11-20 Flush Primitives for Asynchronous Distributed Systems. 5-12 1990 34 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl34.html#Ahuja90 2003-11-20 Assertions About Past and Future in Highways: Global Flush Broadcast and Flush-Vector-Time. 21-28 1993 48 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl48.html#Ahuja93 2003-11-20 Assertions About Past and Future in Highways: Global Flush Broadcast and Flush-Vector-Time (Erratum). 325 1996 58 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl58.html#Ahuja96 http://dx.doi.org/10.1016/0020-0190(96)00082-8 2003-11-20 The 0-1 law fails for monadic existential second-order logic on undirected graphs. 43-48 2001 77 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl77.html#Bars01 http://dx.doi.org/10.1016/S0020-0190(00)00149-6 2003-11-20 A Finite-Difference Sieve to Count Paths and Cycles by Length. 171-176 1996 60 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl60.html#BaxF96 http://dx.doi.org/10.1016/S0020-0190(96)00159-7 2003-11-20 A Permanent Formula with Many Zero-Valued Terms. 33-39 1997 63 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl63.html#BaxF97 http://dx.doi.org/10.1016/S0020-0190(97)00078-1 2003-11-20 Garbage Collecting a Heap Which Includes a Scatter Table. 161-164 1976 5 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl5.html#FriedmanW76a 2003-11-25 On the composability of consistency conditions. 169-176 2003 86 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/S0020-0190(02)00498-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl86.html#FriedmanVC03 2003-11-20 Formal Correctness Proofs of a Nondeterministic Program. 86-92 1982 14 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl14.html#Upfal82 2003-11-20 On the Approximation Hardness of Dense TSP and Other Path Problems. 53-55 1999 70 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl70.html#VegaK99 http://dx.doi.org/10.1016/S0020-0190(99)00048-4 2003-11-24 Polynomial time algorithms for computing a representation for minimal unsatisfiable formulas with fixed deficiency. 147-151 2002 84 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/S0020-0190(02)00267-3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl84.html#BuningZ02 2003-11-20 Formal Justification of Underspecification for S5. 115-121 1997 64 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl64.html#AaronG97 http://dx.doi.org/10.1016/S0020-0190(97)00165-8 2003-11-20 The Interval B-Tree. 85-89 1995 53 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl53.html#AngT95 http://dx.doi.org/10.1016/0020-0190(94)00176-Y 2003-11-20 The Earley Algorithm as a Problem Representation. 1-7 1974 3 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl3.html#MinkerB74 2003-11-20 An Extension to Linear Resolution with Selection Function. 191-194 1982 14 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl14.html#MinkerZ82 2003-11-20 Extending Binary Byzantine Agreement to Multivalued Byzantine Agreement. 73-76 1984 18 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl18.html#TurpinC84 2003-11-20 Comment on ``Efficient Huffman Decoding'' and ``An Efficient Finite-State Machine Implementation of Huffman Decoders''. 1-2 1998 68 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl68.html#TurpinM98 http://dx.doi.org/10.1016/S0020-0190(98)00136-7 2003-11-20 Randomized Optimal Algorithm for Slope Selection 183-187 1991 39 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl39.html#Matousek91a 2003-11-20 Processing a multimedia join through the method of nearest neighbor search. 269-276 2002 82 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl82.html#KoschA02 http://dx.doi.org/10.1016/S0020-0190(01)00279-4 2003-11-20 A note on practical construction of maximum bandwidth paths. 175-180 2002 83 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl83.html#MalpaniC02 http://dx.doi.org/10.1016/S0020-0190(01)00323-4 2003-11-20 The Traveling Salesman Problem for lines in the plane. 137-142 2002 82 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl82.html#Jonsson02 http://dx.doi.org/10.1016/S0020-0190(01)00259-9 2003-11-25 An approximative solution to the Zookeeper's Problem. 301-307 2003 87 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/S0020-0190(03)00348-X http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl87.html#Jonsson03 2003-11-20 A Nonapproximability Result for Finite Function Generation. 143-145 1997 63 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl63.html#Jonsson97 http://dx.doi.org/10.1016/S0020-0190(97)00112-9 2003-11-20 Near-Optimal Nonapproximability Results for Some NPO PB-Complete Problems. 249-253 1998 68 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl68.html#Jonsson98 http://dx.doi.org/10.1016/S0020-0190(98)00170-7 2003-11-20 Bisimulation and Effectiveness. 19-20 1989 30 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl30.html#Darondeau89 2003-11-20 Multiresource Malleable Task Scheduling to Minimize Response Time. 47 1999 70 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl70.html#ShachnaiT99 http://dx.doi.org/10.1016/S0020-0190(99)00030-7 2003-11-20 Abstract interpretation of operational semantics for secure information flow. 101-108 2002 83 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl83.html#BarbutiBF02 http://dx.doi.org/10.1016/S0020-0190(02)00219-3 2003-11-20 Computing Sums of Order-k Fibonacci Numbers in Log Time. 1-5 1983 17 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl17.html#Er83 2003-11-20 Weaknesses in some multisignature schemes for specified group of verifiers. 95-99 2002 83 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl83.html#He02 http://dx.doi.org/10.1016/S0020-0190(01)00317-9 2003-11-20 An Efficient Parallel Algorithm for Finding Minimum Weight Matching for Points on a Convex Polygon. 111-116 1991 37 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl37.html#He91 2003-11-20 How to Produce All Sentences From a Two-Level Grammar. 181-185 1984 19 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl19.html#Grune84 2003-11-20 How to Compare the Incomparable. 177-181 1987 24 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl24.html#Grune87 2003-11-20 Some Observations on the Probabilistic Algorithms and NP-hard Problems. 39-43 1982 14 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl14.html#Ko82 2003-11-20 On Non-Smooth Convex Distance Functions. 323-329 1997 63 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl63.html#Le97 http://dx.doi.org/10.1016/S0020-0190(97)00136-1 2003-11-20 Equivalency reasoning to solve a class of hard SAT problems. 75-81 2000 76 Inf. Process. Lett. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl76.html#Li00 http://dx.doi.org/10.1016/S0020-0190(00)00126-5 2003-11-20 A Separator Theorem for One-Dimensional Graphs Under Linear Mapping. 9-11 1988 27 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl27.html#Li88 2003-11-20 On Full Utilization of Multi-Channel Capacity with Priority Protocol. 129-133 1990 36 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl36.html#Li90 2003-11-20 Trajectory Planning in H-Space. 253-258 1994 50 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl50.html#Li94 2003-11-20 A Constraint-Based Approach to Narrow Search Trees for Satisfiability. 75-80 1999 71 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl71.html#Li99 http://dx.doi.org/10.1016/S0020-0190(99)00088-5 2003-11-20 Parallelizing Mallat Algorithm for 2-D Wavelet Transforms. 255-259 1993 45 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl45.html#Lu93 2003-11-20 Limits for Automatic Verification of Finite-State Concurrent Systems. 307-309 1986 22 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl22.html#AptK86 2003-11-20 Approximate Closest-Point Queries in High Dimensions. 95-99 1993 45 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl45.html#Bern93 2003-11-20 An Analytical Evidence for Kalé's Heuristic for the N Queens Problem. 51-54 1993 46 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl46.html#Oh93 2003-11-20 A Note on the Proof of a Concurrent Program. 103-104 1979 9 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl9.html#Best79 2003-11-20 Fairness and Conspiracies. 215-220 1984 18 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl18.html#Best84 2003-11-20 A Linear Algorithm for Centering a Spanning Tree of a Biconnected Graph. 121-124 1994 51 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl51.html#EaswarakumarRC94 2003-11-20 Languages Represented by Boolean Formulas. 251-256 1997 63 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl63.html#Veith97 http://dx.doi.org/10.1016/S0020-0190(97)00134-8 2003-11-20 An O(|V|*|E|) Algorithm for Finding Immediate Multiple-Vertex Dominators. 9-11 1996 59 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl59.html#AlstrupCJ96 http://dx.doi.org/10.1016/0020-0190(96)00085-3 2003-11-20 Extending the Quadrangle Inequality to Speed-Up Dynamic Programming. 287-290 1994 49 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl49.html#BorchersG94 2003-11-20 Polynomial time algorithms for some minimum latency problems. 225-229 2000 75 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl75.html#Wu00 http://dx.doi.org/10.1016/S0020-0190(00)00102-2 2003-11-20 Fast Approximations to Discrete Optimal Quantization. 175-179 1989 31 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl31.html#Wu89 2003-11-20 Succinct Circuit Representations and Leaf Language Classes are Basically the Same Concept. 211-215 1996 59 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl59.html#BorchertL96 http://dx.doi.org/10.1016/0020-0190(96)00096-8 2003-11-20 A Characterization of the Leaf Language Classes. 153-158 1997 63 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl63.html#BorchertS97 http://dx.doi.org/10.1016/S0020-0190(97)00111-7 2003-11-20 A Pumping Lemma for Deterministic Context-Free Languages. 47-51 1989 31 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl31.html#Yu89 2003-11-20 A New Solution for Thue's Problem. 187-191 1995 54 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl54.html#Yu95 http://dx.doi.org/10.1016/0020-0190(95)00018-8 2003-11-20 A Consideration of a Practical Implementation for a New Convergence Division. 273-281 1983 17 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl17.html#Asai83 2003-11-20 A Canonical Simplifier for Trigonometric Expressions in the Kinematic Equation. 241-246 1988 29 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl29.html#Schorn88 2003-11-20 On the Complexity of Testing a Graph for N-Cube. 16-19 1980 11 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl11.html#Bhat80 2003-11-20 Corrigendum: Lower Bounds for Rectilinear Steiner Trees. 279 1991 38 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl38.html#Snyder91a 2003-11-20 Fast Algorithm for Sparse Matrix Multiplication. 87-89 1982 15 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl15.html#Schorr82 2003-11-20 Physical Parallel Devices are not Much Faster than Sequential Ones. 103-106 1983 17 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl17.html#Schorr83 2003-11-20 Optimal On-Line Decremental Connectivity in Trees. 161-164 1997 64 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl64.html#AlstrupSS97 http://dx.doi.org/10.1016/S0020-0190(97)00170-1 2003-11-20 Utility of Pathmax in Partial Order Heuristic Search. 317-322 1995 55 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl55.html#DasguptaCD95 http://dx.doi.org/10.1016/0020-0190(95)00086-R 2003-11-20 Agent Search in Uniform b-Ary Trees: Multiple Goals and Unequal Costs. 311-318 1996 58 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl58.html#DasguptaCD96 http://dx.doi.org/10.1016/0020-0190(96)00047-6 2003-11-20 Generalized Vertex-Rankings of Trees. 321-328 1995 56 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl56.html#ZhouNN95 http://dx.doi.org/10.1016/0020-0190(95)00172-7 2003-11-24 Binary space partitions for axis-parallel line segments: Size-height tradeoffs. 201-206 2002 84 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/S0020-0190(02)00284-3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl84.html#Arya02 2003-11-20 Efficient minimum spanning tree construction without Delaunay triangulation. 271-276 2002 81 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl81.html#ZhouSN02 http://dx.doi.org/10.1016/S0020-0190(01)00232-0 2003-11-20 ¹Metric. 219-223 1983 17 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl17.html#GuibasS83 2003-11-20 Some Equivalent Transformations of Recursive Programs Based on Their Schematic Properties. 275-283 1984 18 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl18.html#Trakhtenbrot84 2003-11-20 On Bounds for a Board Covering Problem. 281-284 1987 25 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl25.html#RaghavanV87 2003-11-20 A Note on a Multidimensional Searching Problem. 133-135 1977 6 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl6.html#RaghavanY77 2003-11-20 Partial Evaluation of Pattern Matching in Strings. 79-86 1989 30 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl30.html#ConselD89 2003-11-20 <i>k</i>-Ary Trees. 235-240 1998 65 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl65.html#KorshL98 http://dx.doi.org/10.1016/S0020-0190(97)00215-9 2003-11-20 <i>k</i>-Ary Trees. 7-11 1999 70 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl70.html#KorshL99 http://dx.doi.org/10.1016/S0020-0190(99)00035-6 2003-11-20 When does a correct mutual exclusion algorithm guarantee mutual exclusion? 131-134 2000 76 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl76.html#LamportPW00 http://dx.doi.org/10.1016/S0020-0190(00)00132-0 2003-11-20 Reply to the Paper "The Numerical Instability of Bini's Algorithm". 144-145 1982 14 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl14.html#Bini82 2003-11-20 Bypassing BDD construction for reliability analysis. 85-89 2000 75 Inf. Process. Lett. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl75.html#WilliamsNR00 http://dx.doi.org/10.1016/S0020-0190(00)00082-X 2003-11-20 Linear Lower Bounds on Unbounded Fan-In Boolean Circuits. 71-74 1985 21 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl21.html#Hromkovic85a 2003-11-20 The Complexity of Model Checking for Circumscriptive Formulae. 113-118 1992 44 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl44.html#Cadoli92 2003-11-20 Paired Sequential Lists in a memory Interval. 9-10 1979 8 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl8.html#Fraenkel79 2003-11-20 Two Dimensional Pattern Matching. 168-170 1977 6 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl6.html#Bird77 2003-11-20 The Jogger's Problem. 114-117 1981 13 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl13.html#Bird81 2003-11-20 Object-Oriented Interaction in Resource Constrained Scheduling. 65-67 1990 36 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl36.html#Biro90 2003-11-20 Erratum: Exact VC-Dimension of Boolean Monomials. 107 1996 60 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl59.html#NatschlagerS96a http://dx.doi.org/10.1016/S0020-0190(96)00160-3 2003-11-25 Flaw and modification of the iKP electronic payment protocols. 57-62 2003 86 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/S0020-0190(02)00480-5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl86.html#OgataF03 2003-11-20 Minimum-Cost Spanning Tree as a Path-Finding Problem. 291-293 1988 26 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl26.html#MaggsP88 2003-11-20 Real-Time Emulations of Bounded-Degree Networks. 269-276 1998 66 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl66.html#MaggsS98 http://dx.doi.org/10.1016/S0020-0190(98)00064-7 2003-11-20 Comments on a Lower Bound for Convex Hull Determination. 126 1980 11 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl11.html#Avis80 2003-11-20 Non-Partitionable Point Sets. 125-129 1984 19 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl19.html#Avis84 2003-11-20 A Complement to Tarjan's Result about the Lower Bound on the Complexity of the Set Union Problem. 59-65 1980 11 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl11.html#Banachowski80 2003-11-20 A Note on Enumarative Counting. 215-219 1991 38 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl38.html#CaiH91 2003-11-20 A note on the non-NP-hardness of approximate lattice problems under general Cook reductions. 61-66 2000 76 Inf. Process. Lett. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl76.html#CaiN00 http://dx.doi.org/10.1016/S0020-0190(00)00123-X 2003-11-20 Random Generation of Words in an Algebraic Language in Linear Binary Space. 229-233 1995 54 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl54.html#Goldwurm95 http://dx.doi.org/10.1016/0020-0190(95)00025-8 2003-11-20 Counting Closed Walks in Generalized de Bruijn Graphs. 135-138 1994 49 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl49.html#ShibataSO94 2003-11-20 On the Greedy Algorithm for Satisfiability. 53-55 1992 43 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl43.html#KoutsoupiasP92 2003-11-20 The 2-Evader Problem. 249-252 1996 57 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl57.html#KoutsoupiasP96 http://dx.doi.org/10.1016/0020-0190(96)00010-5 2003-11-20 A Distributed k-Mutual Exclusion Algorithm Using k-Coterie. 213-218 1994 49 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl49.html#KakugawaFYA94 2003-11-20 On Minimal Eulerian Graphs. 203-205 1981 12 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl12.html#PapadimitriouY81 2003-11-20 An Optimal Algorithm for the Maximum Alignment of Terminals. 75-82 1985 20 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl20.html#WidmayerW85 2003-11-20 Time- and Space-Optimal Contour Computation for a Set of Rectangles. 335-338 1987 24 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl24.html#WidmayerW87 2003-11-20 A Note on the `Parallel Computation Thesis'. 203-205 1983 17 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl17.html#Blum83 2003-11-20 Towards an Asymptotic Analysis of Karmarkar's Algorithm. 189-194 1986 23 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl23.html#Blum86 2003-11-20 Rank-r Decision Trees are a Subclass of r-Decision Lists. 183-185 1992 42 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl42.html#Blum92 2003-11-20 An O(n log n) Implementation of the Standard Method for Minimizing n-State Finite Automata. 65-59 1996 57 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl57.html#Blum96 http://dx.doi.org/10.1016/0020-0190(95)00199-9 2003-11-20 The Complexity of Searching in X+Y and Other Multisets. 103-109 1990 34 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl34.html#CosnardDF90 2003-11-20 On an on-line scheduling problem for parallel jobs. 297-304 2002 81 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl81.html#NaroskaS02 http://dx.doi.org/10.1016/S0020-0190(01)00241-1 2003-11-20 A Note on Approximate Convex Hulls. 55-56 1986 22 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl22.html#StojmenovicS86 2003-11-24 Two Shortest Path Metrics on Well-Formed Parentheses Strings. 283-287 1996 60 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl60.html#GermainP96 http://dx.doi.org/10.1016/S0020-0190(96)00180-9 2003-11-20 An Elementary Computer Algorithm for the Calculation of the Coefficient of Inbreeding. 153-163 1975 3 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl3.html#Stevens75 2003-11-20 Black-Box Polynomials Resultants. 201-204 1997 61 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl61.html#Encarnacion97 http://dx.doi.org/10.1016/S0020-0190(97)00016-1 2005-10-13 <sub>4</sub>-Tidy Graphs. 281-287 1997 62 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl62.html#FouquetPT97 http://dx.doi.org/10.1016/S0020-0190(97)00081-1 2003-11-20 The associativity of equivalence and the Towers of Hanoi problem. 71-76 2001 77 Inf. Process. Lett. 2-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl77.html#BackhouseF01 http://dx.doi.org/10.1016/S0020-0190(00)00205-2 2003-11-20 On the Rationality of Petri Net Languages. 145-146 1986 22 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl22.html#Schwer86 2003-11-20 Preserving Order in a Forest in Less Than Logarithmic Time and Linear Space. 80-82 1977 6 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl6.html#Boas77 2003-11-20 On the Omega(n log n) Lower Bound for Convex Hull and Maximal Vector Determination. 132-136 1980 10 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl10.html#Boas80 2003-11-20 Space Measures for Storage Modification Machines. 103-110 1989 30 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl30.html#Boas89 2003-11-24 Algorithms and reductions for rewriting problems II. 227-233 2002 84 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/S0020-0190(02)00395-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl84.html#Verma02 2003-11-20 Strings, Trees, and Patterns. 157-161 1992 41 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl41.html#Verma92 2003-11-20 Trivalent Cayley Graphs for Interconnection Networks. 329-335 1995 54 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl54.html#VadapalliS95 http://dx.doi.org/10.1016/0020-0190(95)00068-N 2003-11-20 Shortest Routing in Trivalent Cayley Graph Network. 183-188 1996 57 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl57.html#VadapalliS96 http://dx.doi.org/10.1016/0020-0190(96)00004-X 2006-09-07 Partially Specified Nearest Neighbor Searches Using k-d Trees. 53-56 1982 15 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl15.html#EastmanZ82 2003-11-20 Optimal Search Algorithm for a Minimum of a Discrete Periodic Bimodal Function. 233-239 1988 29 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl29.html#Veroy88 2003-11-20 Erratum: A Polynomial Bound on the Number of Light Cycles in an Undirected Graph. 247 1995 54 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl54.html#Subramanian95a http://dx.doi.org/10.1016/0020-0190(95)00061-G 2003-11-20 Partial Occam's Razor and its Applications. 179-185 1997 64 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl64.html#DomingoTW97 http://dx.doi.org/10.1016/S0020-0190(97)00169-5 2003-11-20 On spanning trees with restricted degrees. 163-165 2000 73 Inf. Process. Lett. 5-6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl73.html#KanekoY00 http://dx.doi.org/10.1016/S0020-0190(00)00018-1 2003-11-20 A Note on the Computational Complexity of the Pure Classical Implication Calculus. 277-278 1989 31 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl31.html#Stalmarck89 2003-11-20 Probabilistic Turing Machines and Recursively Enumerable Dedekind Cuts. 167-171 1984 19 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl19.html#ChrobakC84 2003-11-20 Reconstructing hv-Convex Polyominoes from Orthogonal Projections. 283-289 1999 69 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl69.html#ChrobakD99 http://dx.doi.org/10.1016/S0020-0190(99)00025-3 2003-11-20 Efficient Searching Using Partial Ordering. 71-75 1981 12 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl12.html#BorodinGLY81 2003-11-20 The Undecidability of a Word Problem: On a Conjecture of Strong, Maggiolo-Schettini and Rosen. 121-122 1981 12 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl12.html#Book81 2003-11-20 A Note on Random Sampling. 255-256 1988 29 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl29.html#ChrobakH88 2003-11-20 A Note on the Server Problem and a Benevolent Adversary. 173-175 1991 38 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl38.html#ChrobakL91 2003-11-20 On Random Oracle Separations. 7-10 1991 39 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl39.html#Book91 2003-11-20 On Collapsing the Polynomial-Time Hierarchy. 235-237 1994 52 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl52.html#Book94 2003-11-20 A Linear-Time Algorithm for Drawing a Planar Graph on a Grid. 241-246 1995 54 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl54.html#ChrobakP95 http://dx.doi.org/10.1016/0020-0190(95)00020-D 2003-11-20 Lazy Variable-Renumbering Makes Substitution Cheap. 229-232 1988 29 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl29.html#Boom88 2003-11-20 Remarks on String-Matching and One-Way Multihead Automata. 325-329 1987 24 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl24.html#ChrobakR87 2003-11-20 A simple analysis of the harmonic algorithm for two servers. 75-77 2000 75 Inf. Process. Lett. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl75.html#ChrobakS00 http://dx.doi.org/10.1016/S0020-0190(00)00070-3 2003-11-20 Lower Bounds for Sampling Algorithms for Estimating the Average. 17-25 1995 53 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl53.html#CanettiEG95 http://dx.doi.org/10.1016/0020-0190(94)00171-T 2003-11-20 An improved heuristic for "Ulam-Rényi game". 119-124 2000 73 Inf. Process. Lett. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl73.html#CicaleseV00 http://dx.doi.org/10.1016/S0020-0190(00)00007-7 2003-11-24 Binary search with delayed and missing answers. 239-247 2003 85 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/S0020-0190(02)00426-X http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl85.html#CicaleseV03 2003-11-20 Complexity of the Closest Vector Problem in a Lattice Generated by (0, 1)-Matrix. 121-126 1992 42 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl42.html#SzymanskiS92 2006-04-06 A Parallel Approach to Direct Analog-to-Residue Conversion. 249-252 1999 69 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl69.html#RadhakrishnanP99 http://dx.doi.org/10.1016/S0020-0190(99)00012-5 2003-11-20 A tradeoff between search and update in dictionaries. 243-247 2001 80 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl80.html#RadhakrishnanR01 http://dx.doi.org/10.1016/S0020-0190(01)00173-9 2003-11-20 Directed Monotone Contact Networks for Threshold Functions. 199-203 1994 50 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl50.html#RadhakrishnanS94 2003-11-20 A Distributed Algorithm for Distributed Termination. 293-297 1987 24 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl24.html#HazariZ87 2003-11-20 An Algorithm for Horizontal Decompositions. 91-95 1983 17 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl17.html#BraP83 2003-11-20 An Efficient Parallel Algorithm for Computing a Maximal Independent Set in a Hypergraph of Dimension 3. 309-313 1992 42 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl42.html#DahlhausKK92 2003-11-20 <i>h</i>-Colourable Subgraph Problem in Balanced Graphs. 301-303 1998 65 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl65.html#DahlhausMM98 http://dx.doi.org/10.1016/S0020-0190(98)00019-2 2003-11-20 Deciding Freeness for Program Schemes with a Single Unary Function. 98-102 1981 13 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl13.html#Chan81 2003-11-20 A Note on Redundant Disk Modulo Allocation. 121-123 1985 20 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl20.html#Chan85 2003-11-20 The Boundedness Problem for Three-Dimensional Vector Addition Systems with States. 287-289 1988 26 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl26.html#Chan88 2003-11-20 Backwards Analysis of the Karger-Klein-Tarjan Algorithm for Minimum Spanning. 303-304 1998 67 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl67.html#Chan98 http://dx.doi.org/10.1016/S0020-0190(98)00129-X 2003-11-20 A Coloring Problem for Weighted Graphs. 77-81 1997 61 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl61.html#GuanZ97 http://dx.doi.org/10.1016/S0020-0190(97)00002-1 2003-11-20 Sequence-to-Sequence Recursiveness. 1-6 1975 4 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl4.html#GermanoM75 2003-11-20 Outline of a Machine Without Branch Instructions. 117-119 1972 1 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl1.html#Bron72 2003-11-20 Task migration in 2D wormhole-routed mesh multicomputers. 103-110 2000 73 Inf. Process. Lett. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl73.html#Chen00 http://dx.doi.org/10.1016/S0020-0190(00)00005-3 2003-11-20 Signature files and signature trees. 213-221 2002 82 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl82.html#Chen02 http://dx.doi.org/10.1016/S0020-0190(01)00266-6 2003-11-25 An efficient minimum and maximum global snapshot algorithm. 155-159 2003 86 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/S0020-0190(02)00485-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl86.html#Chen03 2003-11-20 O(1) Space Complexity Deletion for AVL Trees. 147-149 1986 22 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl22.html#Chen86 2003-11-20 Characterizing Parallel Hierarchies by Reducibilities. 303-307 1991 39 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl39.html#Chen91 2003-11-20 Optimal Parallel Time Bounds for the Maximum Clique Problem on Intervals. 197-201 1992 42 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl42.html#Chen92 2003-11-20 Finding the k Quickset Simple Paths in a Network. 89-92 1994 50 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl50.html#Chen94 2003-11-20 Solving the Shortest-Paths Problem on Bipartite Permutation Graphs Efficiently. 259-264 1995 55 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl55.html#Chen95 http://dx.doi.org/10.1016/0020-0190(95)00084-P 2003-11-20 Test Sequence Generation from the Protocol Data Portion Based on the Selecting Chinese Postman Algorithm. 261-268 1998 65 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl65.html#Chen98 http://dx.doi.org/10.1016/S0020-0190(97)00208-1 2003-11-20 Arc Consistency Revisited. 175-184 1999 70 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl70.html#Chen99 http://dx.doi.org/10.1016/S0020-0190(99)00059-9 2003-11-20 On Totalistic Systolic Networks. 231-236 1988 26 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl26.html#CulikK88 2003-11-20 Parametrized Recurrent Systems for Image Generation. 267-274 1993 48 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl48.html#CulikK93 2003-11-20 Forward Checking and Intelligent Backtracking. 85-87 1989 32 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl32.html#Wolfram89 2003-11-20 Secure Information Storage and Retrieval Using New Results in Cryptography. 181-186 1979 8 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl8.html#CulikM79 2003-11-20 Transformational Semantics for Concurrent Programs. 87-91 1980 11 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl11.html#Broy80 2003-11-20 Denotational Semantics of Communicating Processes Based on a Language for Applicative Multiprogramming. 29-35 1983 17 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl17.html#Broy83 2003-11-20 Denotational Semantics of Communicating Sequential Programs. 253-259 1986 23 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl23.html#Broy86 2003-11-20 Predicative Specifications for Functional Programs Describing Communication Networks. 93-101 1987 25 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl25.html#Broy87 2003-11-20 A Note on Some Tree Similarity Measures. 39-42 1982 15 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl15.html#CulikW82 2003-11-20 Optimum Watchman Routes. 39-44 1988 28 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl28.html#Chin88 2003-11-20 On the Depth Complexity of the Counting Functions. 325-328 1990 35 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl35.html#Chin90 2003-11-20 Permutations on the Block PRAM. 69-73 1993 45 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl45.html#Chin93 2003-11-20 A Fault-Tolerant Broadcasting Algorithm for Hypercubes. 93-99 1998 66 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl66.html#Chiu98 http://dx.doi.org/10.1016/S0020-0190(98)00030-1 2003-11-20 Performance Evaluation of Concurrent Systems Using Petri Nets. 7-13 1984 18 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl18.html#Magott84 2003-11-20 Performance Evaluation of Dystems of Cyclic Sequential Processes with Mutual Exclusion Using Petri Nets. 229-232 1985 21 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl21.html#Magott85 2003-11-20 Performance Evaluation of Concurrent Systems Using Conflict-Free and Persistent Petri Nets. 77-80 1987 26 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl26.html#Magott87 2003-11-24 Ring embedding in faulty honeycomb rectangular torus. 277-284 2002 84 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/S0020-0190(02)00310-1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl84.html#ChoH02 2003-11-25 Generalized honeycomb torus. 185-190 2003 86 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/S0020-0190(02)00507-0 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl86.html#ChoH03 2005-02-16 On a Complexity Hierarchy Between L and NL. 177-182 1988 29 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl29.html#ChoH88 2003-11-20 The Parallel Complexity of Coarsest Set Partition Problems. 89-94 1992 42 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl42.html#ChoH92 2003-11-20 On the Complexity of Quaternion Multiplication. 177-179 1975 3 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl3.html#Groote75 2003-11-20 A Short Proof of the Decidability of Bisimulation for Normed BPA-Processes. 167-171 1992 42 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl42.html#Groote92 2003-11-20 Arithmetic of Finite Fields. 4-6 1982 14 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl14.html#Chor82 2003-11-20 Computing a Basis for a Finite Abelian p-Group. 161-163 1985 20 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl20.html#BeynonI85 2003-11-20 Simple Proof Techniques for Property Preservation via Simulation. 129-134 1996 60 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl60.html#Chou96 http://dx.doi.org/10.1016/S0020-0190(96)00149-4 2003-11-25 Distributed testing without encountering controllability and observability problems. 133-141 2003 88 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/S0020-0190(03)00364-8 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl88.html#UralW03 2006-05-02 A Structural Test Selection Criterion. 157-163 1988 28 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl28.html#UralY88 2003-11-20 On the Number of Candidate Keys. 266-269 1978 7 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl7.html#Demetrovics78 2003-11-25 Detecting directed 4-cycles still faster. 13-15 2003 87 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/S0020-0190(03)00252-7 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl87.html#EisenbrandG03 2003-11-20 <sup>1.5</sup>Sequential Machine Maps. 38-40 1979 8 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl8.html#Buda79 2003-11-20 Multiprocessor Automata. 257-261 1987 25 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl25.html#Buda87 2003-11-20 Creation and Reflexive Rights in Grammatical Protection Systems. 141-145 1985 21 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl21.html#Budd85 2003-11-20 Implementing Functional Programs Using Mutable Abstract Data Types. 277-286 1988 26 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl26.html#GopalakrishnanS88 2003-11-20 A Simple Analysis of the Error Probability of Two-Point Based Sampling. 91-96 1996 60 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl60.html#GopalakrishnanS96 http://dx.doi.org/10.1016/S0020-0190(96)00145-7 2003-11-20 On Average Time Hierarchies. 15-20 1994 49 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl49.html#GoldmannGH94 2003-11-20 Towards Optimal Two-Dimensional Indexing for Constraint Databases. 1-8 1997 64 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl64.html#BertinoCS97 http://dx.doi.org/10.1016/S0020-0190(97)00146-4 2003-11-20 Finding Good Approximate Vertex and Edge Partitions is NP-Hard. 153-159 1992 42 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl42.html#BuiJ92 2003-11-20 Finitely Representable Nested Relations. 165-173 1999 70 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl70.html#BertinoCW99 http://dx.doi.org/10.1016/S0020-0190(99)00062-9 2003-11-20 Bounds for 3-Matroid Intersection Problems. 81-83 1975 3 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl3.html#CameriniM75 2003-11-20 Concurrent Execution of Transaction Copies. 87-93 1987 24 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl24.html#Wolfson87 2003-11-20 An Algorithm for Colouring Perfect Planar Graphs. 97-101 1989 31 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl31.html#Stewart89 2003-11-20 Complete Problems for Symmetric Logspace Involving Free Groups. 263-267 1991 40 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl40.html#Stewart91 2003-11-20 Alternative Developments of Cyclic-Permutation Algorithms. 239-241 1992 41 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl41.html#Whaley92 2003-11-20 A Note on the Queens' Problem. 39-46 1986 23 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl23.html#FalkowskiS86 2003-11-20 An Efficient Deadlock Avoidance Algorithm. 25-30 1987 24 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl24.html#FinkelM87 2003-11-20 An ergodic theorem for read-once non-uniform deterministic finite automata. 23-28 2000 73 Inf. Process. Lett. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl73.html#GoldmannRT00 http://dx.doi.org/10.1016/S0020-0190(99)00162-3 2003-11-20 On the Maximum Length of Huffman Codes. 219-223 1993 45 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl45.html#Buro93 2003-11-20 The Graph of Multiplication is Equivalent to Counting. 199-201 1992 41 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl41.html#Buss92 2003-11-20 A Lower Bound for the Multiplication of Polynomials Modulo a Polynomial. 321-326 1992 41 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl41.html#Bshouty92 2003-11-20 On the Additive Complexity of 2 x 2 Matrix Multiplication. 329-335 1995 56 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl56.html#Bshouty95 http://dx.doi.org/10.1016/0020-0190(95)00176-X 2003-11-20 A Subexponential Exact Learning Algorithm for DNF Using Equivalence Queries. 37-39 1996 59 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl59.html#Bshouty96 http://dx.doi.org/10.1016/0020-0190(96)00077-4 2003-11-20 On Learning Multivariate Polynomials Under the Uniform Distribution. 303-309 1997 61 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl61.html#Bshouty97 http://dx.doi.org/10.1016/S0020-0190(97)00021-5 2003-11-20 An Optimal Parallel Algorithm for Generating Combinations. 135-139 1989 33 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl33.html#AklGS89 2003-11-20 On the Time to Traverse all Edges of a Graph. 335-337 1991 38 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl38.html#Zuckerman91 2003-11-20 Optimization of LR(k) ``Reduced Parsers''. 13-20 1992 41 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl41.html#AnconaFG92 2003-11-20 On the Generalized Twisted Cube. 49-52 1995 55 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl55.html#Chedid95 http://dx.doi.org/10.1016/0020-0190(95)00054-G 2003-11-20 New Results on MWT Subgraphs. 215-219 1999 69 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl69.html#AichholzerAH99 http://dx.doi.org/10.1016/S0020-0190(99)00018-6 2003-11-20 Software Data Paging and Segmentation for Complex Systems. 80-86 1972 1 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl1.html#DamT72 2005-09-16 A Model of Concurrency Control in Distributed Database Systems. 208-213 1982 14 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl14.html#ReddyBP82 2003-11-20 Size/lookahead tradeoff for LL(k)-grammars. 125-129 2001 80 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl80.html#BertschN01 http://dx.doi.org/10.1016/S0020-0190(01)00156-9 2003-11-20 Problems Complete for \oplus L. 247-250 1990 36 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl36.html#Damm90 2003-11-20 Depth-Efficient Simulation of Boolean Semi-Unbounded Circuits by Arithmetic Ones. 175-179 1999 69 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl69.html#Damm99 http://dx.doi.org/10.1016/S0020-0190(99)00007-1 2003-11-20 A Note on the Subtree Isomorphism for Ordered Trees and Related Problems. 81-84 1991 39 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl39.html#Grossi91 2003-11-20 A Fast Convex Hull Algorithm. 219-222 1978 7 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl7.html#AklT78a 2003-11-20 Christmas Tree: A Versatile 1-Fault-Tolerant Design for Token Rings. 55-63 1999 72 Inf. Process. Lett. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl72.html#HungHS99 http://dx.doi.org/10.1016/S0020-0190(99)00122-2 2003-11-20 Fault-Tolerant and Flexible Interconnection of Multiple Processors. 259-268 1988 28 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl28.html#DasF88 2003-11-20 A lower bound for approximating the geometric minimum weight matching. 253-255 2000 74 Inf. Process. Lett. 5-6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl74.html#DasS00 http://dx.doi.org/10.1016/S0020-0190(00)00062-4 2003-11-20 Width and Depth of Combinational Logic Circuits. 191-194 1981 13 Inf. Process. Lett. 4/5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl13.html#Yasuura81 2003-11-20 Constructing the Galois Adjoint. 137-139 1995 53 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl53.html#Club95 http://dx.doi.org/10.1016/0020-0190(94)00194-4 2003-11-20 Comments on: T. D. Bui ``On an L-Stable Method for Stiff Differential Equations''. 31-32 1980 11 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl11.html#Day80a 2003-11-20 Expected Time Analysis of Interpolation Merge - A Simple New Merging Algorithm. 277-281 1991 40 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl40.html#GuhaS91 2006-05-18 Arrangement Graphs: A Class of Generalized Star Graphs. 235-241 1992 42 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl42.html#DayT92 2006-05-18 Unidirectional Star Graphs. 123-129 1993 45 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl45.html#DayT93 2003-11-20 Space-Efficient Asynchronous Consensus Without Shared Memory Initialization. 101-105 1993 45 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl45.html#FischerMT93 2003-11-20 Immediate Error Detection in Strong LL(1) Parsers. 261-266 1979 8 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl8.html#FischerTM79 2005-01-11 An Encoding Scheme for the Efficient Representation of Hierarchical Structures. 199-206 1987 25 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl25.html#AlexandridisT87 2003-11-20 A Competitive 2-Server Algorithm. 85-91 1991 39 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl39.html#IraniR91 2003-11-20 Virginity: A Contribution to the Specification of Object-Oriented Software. 99-105 1999 70 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl70.html#LeinoS99 http://dx.doi.org/10.1016/S0020-0190(99)00043-5 2003-11-20 On Disjoint Concave Chains in Arrangements of (Pseudo) Lines. 189-192 1991 40 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl40.html#HalperinS91 2003-11-20 On Disjoint Concave Chains in Arrangements of (Pseudo) Lines. 53-56 1994 51 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl51.html#HalperinS94 2003-11-20 Width-restricted layering of acyclic digraphs with consideration of dummy nodes. 59-63 2002 81 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl81.html#BrankeLME02 http://dx.doi.org/10.1016/S0020-0190(01)00200-9 2006-08-05 A Memory-Management Unit for the Optimal Exploitation of a Small Address Space. 20-22 1982 15 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl15.html#BronDS82 2003-11-20 Random Oracles Separate PSPACE from the Polynomial-Time Hierarchy. 51-53 1987 26 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl26.html#Babai87 2003-11-20 An Application of Pattern Matching to a Problem in Geometrical Complexity. 6-7 1976 5 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl5.html#Manacher76 2003-11-20 Steady-Paced-Output and Fractional-On-Line Algorithms on a RAM. 47-52 1982 15 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl15.html#Manacher82 2003-11-20 On Verifying that a Concurrent Program Satisfies a Nondeterministic Specification. 17-23 1989 32 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl32.html#Sistla89 2003-11-20 Proving Correctness with Respect to Nondeterministic Safety Specifications. 45-49 1991 39 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl39.html#Sistla91 2003-11-20 An Algorithm for Determining an Opaque Minimal Forest of a Convex Polygon. 193-198 1987 24 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl24.html#Akman87 2003-11-20 An Optimally Efficient Selection Algorithm. 295-299 1988 26 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl26.html#Cole88 2003-11-20 Retrieval from Context Trees. 119-120 1975 3 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl3.html#Wegbreit75 2003-11-20 Short Propositional Formulas Represent Nondeterministic Computations. 269-270 1988 26 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl26.html#Cook88 2003-11-20 An Optimal Algorithm for Distributed Snapshots with Causal Message Ordering. 311-316 1994 50 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl50.html#AlagarV94 2003-11-20 Optimal Fault-Tolerant Routings for Connected Graphs. 169-174 1992 41 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl41.html#WadaLK92 2003-11-20 Toward a System's Environment for Computer Assisted Programming. 35-40 1976 5 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl5.html#LucenaC76 2003-11-20 An Optimal Parallel Algorithm for Linear Programming in the Plane. 213-217 1990 35 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl35.html#Deng90 2003-11-20 A Lower Bound for Communication in the Crossbar. 103-108 1996 57 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl57.html#Deng96 http://dx.doi.org/10.1016/0020-0190(95)00195-6 2003-11-20 Games and Winning Strategies. 165-172 1995 53 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl53.html#BackW95 http://dx.doi.org/10.1016/0020-0190(94)00206-E 2003-11-20 Finding an Approximate Minimum-Link Visibility Path Inside a Simple Polygon. 75-79 1995 55 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl55.html#AlsuwaiyelL95 http://dx.doi.org/10.1016/0020-0190(95)00072-K 2003-11-20 Many-Face Complexity in Incremental Convex Arrangements. 227-231 1994 51 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl51.html#DeyS94 2003-11-20 Alternating Real-Time Computations. 311-316 1988 28 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl28.html#LiskiewiczL88 2003-11-20 On the Decomposition of Sequences into Ascending Subsequences. 69 1985 21 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl21.html#Kaldewaij85 2003-11-20 A Unified Approach to Parallel Depth-First Traversals of General Trees. 49-55 1991 38 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl38.html#ChenDA91 2003-11-20 An NL Hierarchy. 21-26 1991 39 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl39.html#ChenCM91 2003-11-20 On the Quickest Path Problem. 125-128 1993 46 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl46.html#ChenH93a 2003-11-20 On the constructions of highly nonlinear zigzag functions and unbiased functions. 135-140 2001 79 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl79.html#ChenFW01 http://dx.doi.org/10.1016/S0020-0190(00)00182-4 2003-11-20 On Circularly-Hidden Surface Removal. 119-123 1998 66 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl66.html#BaekS98 http://dx.doi.org/10.1016/S0020-0190(98)00045-3 2003-11-20 An Exponential Lower Bound for the Pure Literal Rule. 215-219 1988 27 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl27.html#BugraraP88 2003-11-20 Erratum: Rectilinear Short Path Queries Among Rectangular Obstacles. 105 1996 60 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl57.html#ChenK96a http://dx.doi.org/10.1016/S0020-0190(96)00173-1 2003-11-20 A Note on Approximating Graph Genus. 317-322 1997 61 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl61.html#ChenKK97 http://dx.doi.org/10.1016/S0020-0190(97)00203-2 2003-11-20 The Full Quotient and its Closure Property for Regular Languages. 57-62 1998 65 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl65.html#KnapikP98 http://dx.doi.org/10.1016/S0020-0190(97)00218-4 2003-11-20 Document Retrieval Using Associative Processors. 64-67 1979 9 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl9.html#Teskey79 2003-11-20 Scheduling Independent 2-Processor Tasks to Minimize Schedule Length. 267-273 1984 18 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl18.html#BlazewiczWD84 2003-11-20 A Distributet Self-Stabilizing Solution to the Dining Philosophers Problem. 209-213 1992 41 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl41.html#HooverP92 2003-11-20 An Efficient Permutation-Based Parallel Range-Join Algorithm on N-Dimensional Torus Computers. 35-38 1994 52 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl52.html#ChenST94 2003-11-20 Hysterical B-trees. 199-202 1981 12 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl12.html#MaierS81 2003-11-25 A new differential LSI space-based probabilistic document classifier. 203-212 2003 88 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/j.ipl.2003.09.002 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl88.html#ChenTN03 2003-11-20 On the Time Complexity of Minimum and Maximum Global Snapshot Problems. 151-156 1998 67 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl67.html#ChenW98a http://dx.doi.org/10.1016/S0020-0190(98)00100-8 2003-11-20 When is a Pair of Matrices Mortal? 283-286 1997 63 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl63.html#BlondelT97 http://dx.doi.org/10.1016/S0020-0190(97)00123-3 2003-11-20 Response time behavior of distributed voting algorithms for managing replicated data. 247-253 2000 75 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl75.html#ChenWC00 http://dx.doi.org/10.1016/S0020-0190(00)00111-3 2003-11-20 A Memory-Efficient and Fast Huffman Decoding Algorithm. 119-122 1999 69 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl69.html#ChenWL99 http://dx.doi.org/10.1016/S0020-0190(99)00002-2 2003-11-20 A Lower Bound for Randomized On-Line Scheduling Algorithms. 219-222 1994 51 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl51.html#ChenVW94 2003-11-20 The Number of Minimal Word Chains Computing the Thue-Morse Word. 57-64 1992 44 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl44.html#Bousquet-Melou92 2003-11-20 More Information Theoretical Inequalities to be Used in Secret Sharing? 41-44 1997 63 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl63.html#Dijk97 http://dx.doi.org/10.1016/S0020-0190(97)00086-0 2003-11-20 Using Fewer Processors to Reduce Time Complexities of Semigroup Computations. 89-93 1989 32 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl32.html#ChenYC89 2003-11-20 Dynamic Deferred Data Structuring. 37-40 1990 35 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl35.html#ChingMS90 2003-11-20 A Self-Stabilizing Algorithm for Constructing Spanning Trees. 147-151 1991 39 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl39.html#ChenYH91 2003-11-20 Degrees of Constancy in Programming Languages. 35-38 1981 13 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl13.html#GunnH81 2003-11-20 Master Keys for Group Sharing. 23-25 1981 12 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl12.html#DenningS81 2005-11-08 Two Algorithms for Constructing a Binary Tree from its Traversals. 297-299 1988 28 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl28.html#ChenYL88 2003-11-20 Horizontally and Vertically Bounded Propagation of Privileges. 319-327 1986 22 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl22.html#LeissJ86 2003-11-20 On the Implementation of Constants. 1-4 1979 9 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl9.html#GunnM79 2003-11-20 Embedding Complete Binary Trees Into Hypercubes. 197-199 1991 38 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl38.html#LeissR91 2003-11-20 Automorphisms of Broadcasting Schemes with Respect to Start Rounds. 35-41 1994 51 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl51.html#IgarashiOU94 2003-11-20 Performance Analysis of File Organizations that Use Multi-Bucket Data Leaves. 301-310 1990 36 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl36.html#Matsliach90 2003-11-20 A self-adjusting quality of service control scheme. 337-344 2002 83 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl83.html#ChengC02 http://dx.doi.org/10.1016/S0020-0190(02)00212-0 2004-07-13 New lower and upper bounds for the competitive ratio of transmission protocols. 297-301 2004 89 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/j.ipl.2003.12.003 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl89.html#Li04 2003-11-20 A Faster Algorithm for Computing the Strength of a Network. 209-212 1994 49 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl49.html#ChengC94 2006-02-17 The Complexity of Scheduling Starting Time Dependent Tasks with Release Times. 75-79 1998 65 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl65.html#ChengD98 http://dx.doi.org/10.1016/S0020-0190(97)00195-6 2003-11-20 Kolmogorov random graphs only have trivial stable colorings. 133-136 2002 81 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl81.html#ChengF02 http://dx.doi.org/10.1016/S0020-0190(01)00206-X 2003-11-20 Efficient Dynamic Algorithms for Some Geometric Intersection Problems. 251-258 1990 36 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl36.html#ChengJ90 2003-11-20 On the Day-Tripathi orientation of the star graphs: Connectivity. 5-10 2000 73 Inf. Process. Lett. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl73.html#ChengL00 http://dx.doi.org/10.1016/S0020-0190(99)00155-6 2003-11-25 3/2-approximation for two-machine no-wait flowshop scheduling with availability constraints. 161-165 2003 88 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2003.08.002 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl88.html#ChengL03 2003-11-20 Two-Machine Flowshop Scheduling with Consecutive Availability Constraints. 49-54 1999 71 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl71.html#ChengW99 http://dx.doi.org/10.1016/S0020-0190(99)00094-0 2003-11-20 The Generic Oracle Hypothesis is False. 59-62 1993 45 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl45.html#Foster93 2003-11-20 On the Editing Distance Between Unordered Labeled Trees. 133-139 1992 42 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl42.html#ZhangSS92 2003-11-24 A simple approximation algorithm for the weighted matching problem. 211-213 2003 85 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/S0020-0190(02)00393-9 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl85.html#DrakeH03 2003-11-20 Testing the Universal Instance Assumption. 14-19 1980 10 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl10.html#HoneymanLY80 2003-11-20 On the Closure of Certain Function Classes Under Integer Division by Polynomially-Bounded Functions. 205-210 1992 44 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl44.html#Gupta92 2003-11-20 On Bounded-Probability Operators and C=P. 93-98 1993 48 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl48.html#Gupta93 2003-11-20 Generalized Dominators. 193-200 1995 53 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl53.html#Gupta95 http://dx.doi.org/10.1016/0020-0190(94)00192-2 2003-11-20 An Image Algorithm for Computing the Hausdorff Distance Efficiently in Linear Time. 87-89 1989 30 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl30.html#Shonkwiler89 2003-11-20 Computing the Hausdorff Set Distance in Linear Time for Any L_p Point Distance. 201-207 1991 38 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl38.html#Shonkwiler91 2003-11-20 Substantiable Evaluations by Electronic Computers and Their Application to one Problem in Combinatorial Geometry. 202-203 1979 8 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl8.html#PankovD79 2003-11-20 Acceptors for Isometric Parallel Context-Free Array Languages. 182-186 1981 13 Inf. Process. Lett. 4/5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl13.html#NakamuraA81 2003-11-20 Equivalence of recursive specifications in process algebra. 59-65 2001 80 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl80.html#PonseU01 http://dx.doi.org/10.1016/S0020-0190(01)00218-6 2003-11-20 A Remark on Two-Dimensional Finite Automata. 219-222 1980 10 Inf. Process. Lett. 4/5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl10.html#NakamuraI80 2003-11-20 Leftmost one Computation on Meshes with Row Broadcasting. 261-266 1993 47 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl47.html#Gurla93 2003-11-20 Corrigendum: Leftmost one Computation on Meshes with Row Broadcasting. 111 1994 50 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl50.html#Gurla94 2003-11-20 An Unintentional Omission from ALGOL 68. 244-245 1972 1 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl1.html#Baker72 2003-11-20 <i>J</i>Operator. 1-5 1999 70 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl70.html#HarperM99 http://dx.doi.org/10.1016/S0020-0190(99)00036-8 2003-11-20 On the Relationship Between varepsilon-Biased Random Variables and varepsilon-Dependent Random Variables. 17-23 1994 51 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl51.html#JimboM94a 2003-11-20 Feature Evaluation with Quadratic Mutual Information. 153-156 1972 1 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl1.html#Toussaint72 2003-11-20 Parallel p-adic Computation. 137-140 1988 28 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl28.html#Morrison88 2003-11-20 Average Competitive Ratios of On-Line Spanning Trees. 213-216 1997 62 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl62.html#BaoMI97 http://dx.doi.org/10.1016/S0020-0190(97)00064-1 2003-11-20 Verifying Nonrigidity. 91-95 1986 22 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl22.html#GoralcikK86 2003-11-20 Loop Unravelling: A Practical Tool in Proving Program Correctness. 70-72 1975 4 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl4.html#DuncanY75 2003-11-20 Programmed Simulation of Sequential Circuits. 4-6 1971 1 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl1.html#DuncanZ71 2003-11-20 On the Index of Positive Programmed Formal Languages. 105-110 1995 54 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl54.html#Dong95 http://dx.doi.org/10.1016/0020-0190(95)00008-Z 2003-11-25 Gales suffice for constructive dimension. 9-12 2003 86 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/S0020-0190(02)00454-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl86.html#Hitchcock03 2003-11-20 Bundle event structures: A revised cpo approach. 7-12 2002 83 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl83.html#FecherMW02 http://dx.doi.org/10.1016/S0020-0190(01)00310-6 2003-11-20 Improved Processor Bounds for Parallel Algorithms for Weighted Directed Graphs. 147-152 1993 45 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl45.html#Amato93 2003-11-20 Approximate Decision Algorithms for Approximate Congruence. 29-34 1992 43 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl43.html#Schirra92 2003-11-20 On Estimating Access Costs in Relational Databases. 157-161 1984 19 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl19.html#MaioST84 2003-11-20 Quantification in Algol-Like Languages. 133-137 1987 25 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl25.html#Tennent87a 2003-11-20 Decimal Adjustment of Long Numbers in Constant Time. 161-163 1997 62 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl62.html#DoringP97 http://dx.doi.org/10.1016/S0020-0190(97)00052-5 2003-11-20 Voronoi Diagrams from Convex Hulls. 223-228 1979 9 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl9.html#Brown79a 2003-11-20 A Faster Approximation Algorithm for the Steiner Tree Problem in Graphs. 79-83 1993 46 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl46.html#Zelikovsky93 2003-11-20 Analysis of a Greedy Heuristic for Finding Small Dominating Sets in Graphs. 237-240 1991 39 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl39.html#Parekh91 2003-11-20 On the Computational Complexity of Cardinality Constraints in Relational Databases. 98-101 1980 11 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl11.html#Kanellakis80 2003-11-20 A Polynomial Time Solution for Labeling a Rectlinear Map. 201-207 1998 65 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl65.html#PoonZC98 http://dx.doi.org/10.1016/S0020-0190(98)00002-7 2003-11-20 epsilon-Discrepancy Sets and Their Application for Interpolation of Sparse Polynomials. 337-342 1995 54 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl54.html#AlonM95 http://dx.doi.org/10.1016/0020-0190(95)00032-8 2003-11-20 A Statistical Model for Estimating the Number of Records in a Relational Database. 115-118 1982 15 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl15.html#Cheung82 2003-11-20 A Space-Efficient Fast Prime Number Sieve. 79-84 1996 59 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl59.html#DuntenJS96 http://dx.doi.org/10.1016/0020-0190(96)00099-3 2003-11-20 A Probabilistic Simulation of PRAMs on a Bounded Degree Network. 141-147 1988 28 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl28.html#LuccioPP88 2003-11-20 Analysis of Parallel Uniform Hashing. 67-69 1991 37 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl37.html#LuccioPP91 2003-11-25 An efficient stream authentication scheme using tree chaining. 1-8 2003 86 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/S0020-0190(02)00456-8 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl86.html#ParkCC03 2003-11-20 Uniform Partitioning of Relations Using Histogram Equalization Framework: An Efficient Parallel Hash-Based Join. 283-289 1995 55 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl55.html#ParkCK95 http://dx.doi.org/10.1016/0020-0190(95)00091-P 2003-11-20 A Lower Bound for the Nondeterministic Space Complexity of Context-Free Recognition. 25-27 1992 42 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl42.html#AltGM92 2003-11-20 Efficient Token-Based Control in Rings. 175-180 1998 66 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl66.html#FeuersteinLMS98 http://dx.doi.org/10.1016/S0020-0190(98)00054-4 2003-11-20 Order-of-Demand Analysis for Lazy Languages. 343-348 1995 55 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl55.html#ParkG95a http://dx.doi.org/10.1016/0020-0190(95)00120-2 2003-11-20 Finding all the Palindromes in a Binary Tree in Linear Time and Space. 73-77 1992 44 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl44.html#IacoL92 2003-11-20 A Simplified Solution of the n Queens Problem. 253-255 1987 25 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl25.html#Reichling87 2003-11-20 On the Detection of a Common Intersection of k Convex Objects in the Plane. 25-29 1988 29 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl29.html#Reichling88 2003-11-20 The RS-tree: An efficient data structure for distance browsing queries. 195-203 2001 80 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl80.html#ParkHK01 http://dx.doi.org/10.1016/S0020-0190(01)00163-6 2003-11-20 <sup>1/2</sup>Lower Bound on the Number of Additions Necessary to Compute 0-1 Polynomials over the Ring of Integer Polynomials. 178-180 1979 8 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl8.html#RivestW79 2003-11-20 Partial Match Retrieval in Implicit Data Structures. 61-65 1984 19 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl19.html#AltMM84 2003-11-20 On the Parallel Evaluation of Division-Free Arithmetic Expressions with Fan-In of Three. 18-19 1976 5 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl5.html#Barak76 2003-11-20 On the Reduction of LR(k) Parsers. 245-251 1993 47 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl47.html#ParkLC93 2003-11-20 An O(1) Time Optimal Algorithm for Multiplying Matrices on Reconfigurable Mesh. 109-113 1993 47 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl47.html#ParkKP93 2003-11-20 The Working Set Algorithm has Competitive Ratio Less Than Two. 183-188 1997 63 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl63.html#ParkMC97 http://dx.doi.org/10.1016/S0020-0190(97)00128-2 2003-11-20 The Effects of Checkpointing on Program Execution Time. 221-229 1983 16 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl16.html#Duda83 2005-01-19 Efficient Backward execution in and/or Process Model. 191-198 1988 29 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl29.html#ParkPK88 2003-11-20 An O(n log n) Feasibility Algorithm for Preemptive Scheduling of n Independent Jobs on a Hypercube. 7-11 1990 35 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl35.html#AhujaZ90 2003-11-25 On structural properties of eta-expansions of identity. 327-333 2003 87 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/S0020-0190(03)00344-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl87.html#IntrigilaN03 2003-11-20 New bounds on the size of the minimum feedback vertex set in meshes and butterflies. 275-280 2002 83 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl83.html#CaragiannisKK02 http://dx.doi.org/10.1016/S0020-0190(02)00266-1 2003-11-25 A logarithmic approximation algorithm for the minimum energy consumption broadcast subgraph problem. 149-154 2003 86 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/S0020-0190(02)00484-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl86.html#CaragiannisKK03 2003-11-20 Mod m Arithmetic in Binary Systems. 303-309 1991 40 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl40.html#Barsi91 2003-11-20 Decoding Residue Codes. 213-222 1995 54 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl54.html#Barsi95 http://dx.doi.org/10.1016/0020-0190(95)00014-4 2003-11-20 Program Schemata with Polynomial Bounded Counters. 91-96 1975 3 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl3.html#Weihrauch75 2003-11-20 An Alternative for the Implementation of the Knuth-Morris-Pratt Algorithm. 134-137 1981 13 Inf. Process. Lett. 4/5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl13.html#Barth81 2003-11-20 An Analytical Comparison of Two String Search Algorithms. 249-256 1984 18 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl18.html#Barth84 2003-11-20 Optimal Broadcasting in the Back to Back d-ary Trees. 85-89 1996 59 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl59.html#Barth96 http://dx.doi.org/10.1016/0020-0190(96)00071-3 2003-11-20 A Term Equality Problem Equivalent to Graph Isomorphism. 61-66 1994 51 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl51.html#Basin94 2003-11-20 Rudimentary Reductions Revisited. 89-95 1991 40 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl40.html#AllenderG91 2003-11-20 On Converting Character Strings to Integers. 17-19 1984 19 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl19.html#Parker84 2003-11-20 An Improved Deterministic Algorithm for Generating Different Many-Element Random Samples. 95-101 1997 62 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl62.html#AmirD97 http://dx.doi.org/10.1016/S0020-0190(97)00047-1 2003-11-20 Two-Dimensional Dictionary Matching. 233-239 1992 44 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl44.html#AmirF92 2003-11-20 Optimal Availability Quorum Systems: Theory and Practice. 223-228 1998 65 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl65.html#AmirW98 http://dx.doi.org/10.1016/S0020-0190(98)00017-9 2003-11-20 Sorting by Distributive Partitioning. 1-6 1978 7 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl7.html#Dobosiewicz78 2003-11-20 The Practical Significance of d.p.Sort Revisited. 170-172 1979 8 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl8.html#Dobosiewicz79 2003-11-20 An Efficient Variation of Bubble Sort. 5-6 1980 11 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl11.html#Dobosiewicz80 2003-11-20 A Note on Natural Selection. 239-243 1985 21 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl21.html#Dobosiewicz85 2003-11-20 Finding the Upper Envelope of n Line Segments in O(n log n) Time. 169-174 1989 33 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl33.html#Hershberger89 2003-11-20 A New Data Structure for Shortest Path Queries in a Simple Polygon. 231-235 1991 38 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl38.html#Hershberger91 2003-11-20 A Faster Algorithm for the Two-Center Decision Problem. 23-29 1993 47 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl47.html#Hershberger93 2003-11-20 Highly nonlinear balanced Boolean functions with good local and global avalanche characteristics. 281-286 2002 83 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl83.html#Maitra02 http://dx.doi.org/10.1016/S0020-0190(02)00207-7 2003-11-25 Fault-tolerant cycle-embedding of crossed cubes. 149-154 2003 88 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/j.ipl.2003.08.007 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl88.html#YangLTH03 2003-11-20 Limited bookmark randomized online algorithms for the paging problem. 155-162 2000 76 Inf. Process. Lett. 4-6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl76.html#BeinFL00 http://dx.doi.org/10.1016/S0020-0190(00)00140-X 2003-11-20 Undecidability of Partial Order Logics. 137-143 1999 69 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl69.html#AlurP99 http://dx.doi.org/10.1016/S0020-0190(99)00005-8 2003-11-20 Approximating the Minimum Maximal Independence Number. 169-172 1993 46 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl46.html#Halldorsson93a 2003-11-20 A Fast Parallel Algorithm for the Closest Pair Problem. 49-52 1980 11 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl11.html#Dyer80 2003-11-20 An improved FPTAS for Restricted Shortest Path. 287-291 2002 83 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl83.html#ErgunSZ02 http://dx.doi.org/10.1016/S0020-0190(02)00205-3 2003-11-20 Cryptanalysis of Certain Variants of Rabin's Signature Scheme. 113-115 1984 19 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl19.html#ShamirS84 2003-11-25 Structured programming: A minor part of software engineering. 53-58 2003 88 Inf. Process. Lett. 1-2 http://dx.doi.org/10.1016/S0020-0190(03)00389-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl88.html#Parnas03 2005-04-11 On the Graceful Numbering of Spanning Trees. 115-118 1975 3 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl3.html#CahitC75 2003-11-20 Drawing Outerplanar Minimum Weight Triangulations. 253-260 1996 57 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl57.html#LenhartL96 http://dx.doi.org/10.1016/0020-0190(96)00012-9 2003-11-20 A Metric for Traces. 129-135 1990 35 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl35.html#Kwiatkowska90 2003-11-20 A Practical Method for Finding the Optimum Postponement Transformation for LR(k) Parsers. 63-67 1988 27 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl27.html#Witaszek88 2003-11-20 A Run-Time Mechanism for Referencing Variables. 14-16 1971 1 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl1.html#HenhaplJ71 2003-11-20 On the Optimality of the Counter Scheme for Dynamic Linear Lists. 175-179 1991 37 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl37.html#HofriS91 2003-11-20 Oriented Balanced Trees and Equivalence Relations. 226-228 1972 1 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl1.html#Bayer72 2003-11-20 The music of streams. 189-195 2001 77 Inf. Process. Lett. 2-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl77.html#McIlroy01 http://dx.doi.org/10.1016/S0020-0190(00)00201-5 2003-11-20 Reduction of Network Cost and Wiring in Ranade's Butterfly Routing. 63-67 1993 45 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl45.html#CrossDK93 2003-11-20 A Note on the Horton-Strahler Number for Random Binary Search Trees. 47-51 1999 69 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl69.html#Kruszewski99 http://dx.doi.org/10.1016/S0020-0190(98)00192-6 2003-11-20 Analysis of a Periodically Inspected Buffer. 124-130 1979 8 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl8.html#Vikas79 2003-11-20 The Complexity of Some Complementation Problems. 159-165 1999 71 Inf. Process. Lett. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl71.html#PlaistedK99 http://dx.doi.org/10.1016/S0020-0190(99)00102-7 2003-11-20 The Total Interval Number of a Tree and the Hamiltonian Completion Number of its Line Graph. 299-306 1995 56 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl56.html#Raychaudhuri95 http://dx.doi.org/10.1016/0020-0190(95)00163-8 2003-11-20 Reducing the Overhead of the AESA Metric-Space Nearest Neighbour Searching Algorithm. 265-271 1995 56 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl56.html#Vilar95 http://dx.doi.org/10.1016/0020-0190(95)00161-X 2003-11-20 An Asymptotic Comment on a Paper by Analyti and Pramanik. 327-328 1994 49 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl49.html#Prodinger94 2003-11-20 Multiple Quickselect - Hoare's Find Algorithm for Several Elements. 123-129 1995 56 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl56.html#Prodinger95 http://dx.doi.org/10.1016/0020-0190(95)00150-B 2003-11-20 Fast One's-Complement Multiplication. 73-79 1991 39 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl39.html#Omondi91 2003-11-20 On the desirability of mechanizing calculational proofs. 173-179 2001 77 Inf. Process. Lett. 2-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl77.html#ManoliosM01 http://dx.doi.org/10.1016/S0020-0190(00)00200-3 2003-11-20 <sub>2</sub>Algorithm for Testing Similarity of Matrices. 253-254 1989 30 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl30.html#ZalcsteinG89 2003-11-20 Multiple Cuts, Input Repetition, and VLSI Complexity. 19-24 1987 24 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl24.html#Hochschild87 2003-11-20 Intersection Number of Two Connected Geometric Graphs. 331-333 1996 59 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl59.html#Tokunaga96 http://dx.doi.org/10.1016/0020-0190(96)00124-X 2003-11-25 Functions that have read-once branching programs of quadratic size are not necessarily testable. 25-29 2003 87 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/S0020-0190(03)00230-8 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl87.html#BolligW03 2003-11-20 A Very Simple Function that Requires Exponential Size Read-Once Branching Programs. 53-57 1998 66 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl66.html#BolligW98 http://dx.doi.org/10.1016/S0020-0190(98)00042-8 2003-11-20 An Agent Calculus with Simple Actions Where the Enabling and Disabling are Derived Operators. 213-218 1991 40 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl40.html#Massart91 2003-11-20 Systems of Distinct Representatives for k Families of Sets. 195-196 1979 9 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl9.html#Szwarcfiter79 2003-11-20 A Note on the Computation of the k-Closure of a Graph. 279-280 1987 24 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl24.html#Szwarcfiter87 2003-11-20 <sup>n</sup>) using projective coordinates. 101-103 2000 76 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl76.html#HiguchiT00 http://dx.doi.org/10.1016/S0020-0190(00)00134-4 2003-11-20 On Inclusion Problem for Deterministic Multitape Automata. 144-146 1980 11 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl11.html#Kinber80 2003-11-20 Multiserialization of Iterated Transactions. 243-247 1984 18 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl18.html#FleR84 2003-11-20 Minimum Node Disjoint Path Covering for Circular-Arc Graphs. 159-161 1979 8 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl8.html#BonuccelliB79 2003-11-20 Priority Queues with Update and Finding Minimum Spanning Trees. 53-57 1975 4 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl4.html#Johnson75 2003-11-20 The Complexity of a VLSI Adder. 92-93 1980 11 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl11.html#Johnson80 2003-11-20 Jump Interpolation Search Trees and Symmetric Binary Numbers. 193-204 1987 26 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl26.html#GuntzerP87 2003-11-25 A note on monotone complexity and the rank of matrices. 321-326 2003 87 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/S0020-0190(03)00334-X http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl87.html#GalP03 2003-11-20 On the Size of Nonredundant FD-Covers. 355-360 1987 24 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl24.html#Gottlob87a 2003-11-20 Lower and Upper Power Domain Constructions Commute on all Cpos. 7-11 1991 40 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl40.html#Heckmann91 2003-11-20 NP-Completeness of Some Generalizations of the Maximum Matching Problem. 14-19 1982 15 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl15.html#StockmeyerV82 2003-11-20 Two Types of Properties for Complexity Measures. 123-126 1981 12 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl12.html#Lischke81 2003-11-20 Derivation of an O(k² log n) Algorithm for Computing Order-k Fibonacci Numbers From the O(k³ log n) Matrix Multiplication Method. 172-179 1980 11 Inf. Process. Lett. 4/5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl11.html#Pettorossi80 2003-11-20 From Algebra to Operational Semantics. 75-80 1993 45 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl45.html#JifengH93 2003-11-20 Some Optimal Algorithms for Decomposed Partially Ordered Sets. 39-43 1992 44 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl44.html#Garg92 2003-11-20 On Embedding Functions in Logic. 41-46 1984 19 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl19.html#SubrahmanyamY84 2003-11-20 Routing and path multicoloring. 249-256 2001 80 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl80.html#NomikosPZ01 http://dx.doi.org/10.1016/S0020-0190(01)00167-3 2003-11-20 The Complexity of Matching with Bonds. 297-300 1989 32 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl32.html#PadbergS89 2003-11-20 Verifying lossy channel systems has nonprimitive recursive complexity. 251-261 2002 83 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl83.html#Schnoebelen02 http://dx.doi.org/10.1016/S0020-0190(01)00337-4 2003-11-20 Distributed Algorithms for Depth-First Search. 7-12 1996 60 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl60.html#MakkiH96 http://dx.doi.org/10.1016/S0020-0190(96)00141-X 2003-11-20 On Computing Approximate Convex Hulls. 121-126 1983 16 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl16.html#Soisalon-Soininen83 2003-11-20 The Graph Clustering Problem has a Perfect Zero-Knowledge Interactive Proof. 201-206 1999 69 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl69.html#SantisCGP99 http://dx.doi.org/10.1016/S0020-0190(99)00010-1 2003-11-20 Genetic Order and Compactifying Garbage Collectors. 27-32 1978 7 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl7.html#TerashimaG78 2003-11-20 Linear Congruence Equations for the Solutions of the N-Queens Problem. 301-306 1992 41 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl41.html#ErbasTA92 2003-11-20 Independent Spanning Trees of Chordal Rings. 155-160 1999 69 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl69.html#IwasakiKOI99 http://dx.doi.org/10.1016/S0020-0190(98)00205-1 2003-11-20 Generating Languages by a Derivation Procedure for Elementary Formal Systems. 161-166 1999 69 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl69.html#SugimotoI99 http://dx.doi.org/10.1016/S0020-0190(99)00006-X 2003-11-20 A Guided Tour of the Mathematics of MetaSoft'88. 81-86 1988 29 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl29.html#Blikle88 2003-11-20 Approximating low-congestion routing and column-restricted packing problems. 19-25 2000 74 Inf. Process. Lett. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl74.html#BavejaS00 http://dx.doi.org/10.1016/S0020-0190(00)00033-8 2003-11-20 Manipulation of Data Structures Without Pointers. 135-143 1987 26 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl26.html#SajeevO87 2003-11-20 Generalization of Floyd's Model on Permuting Information in Idealized Two-Level Storage. 183-188 1983 16 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl16.html#TsudaST83 2003-11-20 A Fair Banker's Algorithm for Read and Write Locks. 131-137 1993 48 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl48.html#HensgenSC93 2003-11-25 A new approach for approximating node deletion problems. 231-236 2003 88 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/j.ipl.2003.08.005 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl88.html#OkunB03 2003-11-20 Implicit Data Structures for Linear Hashing Schemes. 183-189 1988 29 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl29.html#OukselS88 2003-11-20 A Simple Proof of a Completeness Result for leads-to in the UNITY Logic. 35-38 1992 41 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl41.html#Pachl92 2003-11-20 A Linear-Processor Algorithm for Depth-First Search in Planar Graphs. 119-123 1988 29 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl29.html#Shannon88 2003-11-20 A Fast Algorithm for Building Lattices. 199-204 1999 71 Inf. Process. Lett. 5-6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl71.html#NourineR99 http://dx.doi.org/10.1016/S0020-0190(99)00108-8 2003-11-20 An Efficient Implementation of Vector Clocks. 47-52 1992 43 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl43.html#SinghalK92 2003-11-20 An Optimality Proof for Asynchronous Recovery Algorithms in Distributed Systems. 117-121 1995 55 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl55.html#SinghalM95 http://dx.doi.org/10.1016/0020-0190(95)00094-S 2004-11-17 Optimal preemptive semi-online scheduling on two uniform processors. 219-223 2004 92 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/j.ipl.2004.09.003 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl92.html#Du04 2003-11-20 A Polynomial Algorithm for Computation of the Probability of Conflicts in a Database Under Arbitrary Data Access Distribution. 69-74 1988 27 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl27.html#SinghalY88 2003-11-20 Designing Algorithms by Expectations. 31-34 1994 51 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl51.html#GilM94 2003-11-20 How to Cope with Faulty Processors in a Completely Connected Network of Communicating Processors. 207-213 1985 20 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl20.html#Gils85 2003-11-20 On the `Correct Prefix Property' in Precedence Parsers. 161-165 1983 17 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl17.html#Wyrostek83 2003-11-20 Robust Vector Space Secret Sharing Schemes. 107-111 1998 68 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl68.html#Padro98 http://dx.doi.org/10.1016/S0020-0190(98)00149-5 2003-11-20 On-The-Fly Analysis of Distributed Computations. 267-274 1995 54 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl54.html#FromentinJJR95 http://dx.doi.org/10.1016/0020-0190(95)00048-H 2003-11-20 The Automatic Synthesis of Iterative Programs. 67-73 1982 14 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl14.html#Gini82 2003-11-20 On the Generation of Permutations. 180-183 1975 3 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl3.html#Pleszczynski75 2003-11-25 Shift-or string matching with super-alphabets. 201-204 2003 87 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/S0020-0190(03)00296-5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl87.html#Fredriksson03 2003-11-20 A Simple Characterization of Database Dependency Implication. 281-283 1986 22 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl22.html#HanataniF86 2003-11-20 Two Decidability Problems for Infinite Words. 135-140 1986 22 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl22.html#Gire86 2003-11-25 A bandwidth latency tradeoff for broadcast and reduction. 33-38 2003 86 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/S0020-0190(02)00473-8 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl86.html#SandersS03 2003-11-25 On the security of cryptosystem using automorphism groups. 293-298 2003 88 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/j.ipl.2003.09.001 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl88.html#Paeng03 2003-11-20 PDL with Data Constants. 35-41 1985 20 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl20.html#PassyT85 2003-11-20 On the Generation of Compilers from Language Definitions. 104-107 1980 10 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl10.html#Pagan80 2003-11-20 Every Iterated Morphism Yields a co-CFL. 7-9 1986 22 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl22.html#Berstel86 2003-11-20 An Improved Algorithm for Traversing Binary Trees Without Auxiliary Stack. 12-14 1973 2 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl2.html#Robson73 2003-11-20 A Simple Solution to the Interleaved Memory Bandwidth Problem. 125-126 1975 3 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl3.html#Robson75 2003-11-20 ⁿSpace. 220-222 1979 9 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl9.html#Robson79 2003-11-20 Storage Allocation is NP-Hard. 119-125 1980 11 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl11.html#Robson80 2003-11-20 Separating Strings with Small Automata. 209-214 1989 30 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl30.html#Robson89 2003-11-20 Random Access Machines with Multi-Dimensional Memories. 265-266 1990 34 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl34.html#Robson90 2003-11-24 Enumerating submultisets of multisets. 221-226 2003 85 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/S0020-0190(02)00394-0 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl85.html#Hage03 2003-11-20 Self-Adjusting Hash Tables. 23-25 1985 21 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl21.html#Pagli85 2003-11-20 On the Communication Complexity of Polling. 317-323 1996 59 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl59.html#Rescigno96 http://dx.doi.org/10.1016/0020-0190(96)00127-5 2003-11-20 Time Lower Bounds for Sorting on Multi-Dimensional Mesh-Connected Processor Arrays. 233-238 1990 33 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl33.html#HanI90 2003-11-20 Scheduling Real-Time Computations with Separation Constraints. 61-66 1992 42 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl42.html#HanL92 2003-11-20 Using Overloading to Express Distinctions Between Evaluators. 1-8 1993 48 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl48.html#Hall93 2003-11-20 Cyclic-cubes and wrap-around butterflies. 25-27 2000 75 Inf. Process. Lett. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl75.html#WaghMG00 http://dx.doi.org/10.1016/S0020-0190(00)00074-0 2003-11-20 On the Maximum Edge Length in VLSI Layouts of Complete Binary Trees. 19-23 1986 23 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl23.html#Schmeck86 2003-11-20 A fast correlation attack on LILI-128. 127-132 2002 81 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl81.html#JonssonJ02 http://dx.doi.org/10.1016/S0020-0190(01)00208-3 2003-11-20 Towards a Formal Proof System for omega-Rational Expressions. 173-177 1984 19 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl19.html#DarondeauK84 2003-11-20 Fair Reconstruction of a Secret. 45-47 1995 55 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl55.html#Harn95 http://dx.doi.org/10.1016/0020-0190(95)00045-E 2003-11-20 Permutation Inversions and Multidimensional Cumulative Distribution Functions. 218-222 1982 14 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl14.html#Hart82 2003-11-20 The Worst Case Analysis of Algorithm on Multiple Stacks Manipulation. 107-111 1992 44 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl44.html#ChienY92 2003-11-20 A Unifying Framework for Trie Design Heuristics. 243-249 1990 34 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl34.html#Murphy90 2003-11-20 An Efficient Algorithm for Detection of Combined Occurrences. 137-140 1979 8 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl8.html#AjangT79 2003-11-20 Extendible Hashing with Overflow. 227-232 1982 15 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl15.html#Tamminen82 2003-11-20 Analysis of N-Trees. 131-137 1983 16 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl16.html#Tamminen83 2003-11-20 Recognition of Perfect Elimination Bipartite Graphs. 179-182 1982 15 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl15.html#GohR82 2003-11-20 Average Time Analyses of Simplified Davis-Putnam Procedures. 72-75 1982 15 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl15.html#GoldbergPB82 2003-11-20 Generalization of a New Definition of Consistency for Pairwise Comparisons. 273-276 1994 52 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl52.html#DuszakK94 2003-11-20 Deciding the Immutability of Regular Codes and Languages Under Finite Transductions. 239-241 1989 31 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl31.html#Head89 2003-11-20 A Polynomial-Time Algorithm for Knapsack with Divisible Item Sizes. 217-221 1997 62 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl62.html#VerhaeghA97 http://dx.doi.org/10.1016/S0020-0190(97)00061-6 2003-11-20 Collisionful Keyed Hash Functions with Selectable Collisions. 167-170 1995 55 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl55.html#Gong95 http://dx.doi.org/10.1016/0020-0190(95)00085-Q 2003-11-20 A Note on the Kolmogorov Data Complexity and Nonuniform Logical Definitions. 187-195 1997 64 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl64.html#Tyszkiewicz97 http://dx.doi.org/10.1016/S0020-0190(97)00172-5 2003-11-20 Defining Database Dynamics with Attribute Grammars. 132-138 1982 14 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl14.html#RidjanovicB82 2003-11-20 On Generating B-Trees with Constant Average Delay and in Lexicographic Order. 27-32 1994 49 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl49.html#BelbarakaS94 2003-11-20 Automatic Solution of a Certain Class of Combinatorial Problems. 101-104 1977 6 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl6.html#CohenK77 2003-11-20 Rationality of Division Orderings. 307-311 1992 44 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl44.html#CohenS92 2003-11-20 Tight Chip Area Lower Bounds for Discrete Fourier and Walsh-Hadamard Transformations. 245-247 1985 21 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl21.html#DurisSVT85 2003-11-20 Polynomial Division with a Remainder by Means of Evaluation and Interpolation. 149-153 1992 44 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl44.html#PanSL92 2003-11-20 Fifo-Optimal Placement on Pages of Independently Referenced Sectors. 46-49 1977 6 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl6.html#EndresS77 2003-11-20 Note on Shortest and Nearest Lattice Vectors. 183-188 1997 61 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl61.html#Henk97 http://dx.doi.org/10.1016/S0020-0190(97)00019-7 2003-11-20 An Approximation Algorithm for Least Median of Squares Regression. 237-241 1997 63 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl63.html#Olson97 http://dx.doi.org/10.1016/S0020-0190(97)00132-4 2003-11-20 <i>k</i>-Acyclic Families of Subtrees and Relational Database Query Processing. 1-6 1998 66 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl66.html#GavrilS98 http://dx.doi.org/10.1016/S0020-0190(98)00028-3 2003-11-24 An efficient upper bound of the rotation distance of binary trees. 87-92 2000 73 Inf. Process. Lett. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl73.html#Pallo00 http://dx.doi.org/10.1016/S0020-0190(00)00008-9 2003-11-20 A note on constructing binary heaps with periodic networks. 129-134 2002 83 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl83.html#Piotrow02 http://dx.doi.org/10.1016/S0020-0190(01)00320-9 2003-11-20 Some Comments on Building Heaps in Parallel. 145-148 1993 47 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl47.html#LuchettiP93 2003-11-24 Generating binary trees by Glivenko classes on Tamari lattices. 235-238 2003 85 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/S0020-0190(02)00417-9 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl85.html#Pallo03 2003-11-24 On the Rotation Distance in the Lattice of Binary Trees. 369-374 1987 25 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl25.html#Pallo87 2003-11-24 A Distance Metric on Binary Trees Using Lattice-Theoretic Measures. 113-116 1990 34 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl34.html#Pallo90 2006-02-01 A Linear Algorithm for Bipartition of Biconnected Graphs. 227-231 1990 33 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl33.html#ZuzukiTN90 2003-11-20 On the Clark-Jacob Version of SPLICE/AS. 251-254 1997 62 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl62.html#Gray97 http://dx.doi.org/10.1016/S0020-0190(97)00072-0 2003-11-24 Algorithms for multicast connection under multi-path routing model. 31-39 2002 84 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/S0020-0190(02)00220-X http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl84.html#GuHZ02 2003-11-20 New Linear Time Algorithms for Generating Perfect Elimination Orderings of Chordal Graphs. 111-115 1996 58 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl58.html#Panda96 http://dx.doi.org/10.1016/0020-0190(96)00013-0 2003-11-20 Legacy. 123-129 2001 77 Inf. Process. Lett. 2-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl77.html#Hoare01 http://dx.doi.org/10.1016/S0020-0190(00)00209-X 2003-11-20 A General Conservation Law for Queueing Disciplines. 82-85 1973 2 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl2.html#Hoare73 2003-11-20 Optimization of Store Size for Garbage Collection. 165-166 1974 2 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl2.html#Hoare74 2003-11-20 Fixed Points of Increasing Functions. 111-112 1990 34 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl34.html#Hoare90 2003-11-20 On the Computational Power of the Floor Function. 1-3 1982 14 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl14.html#Schmitt82 2003-11-20 Infinite Lyndon Words. 101-104 1994 50 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl50.html#SiromoneyMDS94 2003-11-20 Comments on: G. Manacher, An Application of Pattern Matching to a Problem in Geometrical Complexity. 86 1978 7 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl7.html#Akl78 2003-11-20 Two Remarks on a Convex Hull Algorithm. 108-109 1979 8 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl8.html#Akl79 2003-11-20 Corrigendum on Convex Hull Algorithms. 168 1980 10 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl10.html#Akl80 2003-11-20 An Optimal Algorithm for Parallel Selection. 47-50 1984 19 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl19.html#Akl84 2003-11-20 Inclusion and Exclusion Algorithm for the Hamiltonian Path Problem. 203-207 1993 47 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl47.html#Bax93 2003-11-20 Algorithms to Count Paths and Cycles. 249-252 1994 52 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl52.html#Bax94 2003-11-20 A Note on the Higher Moments of the Expected Behavior of Straight Insertion Sort. 175-177 1986 22 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl22.html#Panny86 2003-11-20 Updating <=, <-chains. 261-268 2002 82 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl82.html#DelgrandeG02 http://dx.doi.org/10.1016/S0020-0190(01)00278-2 2003-11-20 Lower Bounds for Constant-Depth Circuits in the Presence of Help Bits. 79-83 1990 36 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl36.html#Cai90 2003-11-20 The Recognition of Union Trees. 279-283 1993 45 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl45.html#Cai93 2003-11-20 Fixed-Parameter Tractability of Graph Modification Problems for Hereditary Properties. 171-176 1996 58 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl58.html#Cai96 http://dx.doi.org/10.1016/0020-0190(96)00050-6 2003-11-20 A Classification of the Probabilistic Polynomial Time Hierarchy Under Fault Tolerant Access to Oracle Classes. 167-174 1999 69 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl69.html#Cai99 http://dx.doi.org/10.1016/S0020-0190(99)00011-3 2003-11-24 Transversal of disjoint convex polygons. 55-60 2003 85 Inf. Process. Lett. 1 http://dx.doi.org/10.1016/S0020-0190(02)00414-3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl85.html#ChinSW03 2003-11-20 PROCOL: A Protocol-Constrained Concurrent Object-Oriented Language. 221-227 1989 32 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl32.html#Bos89 2003-11-20 The Lazy Z-Buffer. 65-70 1995 55 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl55.html#Hill95 http://dx.doi.org/10.1016/0020-0190(95)00081-M 2003-11-20 An Optimal Message Routing Algorithm for Double-Loop Networks. 255-260 1998 65 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl65.html#Guan98 http://dx.doi.org/10.1016/S0020-0190(98)00013-1 2003-11-20 Database recovery using incomplete page versions in a multisystem data sharing environment. 49-55 2002 83 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl83.html#Cho02 http://dx.doi.org/10.1016/S0020-0190(01)00304-0 2003-11-20 Evaluating Clustering Factor Approach to Estimating Block Selectivities. 329-334 1991 40 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl40.html#Chu91 2004-11-23 <i>W</i>. 289-293 1998 67 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl67.html#Chu98 http://dx.doi.org/10.1016/S0020-0190(98)00122-7 2003-11-20 Verbs are not Cases: Applying Case Grammar to Document Retrieval. 29-34 1999 71 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl71.html#Chu99 http://dx.doi.org/10.1016/S0020-0190(99)00080-0 2003-11-20 A Note on the Transaction Backout Problem. 149-152 1987 24 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl24.html#Krentel87 2003-11-20 On an L-Stable Method for Stiff Differential Equations. 158-161 1977 6 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl6.html#Bui77 2003-11-20 A Note on an Improved Bisection Algorithm. 35-36 1980 10 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl10.html#Bui80 2003-11-20 EDISON-80, a Language for Modular Programming of Parallel Processes. 61-72 1986 22 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl22.html#Dai86 2003-11-20 R-Generability, and Definability in Branching Time Logics. 281-287 1992 41 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl41.html#Dam92 2003-11-20 Modal Logics in the Theory of Relational Databases. 1-7 1996 57 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl57.html#Das96 http://dx.doi.org/10.1016/0020-0190(95)00186-7 2003-11-20 On the Intersection of the Class of Linear Context-Free Languages and the Class of Single-Reset Languages. 143-146 1986 23 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl23.html#Wagner86 2003-11-20 Approximate Map Labeling is in Omega (n log n). 161-165 1994 52 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl52.html#Wagner94 2003-11-20 A Note on Parallel Queries and the Symmetric-Difference Hierarchy. 13-20 1998 66 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl66.html#Wagner98 http://dx.doi.org/10.1016/S0020-0190(98)00024-6 2003-11-20 On the Internal S-Stability of Rosenbrock Methods. 27-30 1980 11 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl11.html#Day80 2003-11-20 Conflict-Free Access of Arrays - A Counter Example. 20 1980 10 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl10.html#Deb80 2003-11-20 The Logical Meaning of Programs of a Subrecursive Language. 121-126 1976 4 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl4.html#Coy76 2003-11-20 Plane-Sweep Solves the Closest Pair Problem Elegantly. 255-261 1988 26 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl26.html#HinrichsNS88 2003-11-20 Another Glance at the Alpern-Schneider Characterization of Safety and Liveness in Concurrent Executions. 291-294 1993 47 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl47.html#Gumm93 2005-03-17 A Linear-Time Algorithm for Proper Interval Graph Recognition. 179-184 1995 56 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl56.html#FigueiredoMM95 http://dx.doi.org/10.1016/0020-0190(95)00133-W 2005-03-17 Total-Chromatic Number and Chromatic Index of Dually Chordal Graphs. 147-152 1999 70 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl70.html#FigueiredoMM99 http://dx.doi.org/10.1016/S0020-0190(99)00050-2 2003-11-20 Compile Time Type Checking of Structure Field Accessing. 22-25 1982 14 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl14.html#Gunn82 2003-11-20 An On-Line Algorithm to Optimize File Layout in a Dynamic Environment. 75-81 1996 57 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl57.html#GhandeharizadehIZ96 http://dx.doi.org/10.1016/0020-0190(95)00202-2 2003-11-20 Bounds on Sample Space Size for Matrix Product Verification. 87-91 1993 48 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl48.html#ChinnS93 2003-11-20 Scheduling Tree-Structured Tasks with Restricted Execution Times. 183-188 1988 28 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl28.html#DuL88 2003-11-20 Complexity of estimating multi-way join result sizes for area skewed spatial data. 121-129 2000 76 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl76.html#ParkC00 http://dx.doi.org/10.1016/S0020-0190(00)00129-0 2003-11-20 Static Analysis for Optimizing Reference Counting. 229-234 1995 55 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl55.html#ParkG95 http://dx.doi.org/10.1016/0020-0190(95)00096-U 2003-11-20 A Distributed Synchronization Scheme for Fair Multi-Process Handshakes. 131-138 1990 34 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl34.html#ParkK90 2003-11-20 Linear-Size Constant-Depth Polylog-Treshold Circuits. 143-146 1991 39 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl39.html#RagdeW91 2003-11-20 Hamilton-connectivity and cycle-embedding of the Möbius cubes. 113-117 2002 82 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl82.html#Fan02 http://dx.doi.org/10.1016/S0020-0190(01)00256-3 2003-11-20 The Space Complexity of Pebble Games on Trees. 184-188 1980 10 Inf. Process. Lett. 4/5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl10.html#LengauerT80 2003-11-20 Fair Derivations in E0L Systems. 183-188 1985 20 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl20.html#RangarajanA85 2003-11-20 Trackless online algorithms for the server problem. 73-79 2000 74 Inf. Process. Lett. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl74.html#BeinL00 http://dx.doi.org/10.1016/S0020-0190(00)00034-X 2003-11-20 Performance analysis of a multicasting protocol with contention-less minislots. 127-133 2001 79 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl79.html#JeongLO01 http://dx.doi.org/10.1016/S0020-0190(00)00181-2 2003-11-20 Should the Two-Headed Disk be Greedy? - Yes, it Should. 83-85 1983 16 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl16.html#Hofri83 2003-11-20 On Timeout for Global Deadlock Detection in Decentralized Database Systems. 295-302 1994 51 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl51.html#Hofri94 2003-11-20 Complexity of Scheduling Tasks with Time-Dependent Execution Times. 315-320 1993 48 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl48.html#HoLW93 2003-11-20 Some Properties of Fully Reducible Graphs. 113-117 1973 2 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl2.html#Kasyanov73 2003-11-20 Loop Cleaning. 1-6 1984 18 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl18.html#Kasyanov84 2003-11-20 Using OBDDs to Handle Dynamic Constraints. 111-120 1997 62 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl62.html#BouquetJ97 http://dx.doi.org/10.1016/S0020-0190(97)00058-6 2003-11-20 A Simple Function that Requires Exponential Size Read-Once Branching Programs. 13-16 1997 62 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl62.html#Gal97 http://dx.doi.org/10.1016/S0020-0190(97)00041-0 2003-11-20 A Linear Time Algorithm for Finding all Hinge Vertices of a Permutation Graph. 103-107 1996 59 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl59.html#HoWJ96 http://dx.doi.org/10.1016/0020-0190(96)00092-0 2003-11-20 Worst-Case Analysis of a Generalized Heapsort Algorithm. 159-165 1990 36 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl36.html#Paulik90 2003-11-20 There is no Fully Abstract Fixpoint Semantics for Non-Deterministic Languages with Infinite Computations. 289-293 1996 60 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl60.html#Nystrom96 http://dx.doi.org/10.1016/S0020-0190(96)00177-9 2005-09-13 A Common-Multiplicand Method to the Montgomery Algorithm for Speeding up Exponentiation. 105-107 1998 66 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl66.html#HaM98 http://dx.doi.org/10.1016/S0020-0190(98)00031-3 2003-11-20 Structured Programs for Turing Machines. 63-67 1980 10 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl10.html#Passy80 2003-11-20 Another Distributed Algorithm for Multiple Entries to a Critical Section. 51-57 1992 41 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl41.html#SrimaniR92 2003-11-20 Binding Propagation Beyond the Reach of Rule/Goal Graphs. 263-268 1992 42 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl42.html#Han92 2003-11-20 An Improvement on Parallel Computation of a Maximal Matching. 343-348 1995 56 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl56.html#Han95 http://dx.doi.org/10.1016/0020-0190(95)00166-2 2003-11-20 Hamilton Cycles in Trivalent Cayley Graphs. 177-181 1996 60 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl60.html#WaghM96 http://dx.doi.org/10.1016/S0020-0190(96)00158-5 2003-11-20 Convertibility in Databases. 168-171 1980 11 Inf. Process. Lett. 4/5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl11.html#Bekke80 2003-11-20 When Do Non-Conflict-Free Multivalued Dependency Dets Appear? 87-92 1984 18 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl18.html#Katsuno84 2003-11-20 Node-to-Node Cluster Fault Tolerant Routing in Star Graphs. 29-35 1995 56 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl56.html#GuP95 http://dx.doi.org/10.1016/0020-0190(95)00135-Y 2003-11-20 Node-To-Set Disjoint Paths Problem in Star Graphs. 201-207 1997 62 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl62.html#GuP97 http://dx.doi.org/10.1016/S0020-0190(97)00059-8 2003-11-20 <i>k</i>-Pairwise Disjoint Paths in Star Graphs. 283-287 1998 67 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl67.html#GuP98 http://dx.doi.org/10.1016/S0020-0190(98)00121-5 2003-11-20 Weighted Threshold Secret Sharing Schemes. 211-216 1999 70 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl70.html#MorilloPSV99 http://dx.doi.org/10.1016/S0020-0190(99)00070-8 2003-11-25 Sorting a sequence of strong kings in a tournament. 317-320 2003 87 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/S0020-0190(03)00346-6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl87.html#HoC03 2003-11-25 Solving the All-Pairs-Shortest-Lengt Problem on Chordal Bipartite Graphs. 87-93 1999 69 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl69.html#HoC99 http://dx.doi.org/10.1016/S0020-0190(98)00195-1 2003-11-20 Bounded Fan-Out m-Center Problem. 103-108 1997 63 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl63.html#HoK97 http://dx.doi.org/10.1016/S0020-0190(97)00104-X 2003-11-20 Efficient Parallel Algorithms for Finding Maximal Cliques, Clique Trees, and Minimum Coloring on Chordal Graphs. 301-309 1988 28 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl28.html#HoL88 2003-11-20 Counting Clique Trees and Computing Perfect Elimination Schemes in Parallel. 61-68 1989 31 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl31.html#HoL89 2003-11-20 Some FP Algebra with Currying Operation. 259-261 1983 17 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl17.html#Ida83 2003-11-20 Trinity Algebra and its Application to Machine Decompositions. 127-134 1987 26 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl26.html#Hou87 2003-11-20 Abstract Interpretation of Trace Semantics for Concurrent Calculi. 69-78 1999 70 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl70.html#BarbutiFSV99 http://dx.doi.org/10.1016/S0020-0190(99)00042-3 2003-11-20 An Algorithm for FIFO Message Delivery Among Migrating Tasks. 261-267 1995 53 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl53.html#BarbosaP95 http://dx.doi.org/10.1016/0020-0190(94)00199-9 2003-11-20 Generating all the Acyclic Orientations of an Undirected Graph. 71-74 1999 72 Inf. Process. Lett. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl72.html#BarbosaS99 http://dx.doi.org/10.1016/S0020-0190(99)00120-9 2003-11-20 A Probabilistic Lower Bound for Checking Disjointness of Sets. 51-53 1984 19 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl19.html#Manber84 2003-11-20 Recognizing Breadth-First Search Trees in Linear Time. 167-171 1990 34 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl34.html#Manber90 2003-11-20 An Improved Lower Bound for On-Line Bin Packing Algorithms. 277-284 1992 43 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl43.html#Vliet92 2003-11-20 On Efficient Implementation of LR-Attributed Grammars. 67-75 1992 41 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl41.html#Pavlu92 2003-11-24 An accurate and practical buffer allocation model for the buffer cache based on marginal gains. 93-97 2003 85 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/S0020-0190(02)00348-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl85.html#KimLNMCK03 2003-11-25 Perfect r-domination in the Kronecker product of two cycles, with an application to diagonal/toroidal mesh. 163-168 2003 87 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/S0020-0190(03)00268-0 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl87.html#Jha03 2003-11-20 Large Processors are Good in VLSI Chips. 47-49 1984 18 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl18.html#Jin84 2003-11-25 A linear time algorithm for the weighted lexicographic rectilinear 1-center problem in the plane. 121-128 2003 86 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/S0020-0190(02)00489-1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl86.html#Halman03 2003-11-20 The Space-Optimal Version of a Known Rectangle Enclosure Reporting Algorithm. 37-41 1997 61 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl61.html#BozanisKMT97 http://dx.doi.org/10.1016/S0020-0190(96)00186-X 2003-11-20 How to Detect Tampering of Data. 109-110 1985 20 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl20.html#Kak85 2003-11-20 Linear-Time Optimal Augmentation for Componentwise Bipartite-Completeness of Graphs. 59-63 1995 54 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl54.html#Kao95 http://dx.doi.org/10.1016/0020-0190(94)00229-R 2003-11-20 A Parallel Algorithm for Edge-Coloring of Graphs with Edge-Disjoint Cycles. 309-314 1992 43 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl43.html#Albacea92 2003-11-20 Parallel Algorithm for Finding a Core of a Tree Network. 223-226 1994 51 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl51.html#Albacea94 2003-11-20 A New Competitive Algorithm for the Counterfeit Coin Problem. 213-218 1994 51 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl51.html#HuCH94 2003-11-25 Linear-time algorithm for finding a maximum-density segment of a sequence. 339-342 2003 86 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/S0020-0190(03)00225-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl86.html#Kim03 2003-11-20 A Parallel Algorithm for Finding a Maximum Clique of a Set of Circular Arcs of a Circle. 235-241 1990 34 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl34.html#Kim90 2003-11-20 The Range Co-Minima Problem. 117-121 1994 49 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl49.html#Kim94 2003-11-20 An Note on Finding Compact Sets in Graphs Represented by an Adjacency List. 335-338 1996 57 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl57.html#Kim96 http://dx.doi.org/10.1016/0020-0190(96)00017-8 2003-11-20 Logarithmic Width, Linear Area Upward Drawing of AVL Trees. 303-307 1997 63 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl63.html#Kim97 http://dx.doi.org/10.1016/S0020-0190(97)00137-3 2003-11-24 A note on the minimum label spanning tree. 99-101 2002 84 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/S0020-0190(02)00230-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl84.html#WanCX02 2003-11-20 A Note on Codes Having no Finite Completions. 185-188 1995 55 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl55.html#Lam95 http://dx.doi.org/10.1016/0020-0190(95)00102-I 2003-11-20 A New Data Structure for the UNION-FIND Problem. 39-45 1979 9 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl9.html#Lao79 2003-11-20 Generating Permutations of a Bag by Interchanges. 263-269 1992 41 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl41.html#KoR92 2003-11-20 The NP-completeness of (1, r)-subcolorability of cubic graphs. 157-162 2002 81 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl81.html#LeL02 http://dx.doi.org/10.1016/S0020-0190(01)00205-8 2003-11-20 Mining association rules using inverted hashing and pruning. 211-220 2002 83 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl83.html#HoltC02 http://dx.doi.org/10.1016/S0020-0190(01)00330-1 2003-11-20 Digital and Hilbert k-d Trees. 35-41 1988 27 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl27.html#Lea88 2003-11-20 Reconstruction of Polygons from Projections. 235-240 1988 28 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl28.html#Li88a 2003-11-20 On Access and Alignment of Data in a Parallel Processor. 11-14 1989 33 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl33.html#Lee89 2003-11-20 Efficient Address Generation in a Parallel Processor. 111-116 1990 36 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl36.html#Lee90 2003-11-20 Semantic Data Modelling Using Linear Logic. 19-27 1996 60 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl60.html#Lee96 http://dx.doi.org/10.1016/S0020-0190(96)00126-3 2003-11-20 An Algorithm to Estimate the Fraction Defective and The Exponential Mean Life Using Unlabeled Samples. 129-133 1994 49 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl49.html#LiC94 2003-11-20 Computing Euclidean bottleneck matchings in higher dimensions. 169-174 2000 75 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl75.html#EfratK00 http://dx.doi.org/10.1016/S0020-0190(00)00096-X 2003-11-20 Efficient verification of a class of time Petri nets using linear programming. 219-224 2001 77 Inf. Process. Lett. 5-6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl77.html#LiL01 http://dx.doi.org/10.1016/S0020-0190(00)00156-3 2003-11-20 Evolutionary graph colouring. 91-94 2000 76 Inf. Process. Lett. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl76.html#DobrevSSV00 http://dx.doi.org/10.1016/S0020-0190(00)00125-3 2003-11-20 Separating and Shattering Long Line Segments. 309-314 1997 64 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl64.html#EfratS97 http://dx.doi.org/10.1016/S0020-0190(97)00188-9 2003-11-20 New bounds on the barycenter heuristic for bipartite graph drawing. 293-298 2002 82 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl82.html#LiS02 http://dx.doi.org/10.1016/S0020-0190(01)00297-6 2003-11-20 Average Case Complexity Under the Universal Distribution Equals Worst-Case Complexity. 145-149 1992 42 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl42.html#LiV92 2003-11-20 String-Matching Cannot be Done by a Two-Head One-Way Deterministic Finite Automation. 231-235 1986 22 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl22.html#LiY86 2003-11-20 Impossibility of scalar clock-based communication-induced checkpointing protocols ensuring the RDT property. 105-111 2001 80 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl80.html#BaldoniHMR01 http://dx.doi.org/10.1016/S0020-0190(01)00145-4 2003-11-20 Minimum Area Joining of k Compacted Cells. 265-269 1996 58 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl58.html#Lim96 http://dx.doi.org/10.1016/0020-0190(96)00057-9 2003-11-20 Parallel Algorithm for Generating Permutations on Linear Array. 167-170 1990 35 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl35.html#Lin90 2003-11-20 Fast Algorithms for Lowest Common Ancestors on a Processor Array with Reconfigurable Buses. 223-230 1991 40 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl40.html#Lin91 2003-11-20 Parallel Trace-Driven Simulation of Packet-Switched Multiplexer Under Priority Scheduling Policy. 197-201 1993 47 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl47.html#Lin93 2003-11-20 Determining the Global Progress of Parallel Simulation with FIFO Communication Property. 13-17 1994 50 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl50.html#Lin94 2003-11-20 Perfectly Overlapped Merging and Sorting on a Two-Way Linear Array. 183-187 1996 60 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl60.html#Lin96 http://dx.doi.org/10.1016/S0020-0190(96)00157-3 2003-11-20 An Improved Lower Bound for Load Balancing of Tasks with Unknown Duration. 301-303 1997 62 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl62.html#MaP97 http://dx.doi.org/10.1016/S0020-0190(97)00085-9 2003-11-20 Some Observations on the Determination of an Upper Bound for the Clique Number of a Graph. 16-17 1975 4 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl4.html#Nieminen75a 2003-11-20 A Note on Graham's Bound. 1-5 1990 36 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl36.html#Liu90 2003-11-20 Optimal Node Ranking of Trees. 225-229 1988 28 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl28.html#IyerRV88 2003-11-20 A Simple, Efficient Algorithm for Maximum Finding on Rings. 319-324 1996 58 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl58.html#HighamP96 http://dx.doi.org/10.1016/0020-0190(96)00069-5 2003-11-20 When Chasing Your Tail Saves Time. 321-324 1986 23 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl23.html#Kieburtz86 2005-04-25 Resolving Data Conflicts with Multiple Versions and Precedence Relationships in Real-Time Databases. 149-156 1997 61 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl61.html#HongK97 http://dx.doi.org/10.1016/S0020-0190(96)00205-0 2003-11-20 Probabilistic Analysis of k-Dimensional Packing Algorithms. 17-24 1995 55 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl55.html#HongL95 http://dx.doi.org/10.1016/0020-0190(95)00044-D 2003-11-20 On Legal Path Problems in Digraphs. 93-98 1984 18 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl18.html#IhmN84 2003-11-25 On limits on the computational power of data-accumulating algorithms. 221-227 2003 86 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/S0020-0190(02)00499-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl86.html#BrudaA03 2003-11-20 An efficient retrieval selection algorithm for video servers with random duplicated assignment storage technique. 315-321 2002 83 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl83.html#Low02 http://dx.doi.org/10.1016/S0020-0190(02)00210-7 2003-11-20 Garbage Collection can be Faster than Stack Allocation. 275-279 1987 25 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl25.html#Appel87 2003-11-20 A Fast Search Algorithm for the Quorumcast Routing Problem. 87-92 1998 66 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl66.html#Low98 http://dx.doi.org/10.1016/S0020-0190(98)00033-7 2003-11-20 An Optimal Algorithm for the Period of a Strongly Connected Digraph. 313-316 1992 44 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl44.html#Pascoletti92 2003-11-20 The Completeness of GP-Resolution for Annotated Logics. 135-140 1992 44 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl44.html#LuH92 2003-11-24 A note on unscrambling address lines. 185-189 2003 85 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/S0020-0190(02)00392-7 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl85.html#LuT03 2005-01-17 A Linear-Time Algorithm for the Weighted Feedback Vertex Problem on Interval Graphs. 107-111 1997 61 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl61.html#LuT97 http://dx.doi.org/10.1016/S0020-0190(96)00193-7 2003-11-20 Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard. 273-280 2001 79 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl79.html#WanYL01 http://dx.doi.org/10.1016/S0020-0190(01)00143-0 2003-11-20 Rearrangeable Graphs. 23-27 1999 71 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl71.html#HuZS99 http://dx.doi.org/10.1016/S0020-0190(99)00081-2 2003-11-20 `Possible' Membership of a Multivalued Dependency in a Relational Database. 80-83 1979 9 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl9.html#Luk79 2003-11-20 Two Normal Form Theorems for CSP Programs. 165-171 1987 26 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl26.html#AptBC87 2003-11-20 A priority dynamics for generalized drinking philosophers. 189-195 2001 79 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl79.html#BarbosaBF01 http://dx.doi.org/10.1016/S0020-0190(00)00218-0 2003-11-20 Real-Time Queue Operation in Pure LISP. 50-54 1981 13 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl13.html#HoodM81 2003-11-20 Simpler Proof of a Realizability Theorem on Delaunay Triangulations. 173-176 1994 50 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl50.html#Sugihara94 2003-11-20 Drawing Polygons Given Angle Sequences. 31-33 1989 31 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl31.html#Hartley89 2003-11-20 Binary Merging by Partitioning. 72-75 1979 8 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl8.html#Nat79 2003-11-20 A Fast Sorting Algorithm, a Hybrid of Distributive and Merge Sorting. 163-167 1980 10 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl10.html#Nat80 2003-11-20 A Self-Stabilizing Algorithm for Maximal Matching. 77-81 1992 43 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl43.html#HsuH92 2003-11-20 Shifting Timestamps for Concurrency Control in an Information Hierarchy. 291-297 1988 27 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl27.html#HsuM88 2003-11-20 Optimal Block Size for Set-Valued Attributes. 153-158 1993 45 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl45.html#HsuS93 2003-11-20 Linear Time Algorithms on Circular-Arc Graphs. 123-129 1991 40 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl40.html#HsuT91 2003-11-20 The Towers of Hanoi Revisited: Moving the Rings by Counting the Moves. 64-67 1982 15 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl15.html#Walsh82 2003-11-20 Iteration Strikes Back - at the Cyclic Towers of Hanoi. 91-93 1983 16 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl16.html#Walsh83 2003-11-20 How Evenly Should One Divide to Conquer Quickly? 203-208 1984 19 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl19.html#Walsh84 2003-11-20 On Keys and Normal Forms. 255-258 1997 62 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl62.html#Mok97 http://dx.doi.org/10.1016/S0020-0190(97)00076-8 2003-11-20 A Linear Storage Space Algorithm for a Reference Structure Index. 66-71 1978 7 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl7.html#KambayashiHTY78 2003-11-20 Rectilinear Decompositions with Low Stabbing Number. 215-221 1994 52 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl52.html#BergK94 2003-11-20 On the fatness of Minkowski sums. 259-264 2002 81 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl81.html#BergS02 http://dx.doi.org/10.1016/S0020-0190(01)00233-2 2003-11-20 A Note on Two-Way Probabilistic Automata. 321-326 1992 43 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl43.html#Wang92a 2003-11-20 Linear Complexity Profiles and Jump Complexity. 165-168 1997 61 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl61.html#Wang97a http://dx.doi.org/10.1016/S0020-0190(97)00004-5 2003-11-20 Distributed Routing in a Fault-Tolerant Multistage Interconnection Network. 205-210 1997 63 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl63.html#Wang97b http://dx.doi.org/10.1016/S0020-0190(97)00105-1 2003-11-20 A Separation of Two Randomness Concepts. 115-118 1999 69 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl69.html#Wang99a http://dx.doi.org/10.1016/S0020-0190(98)00202-6 2003-11-20 Honest Iteration Schemes of Randomizing Algorithms. 275-278 1993 45 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl45.html#WangB93 2003-11-20 Two-Dimensional Processor Array with a Reconfigurable Bus System is at Least as Powerful as CRCW Model. 31-36 1990 36 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl36.html#WangC90 2003-11-20 List Scheduling of Parallel Tasks. 291-297 1991 37 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl37.html#WangC91 2003-11-20 A Frame for General Divide-and-Conquer Recurrences. 45-51 1996 59 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl59.html#WangF96 http://dx.doi.org/10.1016/0020-0190(96)00076-2 2003-11-20 Recursiveness of Monotonic Array Grammars and a Hierarchy of Array Languages. 24-26 1976 5 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl5.html#WangG76 2003-11-20 A Study on Two Geometric Location Problems. 281-286 1988 28 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl28.html#WangK88 2003-11-20 An approximation algorithm for a bottleneck k-Steiner tree problem in the Euclidean plane. 151-156 2002 81 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl81.html#WangL02 http://dx.doi.org/10.1016/S0020-0190(01)00209-5 2003-11-20 On Constructing Multiple Spanning Trees in a Hypercube. 177-183 1993 45 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl45.html#WangL93 2003-11-20 An Algorithm to Generate the Basis of Solutions to Homogeneous Linear Diophantine Equations. 144-147 1978 7 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl7.html#Huet78 2003-11-20 An O(log n) Time Parallel Algorithm for Triangulating a Set of Points in the Plane. 55-60 1987 25 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl25.html#WangT87 2003-11-20 Analyzing Self-Adjusting Linear List Algorithms with Deletions and Unsuccessful Searches. 231-236 1996 58 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl58.html#HuiM96 http://dx.doi.org/10.1016/0020-0190(96)00064-6 2003-11-20 Preservation of Integrity Constraints in Definite DATALOG Programs. 185-193 1992 44 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl44.html#WangY92 2003-11-20 Drawing the Planar Dual. 7-13 1992 43 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl43.html#BernG92 2003-11-20 The Steiner Problem with Edge Lengths 1 and 2. 171-176 1989 32 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl32.html#BernP89 2003-11-20 A Note on Removing Loops from Table-Driven Code Generators. 31-34 1985 21 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl21.html#OhP85 2003-11-20 A New Combination of Input and Unit Deductions for Horn Sentences. 209-213 1984 18 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl18.html#YamasakiYDH84 2003-11-20 A Parallel View of Stable Marriages. 63-66 1984 18 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl18.html#Hull84 2003-11-20 Self and Selftype. 225-230 1990 36 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl36.html#HurC90 2003-11-20 On the Number of Linear Partitions of the (m, n)-Grid. 163-168 1991 38 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl38.html#AcketaZ91 2003-11-20 Hardware Address Translation for Machines with a Large Virtual Memory. 23-29 1981 13 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl13.html#RamamohanaraoS81 2003-11-20 A Parallel Tree Difference Algorithm. 231-235 1996 60 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl60.html#Skillicorn96 http://dx.doi.org/10.1016/S0020-0190(96)00171-8 2003-11-20 The Lower Bounds on the Additive Complexity of Bilinear Problems in Terms of Some Algebraic Quantities. 71-72 1981 13 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl13.html#Pan81 2003-11-20 The Trade-Off Between the Additive Complexity and the Asynchronicity of Linear and Bilinear Algorithms. 11-14 1986 22 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl22.html#Pan86 2003-11-20 Computing the Determinant and the Characteristic Polynomial of a Matrix via Solving Linear Systems of Equations. 71-75 1988 28 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl28.html#Pan88 2003-11-20 An Optimum Theta (n log n) Algorithm for Finding a Canonical Hamiltonian Path and a Canonical Hamiltonian Circuit in a Set of Intervals. 205-211 1990 35 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl35.html#ManacherMS90 2003-11-20 Finit Automata-Models for the Investigation of Dynamical Systems. 137-141 1997 63 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl63.html#SchittenkopfDB97 http://dx.doi.org/10.1016/S0020-0190(97)00110-5 2003-11-20 Covering a set of points by two axis-parallel boxes. 95-100 2000 75 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl75.html#BespamyatnikhS00 http://dx.doi.org/10.1016/S0020-0190(00)00093-4 2003-11-20 A Negative Answer to a Question of Wilke on Varieties of \omega-Languages. 197-200 1995 56 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl56.html#Pin95 http://dx.doi.org/10.1016/0020-0190(95)95252-U 2003-11-20 Generalized interpolation in CASL. 19-24 2000 76 Inf. Process. Lett. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl76.html#Borzyszkowski00 http://dx.doi.org/10.1016/S0020-0190(00)00120-4 2003-11-20 On a Question About Learning Nearly Minimal Programs. 1-4 1995 53 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl53.html#Jain95 http://dx.doi.org/10.1016/0020-0190(94)00172-U 2003-11-20 On a Question of Nearly Minimal Identification of Functions. 113-117 1999 70 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl70.html#Jain99 http://dx.doi.org/10.1016/S0020-0190(99)00051-4 2003-11-20 Finding Connected Components of an Intersection Graph of Squares in the Euclidean Plane. 125-128 1982 15 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl15.html#Imai82 2003-11-20 On the Security of Image Encryption Method. 261-265 1996 60 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl60.html#JanT96 http://dx.doi.org/10.1016/S0020-0190(96)00168-8 2003-11-20 A Parallel Parsing Algorithm for Arbitrary Context-Free Grammars. 87-96 1996 58 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl58.html#RaK96 http://dx.doi.org/10.1016/0020-0190(96)00023-3 2003-11-20 A New one Pass Algorithm for Estimating Stochastic Context-Free Grammars. 37-45 1999 72 Inf. Process. Lett. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl72.html#RaS99 http://dx.doi.org/10.1016/S0020-0190(99)00119-2 2003-11-20 An Algorithm for String Matching with a Sequence of don't Cares. 133-136 1991 37 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl37.html#ManberB91 2003-11-20 An Algorithm for Approximate Membership checking with Application to Password Security. 191-197 1994 50 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl50.html#ManberW94 2003-11-20 Password Authentication Without Using a Password Table. 247-250 1995 55 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl55.html#Horng95 http://dx.doi.org/10.1016/0020-0190(95)00087-S 2003-11-20 An Active Attack on Protocols for Server-Aided RSA Signature Computation. 71-73 1998 65 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl65.html#Horng98 http://dx.doi.org/10.1016/S0020-0190(97)00198-1 2003-11-20 On the role of formal methods in security. 209-212 2001 77 Inf. Process. Lett. 2-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl77.html#Rao01 http://dx.doi.org/10.1016/S0020-0190(00)00216-7 2003-11-20 Time-space trade-offs for compressed suffix arrays. 307-311 2002 82 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl82.html#Rao02 http://dx.doi.org/10.1016/S0020-0190(01)00298-8 2003-11-20 A Note on P-Selective Sets and Closeness. 179-185 1995 54 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl54.html#Rao95 http://dx.doi.org/10.1016/0020-0190(95)00038-E 2003-11-20 Serializability by Commitment Ordering. 257-264 1994 51 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl51.html#Raz94 2003-11-20 Small generic hardcore subsets for the discrete logarithm: Short secret DL-keys. 93-98 2001 79 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl79.html#Schnorr01 http://dx.doi.org/10.1016/S0020-0190(00)00173-3 2003-11-20 How Many Polynomials can be Approximated Faster Than They can be Evaluated? 76-78 1981 12 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl12.html#Schnorr81 2003-11-20 A Note on the Formula Size of the "mod k" Functions. 223-224 1987 24 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl24.html#Leijenhorst87 2003-11-20 NP-Completeness of k-Connected Hyperedge-Replacement Languages of Order k. 89-94 1993 45 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl45.html#Drewes93 2003-11-20 On the Programming of Elastic Stores. 184-187 1975 3 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl3.html#Rem75 2003-11-20 A High-Low Kolmogorov Complexity Law Equivalent to the 0-1 Law. 59-64 1996 57 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl57.html#Zimand96 http://dx.doi.org/10.1016/0020-0190(95)00201-4 2003-11-20 ⁰have Many Strings with Low Kolmogorov Complexity. 165-170 1997 62 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl62.html#Zimand97 http://dx.doi.org/10.1016/S0020-0190(97)00054-9 2003-11-20 Relative to a Random Oracle, P/Poly is not Measurable in EXP. 83-86 1999 69 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl69.html#Zimand99 http://dx.doi.org/10.1016/S0020-0190(98)00197-5 2005-03-04 A Simple LP-Free Approximation Algorithm for the Minimum Weight Vertex Cover Problem. 129-131 1995 54 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl54.html#Gonzales95 http://dx.doi.org/10.1016/0020-0190(95)00022-5 2003-11-20 Covering a Set of Points in Multidimensional Space. 181-188 1991 40 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl40.html#Gonzalez91 2003-11-20 Improved Approximation Algorithms for Embedding Hyperedges in a Cycle. 267-271 1998 67 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl67.html#Gonzalez98 http://dx.doi.org/10.1016/S0020-0190(98)00117-3 2003-11-20 A Layout for the Shuffle-Exchange Network with Theta(N²/log N) Area. 83-88 1981 12 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl12.html#SteinbergR81 2003-11-20 Experiments With a Fast String Searching Algorithm. 129-135 1984 18 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl18.html#Moller-NielsenS84 2003-11-20 Corrigendum: Identifying Periodic Occurences of a Template with Applications to Protein Structure. 157 1993 46 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl46.html#FischettiLSS93a 2003-11-20 Circuit Depth Relative to a Random Oracle. 295-298 1992 42 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl42.html#Miltersen92 2003-11-25 The number of tests required to search an unordered table. 85-88 2003 87 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/S0020-0190(03)00260-6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl87.html#Fredman03 2003-11-20 Finding an Approximate Median with High Probability in Constant Parallel Time. 77-80 1990 34 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl34.html#Sen90 2003-11-20 Some Observations on Skip-Lists. 173-176 1991 39 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl39.html#Sen91 2003-11-20 A Fast and Simple Algorithm for the Bottleneck Biconnected Spanning Subgraph Problem. 283-286 1994 50 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl50.html#PunnenN94 2003-11-20 Lower bounds of quantum black-box complexity and degree of approximating polynomials by influence of Boolean variables. 79-83 2000 75 Inf. Process. Lett. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl75.html#Shi00 http://dx.doi.org/10.1016/S0020-0190(00)00069-7 2003-11-20 Entropy lower bounds for quantum decision tree complexity. 23-27 2002 81 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl81.html#Shi02 http://dx.doi.org/10.1016/S0020-0190(01)00191-0 2003-11-20 Generating t-ary Trees in A-Order. 205-213 1988 27 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl27.html#BaronaigienR88 2003-11-20 On optimal bridges between two convex regions. 163-168 2000 76 Inf. Process. Lett. 4-6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl76.html#Tan00 http://dx.doi.org/10.1016/S0020-0190(00)00143-5 2003-11-20 Shortest zookeeper's routes in simple polygons. 23-26 2001 77 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl77.html#Tan01 http://dx.doi.org/10.1016/S0020-0190(00)00144-7 2003-11-20 Maximal Matching Stabilizes in Quadratic Time. 271-272 1994 49 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl49.html#Tel94 2003-11-25 Distributed algorithms for finding and maintaining a k-tree core in a dynamic network. 187-194 2003 88 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/S0020-0190(03)00365-X http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl88.html#SrivastavaG03 2003-11-25 Edge-pancyclicity of recursive circulants. 287-292 2003 88 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/j.ipl.2003.09.003 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl88.html#Araki03 2003-11-20 Term Rewriting and Hoare Logic- Coded Rewriting. 237-242 1996 60 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl60.html#Sun96 http://dx.doi.org/10.1016/S0020-0190(96)00169-X 2003-11-20 Probable Correctness Theory. 17-25 1987 25 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl25.html#Hamlet87 2003-11-20 A Polynomial Characterization of Some Graph Partitioning Problems. 223-230 1988 26 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl26.html#Arbib88 2003-11-20 On the Detection of Unstructuredness in Flowgraphs. 189-193 1987 25 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl25.html#Tse87 2003-11-20 Training Digraphs. 185-192 1995 53 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl53.html#TuS95 http://dx.doi.org/10.1016/0020-0190(94)00191-Z 2003-11-20 Acyclic orientations do not lead to optimal deadlock-free packet routing algorithms. 221-225 2000 73 Inf. Process. Lett. 5-6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl73.html#Stefankovic00 http://dx.doi.org/10.1016/S0020-0190(00)00022-3 2003-11-20 Abstracting numeric constraints with Boolean functions. 17-23 2000 75 Inf. Process. Lett. 1-2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl75.html#HoweK00 http://dx.doi.org/10.1016/S0020-0190(00)00081-8 2003-11-20 Constraint Satisfaction - Algorithms and Complexity Analysis. 171-178 1995 55 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl55.html#Hower95 http://dx.doi.org/10.1016/0020-0190(95)00089-U 2003-11-20 Revisiting Global Constraint Satisfaction. 41-48 1998 66 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl66.html#Hower98 http://dx.doi.org/10.1016/S0020-0190(98)00023-4 2003-11-20 On priority assignment in fixed priority scheduling. 39-44 2001 79 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl79.html#Audsley01 http://dx.doi.org/10.1016/S0020-0190(00)00165-4 2003-11-20 A Clarification of the Comparison Between Some Measures of Software Science. 241-243 1979 8 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl8.html#KnijffL79 2003-11-20 Two-Way Deterministic Finite Automata are Exponentially More Succinct Than Sweeping Automata. 103-105 1981 12 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl12.html#Micali81 2003-11-20 A Scheme to Construct Distance Three Codes Using Latin Squares, with Applications to the n-Cube. 123-127 1995 55 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl55.html#JhaS95 http://dx.doi.org/10.1016/0020-0190(95)00066-L 2003-11-20 Parallel Multiple Search. 181-186 1991 37 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl37.html#Wen91 2003-11-20 New Algorithms for the LCA Problem and the Binary Tree Reconstruction Problem. 11-16 1994 51 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl51.html#Wen94 2003-11-20 Linear Programming is Log-Space Hard for P. 96-97 1979 8 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl8.html#DobkinLR79 2003-11-20 A Control Mechanism of a Lisp-Based Data-Driven Machine. 139-143 1983 16 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl16.html#YubaYS83 2003-11-20 Cryptanalysis of a Public Key System Based on Diophantine Equations. 73-75 1995 56 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl56.html#Cusick95 http://dx.doi.org/10.1016/0020-0190(95)00124-U 2003-11-20 Bounds on the Number of Functions Satisfying the Strict Avalanche Criterion. 261-263 1996 57 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl57.html#Cusick96 http://dx.doi.org/10.1016/0020-0190(95)00211-1 2003-11-20 A clustering algorithm based on graph connectivity. 175-181 2000 76 Inf. Process. Lett. 4-6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl76.html#HartuvS00 http://dx.doi.org/10.1016/S0020-0190(00)00142-3 2003-11-20 Simplified proof of the Fourier Sampling Theorem. 139-143 2000 75 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl75.html#Hoyer00 http://dx.doi.org/10.1016/S0020-0190(00)00099-5 2003-11-20 Relative Complexity of Checking and Evaluating. 20-23 1976 5 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl5.html#Valiant76 2003-11-20 Computing Multivariate Polynomials in Parallel. 44-45 1980 11 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl11.html#Valiant80 2003-11-20 Addendum: Computing Multivariate Polynomials in Parallel. 54 1981 12 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl12.html#Valiant81 2003-11-20 A Randomized Algorithm for Checking Equivalence of Circular Lists. 118-121 1979 9 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl9.html#Itai79 2003-11-20 The Towers of Hanoi Problem with Parallel Moves. 241-243 1992 44 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl44.html#WuC92 2003-11-20 The Towers of Hanoi Problem with Cyclic Parallel Moves. 1-6 1993 46 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl46.html#WuC93 2003-11-25 Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine. 89-93 2003 87 Inf. Process. Lett. 2 http://dx.doi.org/10.1016/S0020-0190(03)00262-X http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl87.html#WuL03 2003-11-20 Solvability of the Asynchronous Ranking Problem. 221-224 1988 28 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl28.html#Mazurkiewicz88 2003-11-20 Distributed Disassembly of Mosaics. 173-178 1993 46 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl46.html#Mazurkiewicz93 2003-11-20 Distributed Enumeration. 233-239 1997 61 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl61.html#Mazurkiewicz97 http://dx.doi.org/10.1016/S0020-0190(97)00022-7 2003-11-20 An efficient sorting algorithm for a sequence of kings in a tournament. 297-299 2001 79 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl79.html#WuS01 http://dx.doi.org/10.1016/S0020-0190(01)00142-9 2003-11-20 Solving the Satisfiability Problem by Using Randomized Approach. 187-190 1992 41 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl41.html#WuT92 2003-11-20 An O(n) Algorithm for Finding an Optimal Position with Relative Distances in an Evolutionary Tree. 263-269 1997 63 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl63.html#WuT97 http://dx.doi.org/10.1016/S0020-0190(97)00109-9 2003-11-25 An optimal algorithm to implement the Hanoi towers with parallel moves. 289-293 2003 86 Inf. Process. Lett. 6 http://dx.doi.org/10.1016/S0020-0190(03)00226-6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl86.html#WuW03 2003-11-20 The Towers of Antwerpen Problem. 107-111 1991 38 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl38.html#Minsker91 2006-09-08 The Aars of a Polygon. 196-198 1982 15 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl15.html#Highnam82 2006-09-08 Optimal Algorithms for Finding the Symmetries of a Planar Point Set. 219-222 1986 22 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl22.html#Highnam86 2003-11-20 Optimal Use of Storage in a Simple Model of Garbage Collection. 37-38 1974 3 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl3.html#Campbell74 2003-11-20 An O(|E| log log |V|) Algorithm for Finding Minimum Spanning Trees. 21-23 1975 4 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl4.html#Yao75 2003-11-20 A Note on a Conjecture of Kam and Ullman Concerning Statistical Databases. 48-50 1979 9 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl9.html#Yao79 2003-11-20 A Note on the Analysis of Extendible Hashing. 84-86 1980 11 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl11.html#Yao80 2003-11-20 On the CLUMPS Model of Parallel Computation. 231-236 1998 66 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl66.html#Campbell98 http://dx.doi.org/10.1016/S0020-0190(98)00059-3 2003-11-20 Finding Approximate Solutions to NP-Hard Problems by Neural Networks is Hard. 93-98 1992 41 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl41.html#Yao92 2003-11-20 A Note on Neural Sorting Networks with O(1) Time Complexity. 253-254 1995 56 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl56.html#Yao95 http://dx.doi.org/10.1016/0020-0190(95)00159-1 2003-11-20 A Hybrid Algorithm for the Shortest Path Between Two Nodes in the Presence of Few Negative Arcs. 181-182 1983 16 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl16.html#Yap83 2003-11-24 Characterization of simple edge-firing games. 235-236 2002 84 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/S0020-0190(02)00311-3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl84.html#Pretzel02 2003-11-24 On-line scheduling with extendable working time on a small number of machines. 171-177 2003 85 Inf. Process. Lett. 4 http://dx.doi.org/10.1016/S0020-0190(02)00404-0 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl85.html#YeZ03 2003-11-20 A Polynomial Time Algorithm to Decide Pairwise Concurrency of Transitions for 1-Bounded Conflict-Free Petri Nets. 71-76 1991 38 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl38.html#Yen91 2003-11-20 A Note on Fine Covers and Iterable Factors of VAS Languages. 237-243 1995 56 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl56.html#Yen95 http://dx.doi.org/10.1016/0020-0190(95)00168-2 2003-11-20 A Highly Safe Self-Stabilizing Mutual Exclusion Algorithm. 301-305 1996 57 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl57.html#Yen96 http://dx.doi.org/10.1016/0020-0190(96)00026-9 2006-05-11 Optimal Parameters for Load Balancing Using the Diffusion Method in k-Ary n-Cube Networks. 181-187 1993 47 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl47.html#XuL93 2003-11-20 Linear Time Algorithms for Graph Search and Connectivity Determination on Complement Graphs. 209-213 1998 66 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl66.html#ItoY98 http://dx.doi.org/10.1016/S0020-0190(98)00071-4 2003-11-20 Finding Large Holes. 227-229 1991 39 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl39.html#Spinrad91 2003-11-20 Doubly Lexical Ordering of Dense 0 - 1 Matrices. 229-235 1993 45 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl45.html#Spinrad93 2003-11-20 Efficient Selection on a Binary Tree. 123-126 1986 23 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl23.html#CooperA86 2003-11-20 Casop: A Fast Algorithm for Computing the n-Ary Composition of a Binary Associative Operator. 209-213 1990 34 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl34.html#CooperK90 2003-11-20 Characterization for a Family of Infinitely Many Irreducible Equally Spaced Polynomials. 273-277 1991 37 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl37.html#Itoh91 2003-11-20 On a Class of Square-Free Graphs. 47-48 1996 57 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl57.html#Xue96 http://dx.doi.org/10.1016/0020-0190(95)00175-1 2003-11-20 Auxiliary Variables in Data Refinement. 293-296 1988 29 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl29.html#Morgan88a 2003-11-20 Unifying wp and wlp. 159-163 1996 59 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl59.html#MorganM96 http://dx.doi.org/10.1016/0020-0190(96)00093-2 2003-11-20 An Approach to the Transportation of Computer Software. 153-157 1985 21 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl21.html#Yoo85 2003-11-20 Unboundedness Detection for a Class of Communicating Finite-State Machines. 235-240 1983 17 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl17.html#YuG83 2003-11-20 On the Complexity of Finding the Set of Candidate Keys for a Given Set of Functional Dependencies. 100-101 1976 5 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl5.html#YuJ76 2003-11-20 An Optimal Parallel Algorithm for the Domatic Partition Problem on an Interval Graph Given its Sorted Model. 15-22 1992 44 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl44.html#YuY92 2003-11-20 An O(n) Time Algorithm for Maximum Matching on Cographs. 89-93 1993 47 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl47.html#YuY93 2003-11-20 Computing the Shortest Diagonal of a Monotone Polygon in Linear Time. 303-307 1992 42 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl42.html#Zhu92 2003-11-20 On Different Approximation Criteria for Subset Product Problems. 213-218 1985 21 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl21.html#Marchetti-SpaccamelaR85 2003-11-20 An Almost Perfect Heuristic for the N Nonattacking Queens Problem. 173-178 1990 34 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl34.html#Kale90 2003-11-25 _p-hamiltonian and 1-edge hamiltonian graphs. 263-269 2003 86 Inf. Process. Lett. 5 http://dx.doi.org/10.1016/S0020-0190(02)00509-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl86.html#KaoH03 2003-11-20 Evolutionary local search for the edge-biconnectivity augmentation problem. 39-45 2002 82 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl82.html#RaidlL02 http://dx.doi.org/10.1016/S0020-0190(01)00285-X 2003-11-20 Online Matching with Blocked Input. 113-116 1991 38 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl38.html#KaoT91 2003-11-20 Not all Planar Digraphs have Small Cycle Separators. 79-83 1992 44 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl44.html#KaoW92 2003-11-20 An O(n log n) Lower Bound for Decomposing a Set of Points into Chains. 319-322 1989 31 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl31.html#BloniarzR89 2003-11-20 Sub-Regular Grammar Forms. 184-187 1981 12 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl12.html#OttmannSW81 2003-11-20 Maximum Bounded 3-Dimensional Matching in MAX SNP-Complete. 27-35 1991 37 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl37.html#Kann91 2003-11-20 Maximum Bounded H-Matching is MAX SNP-Complete. 309-318 1994 49 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl49.html#Kann94 2003-11-20 Analysis of the Hilbert Curve for Representing Two-Dimensional Space. 17-22 1997 62 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl62.html#Jagadish97 http://dx.doi.org/10.1016/S0020-0190(97)00014-8 2003-11-20 Unique Horn Renaming an Unique 2-Satisfiability. 235-239 1995 54 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl54.html#Hebrard95 http://dx.doi.org/10.1016/0020-0190(95)00023-6 2003-11-20 A Gray Code for Set Partitions. 171-173 1976 5 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl5.html#Kaye76 2003-11-20 Soft Precedence. 108-110 1972 1 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl1.html#Zimmer72 2003-11-24 On the Difficulty of Manhattan Channel Routing. 281-284 1992 44 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl44.html#GreenbergJK92 2003-11-20 A Limit Theorem for Sets of Subwords in Deterministic T0L Languages. 70-73 1973 2 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl2.html#EhrenfeuchtR73 2003-11-20 An Observation on Scattered Grammars. 84-85 1979 9 Inf. Process. Lett. 2 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl9.html#EhrenfeuchtR79 2003-11-20 On the Emptiness of the Intersection of Two D0S Languages Problem. 223-225 1980 10 Inf. Process. Lett. 4/5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl10.html#EhrenfeuchtR80 2003-11-20 On the Subword Complexity of D0L Languages with a Constant Distribution. 108-113 1981 13 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl13.html#EhrenfeuchtR81 2003-11-20 On the Subword Complexity of Locally Catenative D0L Languages. 7-9 1983 16 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl16.html#EhrenfeuchtR83 2003-11-20 A Fault-Tolerant Hexagonal Systolic Array. 187-196 1992 42 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl42.html#AykanatO92 2003-11-20 Super-Exponentials Nonprimitive Recursive, but Rudimentary. 311-316 1987 25 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl25.html#Calude87 2003-11-20 Parallel Algorithms for Connectivity Problems on Interval Graphs. 37-44 1995 56 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl56.html#SaxenaR95 http://dx.doi.org/10.1016/0020-0190(95)00128-Y 2003-11-20 Design of Queuing Buffer Register Size. 147-152 1975 3 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl3.html#AsaiL75 2003-11-20 An Optimization of the Alternating Semantic Evaluator. 97-100 1977 6 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl6.html#RaihaS77 2003-11-20 A Systematic Analysis of Splaying. 41-50 1993 45 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl45.html#Schoenmakers93 2003-11-20 A Tight Lower Bound for Top-Down Skew Heaps. 279-284 1997 61 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl61.html#Schoenmakers97 http://dx.doi.org/10.1016/S0020-0190(97)00028-8 2003-11-20 The Complexity of Recognizing 3NF Relation Schemes. 187-190 1982 14 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl14.html#JouF82 2003-11-20 Fast Hough Transform on a Mesh Connected Processor Array. 243-248 1990 33 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl33.html#KannanC90 2003-11-20 An Interesting Way to Partition a Number. 141-148 1999 71 Inf. Process. Lett. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl71.html#Bhatt99 http://dx.doi.org/10.1016/S0020-0190(99)00090-3 2003-11-20 Finding Hamiltonian Circuits in Interval Graphs. 201-206 1985 20 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl20.html#Keil85 2003-11-20 Total Domination in Interval Graphs. 171-174 1986 22 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl22.html#Keil86 2003-11-20 A Simple Algorithm for Determining the Envelope of a Set of Lines. 121-124 1991 39 Inf. Process. Lett. 3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl39.html#Keil91 2003-11-24 A semantics of sequence diagrams. 125-130 2002 84 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/S0020-0190(02)00270-3 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl84.html#ChoKCB02 2003-11-20 Should the Stable Rounding Rule be Radix-Dependent? 188-189 1975 3 Inf. Process. Lett. 6 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl3.html#Keir75 2003-11-20 Models for the Substitution Axiom of UNITY Logic. 171-176 1993 48 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl48.html#ReichweinF93 2003-11-25 Cryptanalysis of a pay-as-you-watch system. 119-120 2003 88 Inf. Process. Lett. 3 http://dx.doi.org/10.1016/S0020-0190(03)00360-0 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl88.html#Joye03 2003-11-20 A Note on the Number of Leftist Trees. 227-232 1987 25 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl25.html#Kemp87 2003-11-20 A One-to-One Correspondence between two Classes of Ordered Trees. 229-234 1989 32 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl32.html#Kemp89 2003-11-20 A One-to-One Correspondence Between a Class of Leftist Trees and Binary Trees. 97-105 1999 71 Inf. Process. Lett. 3-4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl71.html#Kemp99 http://dx.doi.org/10.1016/S0020-0190(99)00106-4 2003-11-20 Deques with Heap Order. 197-200 1986 22 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl22.html#GajewskaT86 2003-11-20 Learning Convex Bodies under Uniform Distribution. 35-39 1992 43 Inf. Process. Lett. 1 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl43.html#Kern92 2003-11-20 An Efficient Parallel Algorithm for Random Sampling. 265-268 1989 30 Inf. Process. Lett. 5 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl30.html#RajaGG89 2003-11-20 An Efficient Distributed Depth-First-Search Algorithm. 183-186 1989 32 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl32.html#SharmaI89 2003-11-20 Fast and Read-Only Algorithms for Traversing Trees Without an Auxiliary Stack. 149-152 1972 1 Inf. Process. Lett. 4 http://www.informatik.uni-trier.de/~ley/db/journals/ipl/ipl1.html#Siklossy72