default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/jacm/jacm22.bht:"
download as .bib file
@article{DBLP:journals/jacm/Babad75,
author = {Jair M. Babad},
title = {A Generalized Multi-Entrance Time-Sharing Priority Queue},
journal = {J. {ACM}},
volume = {22},
number = {2},
pages = {231--247},
year = {1975},
url = {https://doi.org/10.1145/321879.321886},
doi = {10.1145/321879.321886},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Babad75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BaskettCMP75,
author = {Forest Baskett and
K. Mani Chandy and
Richard R. Muntz and
Fernando G. Palacios},
title = {Open, Closed, and Mixed Networks of Queues with Different Classes
of Customers},
journal = {J. {ACM}},
volume = {22},
number = {2},
pages = {248--260},
year = {1975},
url = {https://doi.org/10.1145/321879.321887},
doi = {10.1145/321879.321887},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BaskettCMP75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Bertsch75,
author = {Eberhard Bertsch},
title = {An Observation on Relative Parsing Time},
journal = {J. {ACM}},
volume = {22},
number = {4},
pages = {493--498},
year = {1975},
url = {https://doi.org/10.1145/321906.321912},
doi = {10.1145/321906.321912},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Bertsch75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BoyerM75,
author = {Robert S. Boyer and
J Strother Moore},
title = {Proving Theorems about {LISP} Functions},
journal = {J. {ACM}},
volume = {22},
number = {1},
pages = {129--144},
year = {1975},
url = {https://doi.org/10.1145/321864.321875},
doi = {10.1145/321864.321875},
timestamp = {Mon, 19 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/BoyerM75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BrunoL75,
author = {John L. Bruno and
T. Lassagne},
title = {The Generation of Optimal Code for Stack Machines},
journal = {J. {ACM}},
volume = {22},
number = {3},
pages = {382--396},
year = {1975},
url = {https://doi.org/10.1145/321892.321901},
doi = {10.1145/321892.321901},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BrunoL75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Cash75,
author = {Jeff R. Cash},
title = {A Class of Implicit Runge-Kutta Methods for the Numerical Integration
of Stiff Ordinary Differential Equations},
journal = {J. {ACM}},
volume = {22},
number = {4},
pages = {504--511},
year = {1975},
url = {https://doi.org/10.1145/321906.321915},
doi = {10.1145/321906.321915},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Cash75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Chaitin75,
author = {Gregory J. Chaitin},
title = {A Theory of Program Size Formally Identical to Information Theory},
journal = {J. {ACM}},
volume = {22},
number = {3},
pages = {329--340},
year = {1975},
url = {https://doi.org/10.1145/321892.321894},
doi = {10.1145/321892.321894},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Chaitin75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Dass75,
author = {Bal Kishan Dass},
title = {A Sufficient Bound for Codes Correcting Bursts with Weight Constraint},
journal = {J. {ACM}},
volume = {22},
number = {4},
pages = {501--503},
year = {1975},
url = {https://doi.org/10.1145/321906.321914},
doi = {10.1145/321906.321914},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Dass75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/DresslerP75,
author = {Robert E. Dressler and
S. Thomas Parker},
title = {Primes with a Prime Subscript},
journal = {J. {ACM}},
volume = {22},
number = {3},
pages = {380--381},
year = {1975},
url = {https://doi.org/10.1145/321892.321900},
doi = {10.1145/321892.321900},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/DresslerP75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/EastonW75,
author = {Malcolm C. Easton and
C. K. Wong},
title = {The Effect of a Capacity Constraint on the Minimal Cost of a Partition},
journal = {J. {ACM}},
volume = {22},
number = {4},
pages = {441--449},
year = {1975},
url = {https://doi.org/10.1145/321906.321907},
doi = {10.1145/321906.321907},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/EastonW75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/EliasF75,
author = {Peter Elias and
Richard A. Flower},
title = {The Complexity of Some Simple Retrieval Problems},
journal = {J. {ACM}},
volume = {22},
number = {3},
pages = {367--379},
year = {1975},
url = {https://doi.org/10.1145/321892.321899},
doi = {10.1145/321892.321899},
timestamp = {Mon, 03 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/EliasF75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/FullerB75,
author = {Samuel H. Fuller and
Forest Baskett},
title = {An Analysis of Drum Storage Units},
journal = {J. {ACM}},
volume = {22},
number = {1},
pages = {83--105},
year = {1975},
url = {https://doi.org/10.1145/321864.321871},
doi = {10.1145/321864.321871},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/FullerB75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Gelenbe75,
author = {Erol Gelenbe},
title = {On Approximate Computer System Models},
journal = {J. {ACM}},
volume = {22},
number = {2},
pages = {261--269},
year = {1975},
url = {https://doi.org/10.1145/321879.321888},
doi = {10.1145/321879.321888},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Gelenbe75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GoodmanHS75,
author = {Seymour E. Goodman and
Stephen T. Hedetniemi and
Peter J. Slater},
title = {Advances on the Hamiltonian Completion Problem},
journal = {J. {ACM}},
volume = {22},
number = {3},
pages = {352--360},
year = {1975},
url = {https://doi.org/10.1145/321892.321897},
doi = {10.1145/321892.321897},
timestamp = {Tue, 22 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/GoodmanHS75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GotliebM75,
author = {C. C. Gotlieb and
Glenn H. MacEwen},
title = {Errata: "Performance of Movable-Head Disk Storage Devices"},
journal = {J. {ACM}},
volume = {22},
number = {1},
pages = {172},
year = {1975},
url = {https://doi.org/10.1145/321864.321878},
doi = {10.1145/321864.321878},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/GotliebM75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Hayes75,
author = {John P. Hayes},
title = {The Fanout Structure of Switching Functions},
journal = {J. {ACM}},
volume = {22},
number = {4},
pages = {551--571},
year = {1975},
url = {https://doi.org/10.1145/321906.321918},
doi = {10.1145/321906.321918},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Hayes75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/HofriY75,
author = {Micha Hofri and
Micha Yadin},
title = {A Processor in Series with Demand-Interrupting Devices - {A} Stochastic
Model},
journal = {J. {ACM}},
volume = {22},
number = {2},
pages = {270--290},
year = {1975},
url = {https://doi.org/10.1145/321879.321889},
doi = {10.1145/321879.321889},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/HofriY75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Horowitz75,
author = {Ellis Horowitz},
title = {A Sorting Algorithm for Polynomial Multiplication},
journal = {J. {ACM}},
volume = {22},
number = {4},
pages = {450--462},
year = {1975},
url = {https://doi.org/10.1145/321906.321908},
doi = {10.1145/321906.321908},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Horowitz75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/HorowitzS75,
author = {Ellis Horowitz and
Sartaj Sahni},
title = {On Computing the Exact Determinant of Matrices with Polynomial Entries},
journal = {J. {ACM}},
volume = {22},
number = {1},
pages = {38--50},
year = {1975},
url = {https://doi.org/10.1145/321864.321868},
doi = {10.1145/321864.321868},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/HorowitzS75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Hsu75,
author = {Harry T. Hsu},
title = {An Algorithm for Finding a Minimal Equivalent Graph of a Digraph},
journal = {J. {ACM}},
volume = {22},
number = {1},
pages = {11--16},
year = {1975},
url = {https://doi.org/10.1145/321864.321866},
doi = {10.1145/321864.321866},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Hsu75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/IbarraK75,
author = {Oscar H. Ibarra and
Chul E. Kim},
title = {Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems},
journal = {J. {ACM}},
volume = {22},
number = {4},
pages = {463--468},
year = {1975},
url = {https://doi.org/10.1145/321906.321909},
doi = {10.1145/321906.321909},
timestamp = {Sat, 30 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/IbarraK75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/JumpT75,
author = {J. Robert Jump and
P. S. Thiagarajan},
title = {On the Interconnection of Asynchronous Control Structures},
journal = {J. {ACM}},
volume = {22},
number = {4},
pages = {596--612},
year = {1975},
url = {https://doi.org/10.1145/321906.321920},
doi = {10.1145/321906.321920},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/JumpT75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Knauer75,
author = {Bernd Knauer},
title = {A Simple Planarity Criterion},
journal = {J. {ACM}},
volume = {22},
number = {2},
pages = {226--230},
year = {1975},
url = {https://doi.org/10.1145/321879.321885},
doi = {10.1145/321879.321885},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Knauer75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/KohlerS75,
author = {Walter H. Kohler and
Kenneth Steiglitz},
title = {Exact, Approximate, and Guaranteed Accuracy Algorithms for the Flow-Shop
Problem n/2/F/{\textbackslash}bar {F}},
journal = {J. {ACM}},
volume = {22},
number = {1},
pages = {106--114},
year = {1975},
url = {https://doi.org/10.1145/321864.321872},
doi = {10.1145/321864.321872},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/KohlerS75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Kowalski75,
author = {Robert A. Kowalski},
title = {A Proof Procedure Using Connection Graphs},
journal = {J. {ACM}},
volume = {22},
number = {4},
pages = {572--595},
year = {1975},
url = {https://doi.org/10.1145/321906.321919},
doi = {10.1145/321906.321919},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Kowalski75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/KrauseSS75,
author = {K. L. Krause and
Vincent Y. Shen and
Herbert D. Schwetman},
title = {Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming
Computer Systems},
journal = {J. {ACM}},
volume = {22},
number = {4},
pages = {522--550},
year = {1975},
url = {https://doi.org/10.1145/321906.321917},
doi = {10.1145/321906.321917},
timestamp = {Wed, 11 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/KrauseSS75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/KungLP75,
author = {H. T. Kung and
Fabrizio Luccio and
Franco P. Preparata},
title = {On Finding the Maxima of a Set of Vectors},
journal = {J. {ACM}},
volume = {22},
number = {4},
pages = {469--476},
year = {1975},
url = {https://doi.org/10.1145/321906.321910},
doi = {10.1145/321906.321910},
timestamp = {Tue, 28 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/KungLP75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Ladner75,
author = {Richard E. Ladner},
title = {On the Structure of Polynomial Time Reducibility},
journal = {J. {ACM}},
volume = {22},
number = {1},
pages = {155--171},
year = {1975},
url = {https://doi.org/10.1145/321864.321877},
doi = {10.1145/321864.321877},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Ladner75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/LowranceW75,
author = {Roy Lowrance and
Robert A. Wagner},
title = {An Extension of the String-to-String Correction Problem},
journal = {J. {ACM}},
volume = {22},
number = {2},
pages = {177--183},
year = {1975},
url = {https://doi.org/10.1145/321879.321880},
doi = {10.1145/321879.321880},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/LowranceW75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Lynch75,
author = {Nancy A. Lynch},
title = {On Reducibility to Complex or Sparse Sets},
journal = {J. {ACM}},
volume = {22},
number = {3},
pages = {341--345},
year = {1975},
url = {https://doi.org/10.1145/321892.321895},
doi = {10.1145/321892.321895},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Lynch75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Manacher75,
author = {Glenn K. Manacher},
title = {A New Linear-Time "On-Line" Algorithm for Finding the Smallest Initial
Palindrome of a String},
journal = {J. {ACM}},
volume = {22},
number = {3},
pages = {346--351},
year = {1975},
url = {https://doi.org/10.1145/321892.321896},
doi = {10.1145/321892.321896},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Manacher75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/MicchelliM75,
author = {Charles A. Micchelli and
Willard L. Miranker},
title = {High Order Search Methods for Finding Roots},
journal = {J. {ACM}},
volume = {22},
number = {1},
pages = {51--60},
year = {1975},
url = {https://doi.org/10.1145/321864.321869},
doi = {10.1145/321864.321869},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/MicchelliM75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Miller75,
author = {Webb Miller},
title = {Computer Search for Numerical Instability},
journal = {J. {ACM}},
volume = {22},
number = {4},
pages = {512--521},
year = {1975},
url = {https://doi.org/10.1145/321906.321916},
doi = {10.1145/321906.321916},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Miller75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Morgenstern75,
author = {Jacques Morgenstern},
title = {The Linear Complexity of Computation},
journal = {J. {ACM}},
volume = {22},
number = {2},
pages = {184--194},
year = {1975},
url = {https://doi.org/10.1145/321879.321881},
doi = {10.1145/321879.321881},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Morgenstern75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/MullerP75,
author = {David E. Muller and
Franco P. Preparata},
title = {Bounds to Complexities of Networks for Sorting and for Switching},
journal = {J. {ACM}},
volume = {22},
number = {2},
pages = {195--201},
year = {1975},
url = {https://doi.org/10.1145/321879.321882},
doi = {10.1145/321879.321882},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/MullerP75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Musser75,
author = {David R. Musser},
title = {Multivariate Polynomial Factorization},
journal = {J. {ACM}},
volume = {22},
number = {2},
pages = {291--308},
year = {1975},
url = {https://doi.org/10.1145/321879.321890},
doi = {10.1145/321879.321890},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Musser75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Oney75,
author = {Walter C. Oney},
title = {Queueing Analysis of the Scan Policy for Moving-Head Disks},
journal = {J. {ACM}},
volume = {22},
number = {3},
pages = {397--412},
year = {1975},
url = {https://doi.org/10.1145/321892.321902},
doi = {10.1145/321892.321902},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Oney75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/PerlGE75,
author = {Yehoshua Perl and
M. R. Garey and
Shimon Even},
title = {Efficient Generation of Optimal Prefix Code: Equiprobable Words Using
Unequal Cost Letters},
journal = {J. {ACM}},
volume = {22},
number = {2},
pages = {202--214},
year = {1975},
url = {https://doi.org/10.1145/321879.321883},
doi = {10.1145/321879.321883},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/PerlGE75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Pfaltz75,
author = {John L. Pfaltz},
title = {Representing Graphs by Knuth Trees},
journal = {J. {ACM}},
volume = {22},
number = {3},
pages = {361--366},
year = {1975},
url = {https://doi.org/10.1145/321892.321898},
doi = {10.1145/321892.321898},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Pfaltz75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Rice75,
author = {John R. Rice},
title = {A Metalgorithm for Adaptive Quadrature},
journal = {J. {ACM}},
volume = {22},
number = {1},
pages = {61--82},
year = {1975},
url = {https://doi.org/10.1145/321864.321870},
doi = {10.1145/321864.321870},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Rice75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Rosenberg75,
author = {Arnold L. Rosenberg},
title = {Corrigendum: "Allocating Storage for Extendible Arrays"},
journal = {J. {ACM}},
volume = {22},
number = {2},
pages = {308},
year = {1975},
url = {https://doi.org/10.1145/321879.321891},
doi = {10.1145/321879.321891},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Rosenberg75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/RossKN75,
author = {G. Terry Ross and
Darwin Klingman and
H. Albert Napier},
title = {A Computational Study of the Effects of Problem Dimensions on Solution
Times for Transportation Problems},
journal = {J. {ACM}},
volume = {22},
number = {3},
pages = {413--424},
year = {1975},
url = {https://doi.org/10.1145/321892.321903},
doi = {10.1145/321892.321903},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/RossKN75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Sahni75,
author = {Sartaj Sahni},
title = {Approximate Algorithms for the 0/1 Knapsack Problem},
journal = {J. {ACM}},
volume = {22},
number = {1},
pages = {115--124},
year = {1975},
url = {https://doi.org/10.1145/321864.321873},
doi = {10.1145/321864.321873},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/Sahni75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/SchankGRR75,
author = {Roger C. Schank and
Neil M. Goldman and
Charles J. Rieger III and
Christopher Riesbeck},
title = {Inference and Paraphrase by Computer},
journal = {J. {ACM}},
volume = {22},
number = {3},
pages = {309--328},
year = {1975},
url = {https://doi.org/10.1145/321892.321893},
doi = {10.1145/321892.321893},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/SchankGRR75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Sethi75,
author = {Ravi Sethi},
title = {Errata: "Testing for the Church-Rosser Property"},
journal = {J. {ACM}},
volume = {22},
number = {3},
pages = {424},
year = {1975},
url = {https://doi.org/10.1145/321892.321905},
doi = {10.1145/321892.321905},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Sethi75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Sudborough75,
author = {Ivan Hal Sudborough},
title = {A Note on Tape-Bounded Complexity Classes and Linear Context-Free
languages},
journal = {J. {ACM}},
volume = {22},
number = {4},
pages = {499--500},
year = {1975},
url = {https://doi.org/10.1145/321906.321913},
doi = {10.1145/321906.321913},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Sudborough75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Svoboda75,
author = {Anton{\'{\i}}n Svoboda},
title = {The Concept of Term Exclusiveness and Its Effect on the Theory of
Boolean Functions},
journal = {J. {ACM}},
volume = {22},
number = {3},
pages = {425--440},
year = {1975},
url = {https://doi.org/10.1145/321892.321904},
doi = {10.1145/321892.321904},
timestamp = {Fri, 05 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Svoboda75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Tarjan75,
author = {Robert Endre Tarjan},
title = {Efficiency of a Good But Not Linear Set Union Algorithm},
journal = {J. {ACM}},
volume = {22},
number = {2},
pages = {215--225},
year = {1975},
url = {https://doi.org/10.1145/321879.321884},
doi = {10.1145/321879.321884},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Tarjan75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Valiant75,
author = {Leslie G. Valiant},
title = {Regularity and Related Problems for Deterministic Pushdown Automata},
journal = {J. {ACM}},
volume = {22},
number = {1},
pages = {1--10},
year = {1975},
url = {https://doi.org/10.1145/321864.321865},
doi = {10.1145/321864.321865},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Valiant75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Winograd75,
author = {Shmuel Winograd},
title = {On the Parallel Evaluation of Certain Arithmetic Expressions},
journal = {J. {ACM}},
volume = {22},
number = {4},
pages = {477--492},
year = {1975},
url = {https://doi.org/10.1145/321906.321911},
doi = {10.1145/321906.321911},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Winograd75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Wright75,
author = {J. W. Wright},
title = {The Change-Making Problem},
journal = {J. {ACM}},
volume = {22},
number = {1},
pages = {125--128},
year = {1975},
url = {https://doi.org/10.1145/321864.321874},
doi = {10.1145/321864.321874},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Wright75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Yelowitz75,
author = {Lawrence Yelowitz},
title = {Derivation of a Path-Connectivity Matrix for Tagged Flowcharts},
journal = {J. {ACM}},
volume = {22},
number = {1},
pages = {145--154},
year = {1975},
url = {https://doi.org/10.1145/321864.321876},
doi = {10.1145/321864.321876},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Yelowitz75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Yu75,
author = {Clement T. Yu},
title = {A Formal Construction of Term Classes},
journal = {J. {ACM}},
volume = {22},
number = {1},
pages = {17--37},
year = {1975},
url = {https://doi.org/10.1145/321864.321867},
doi = {10.1145/321864.321867},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Yu75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
retrieved on 2024-09-24 14:44 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
