Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/siamcomp/siamcomp14.bht:"
download as .bib file
@article{DBLP:journals/siamcomp/Alblas85,
author = {Henk Alblas},
title = {Finding Minimal Pass Sequences for Attribute Grammars},
journal = {{SIAM} J. Comput.},
volume = {14},
number = {4},
pages = {889--914},
year = {1985},
url = {https://doi.org/10.1137/0214063},
doi = {10.1137/0214063},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Alblas85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AltM85,
author = {Helmut Alt and
Kurt Mehlhorn},
title = {Searching Semisorted Tables},
journal = {{SIAM} J. Comput.},
volume = {14},
number = {4},
pages = {840--848},
year = {1985},
url = {https://doi.org/10.1137/0214059},
doi = {10.1137/0214059},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AltM85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Balcazar85,
author = {Jos{\'{e}} L. Balc{\'{a}}zar},
title = {Simplicity, Relativizations and Nondeterminism},
journal = {{SIAM} J. Comput.},
volume = {14},
number = {1},
pages = {148--157},
year = {1985},
url = {https://doi.org/10.1137/0214012},
doi = {10.1137/0214012},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Balcazar85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BentST85,
author = {Samuel W. Bent and
Daniel Dominic Sleator and
Robert Endre Tarjan},
title = {Biased Search Trees},
journal = {{SIAM} J. Comput.},
volume = {14},
number = {3},
pages = {545--568},
year = {1985},
url = {https://doi.org/10.1137/0214041},
doi = {10.1137/0214041},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BentST85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BoyceDDG85,
author = {James E. Boyce and
David P. Dobkin and
Robert L. (Scot) Drysdale III and
Leonidas J. Guibas},
title = {Finding Extremal Polygons},
journal = {{SIAM} J. Comput.},
volume = {14},
number = {1},
pages = {134--147},
year = {1985},
url = {https://doi.org/10.1137/0214011},
doi = {10.1137/0214011},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BoyceDDG85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChandraV85,
author = {Ashok K. Chandra and
Moshe Y. Vardi},
title = {The Implication Problem for Functional and Inclusion Dependencies
is Undecidable},
journal = {{SIAM} J. Comput.},
volume = {14},
number = {3},
pages = {671--677},
year = {1985},
url = {https://doi.org/10.1137/0214049},
doi = {10.1137/0214049},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ChandraV85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChibaN85,
author = {Norishige Chiba and
Takao Nishizeki},
title = {Arboricity and Subgraph Listing Algorithms},
journal = {{SIAM} J. Comput.},
volume = {14},
number = {1},
pages = {210--223},
year = {1985},
url = {https://doi.org/10.1137/0214017},
doi = {10.1137/0214017},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/ChibaN85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChungMST85,
author = {Moon{-}Jung Chung and
Fillia Makedon and
Ivan Hal Sudborough and
Jonathan S. Turner},
title = {Polynomial Time Algorithms for the Min Cut Problem on Degree Restricted
Trees},
journal = {{SIAM} J. Comput.},
volume = {14},
number = {1},
pages = {158--177},
year = {1985},
url = {https://doi.org/10.1137/0214013},
doi = {10.1137/0214013},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ChungMST85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CoffmanGJL85,
author = {Edward G. Coffman Jr. and
M. R. Garey and
David S. Johnson and
Andrea S. LaPaugh},
title = {Scheduling File Transfers},
journal = {{SIAM} J. Comput.},
volume = {14},
number = {3},
pages = {744--780},
year = {1985},
url = {https://doi.org/10.1137/0214054},
doi = {10.1137/0214054},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/CoffmanGJL85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CoffmanKS85,
author = {Edward G. Coffman Jr. and
T. T. Kadota and
Larry A. Shepp},
title = {A Stochastic Model of Fragmentation in Dynamic Storage Allocation},
journal = {{SIAM} J. Comput.},
volume = {14},
number = {2},
pages = {416--425},
year = {1985},
url = {https://doi.org/10.1137/0214032},
doi = {10.1137/0214032},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/CoffmanKS85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CookH85,
author = {Stephen A. Cook and
H. James Hoover},
title = {A Depth-Universal Circuit},
journal = {{SIAM} J. Comput.},
volume = {14},
number = {4},
pages = {833--839},
year = {1985},
url = {https://doi.org/10.1137/0214058},
doi = {10.1137/0214058},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/CookH85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CorneilPS85,
author = {Derek G. Corneil and
Yehoshua Perl and
Lorna K. Stewart},
title = {A Linear Recognition Algorithm for Cographs},
journal = {{SIAM} J. Comput.},
volume = {14},
number = {4},
pages = {926--934},
year = {1985},
url = {https://doi.org/10.1137/0214065},
doi = {10.1137/0214065},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/CorneilPS85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DolevW85,
author = {Danny Dolev and
Manfred K. Warmuth},
title = {Scheduling Flat Graphs},
journal = {{SIAM} J. Comput.},
volume = {14},
number = {3},
pages = {638--657},
year = {1985},
url = {https://doi.org/10.1137/0214047},
doi = {10.1137/0214047},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/DolevW85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/El-MallahC85,
author = {Ehab S. Elmallah and
Charles J. Colbourn},
title = {Optimum Communication Spanning Trees in Series-Parallel Networks},
journal = {{SIAM} J. Comput.},
volume = {14},
number = {4},
pages = {915--925},
year = {1985},
url = {https://doi.org/10.1137/0214064},
doi = {10.1137/0214064},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/El-MallahC85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FaigleGS85,
author = {Ulrich Faigle and
Gerhard Gierz and
Rainer Schrader},
title = {Algorithmic approaches to setup minimization},
journal = {{SIAM} J. Comput.},
volume = {14},
number = {4},
pages = {954--965},
year = {1985},
url = {https://doi.org/10.1137/0214068},
doi = {10.1137/0214068},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/FaigleGS85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Fiduccia85,
author = {Charles M. Fiduccia},
title = {An Efficient Formula for Linear Recurrences},
journal = {{SIAM} J. Comput.},
volume = {14},
number = {1},
pages = {106--112},
year = {1985},
url = {https://doi.org/10.1137/0214007},
doi = {10.1137/0214007},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Fiduccia85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Frederickson85,
author = {Greg N. Frederickson},
title = {Data Structures for On-Line Updating of Minimum Spanning Trees, with
Applications},
journal = {{SIAM} J. Comput.},
volume = {14},
number = {4},
pages = {781--798},
year = {1985},
url = {https://doi.org/10.1137/0214055},
doi = {10.1137/0214055},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Frederickson85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GareyJ85,
author = {M. R. Garey and
David S. Johnson},
title = {Composing Functions to Minimize Image Size},
journal = {{SIAM} J. Comput.},
volume = {14},
number = {2},
pages = {500--503},
year = {1985},
url = {https://doi.org/10.1137/0214037},
doi = {10.1137/0214037},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GareyJ85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GoudaR85,
author = {Mohamed G. Gouda and
Louis E. Rosier},
title = {Priority Networks of Communicating Finite State Machines},
journal = {{SIAM} J. Comput.},
volume = {14},
number = {3},
pages = {569--584},
year = {1985},
url = {https://doi.org/10.1137/0214042},
doi = {10.1137/0214042},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GoudaR85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HambruschS85,
author = {Susanne E. Hambrusch and
Janos Simon},
title = {Solving Undirected Graph Problems on {VLSI}},
journal = {{SIAM} J. Comput.},
volume = {14},
number = {3},
pages = {527--544},
year = {1985},
url = {https://doi.org/10.1137/0214040},
doi = {10.1137/0214040},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/HambruschS85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HartS85,
author = {Sergiu Hart and
Micha Sharir},
title = {Concurrent Probabilistic Programs, Or: How to Schedule if You Must},
journal = {{SIAM} J. Comput.},
volume = {14},
number = {4},
pages = {991--1012},
year = {1985},
url = {https://doi.org/10.1137/0214070},
doi = {10.1137/0214070},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/HartS85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Hartmann85,
author = {Werner Hartmann},
title = {On the Multiplicative Complexity of Modules Over Associative Algebras},
journal = {{SIAM} J. Comput.},
volume = {14},
number = {2},
pages = {383--395},
year = {1985},
url = {https://doi.org/10.1137/0214029},
doi = {10.1137/0214029},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Hartmann85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HassinJ85,
author = {Refael Hassin and
Donald B. Johnson},
title = {An O(n log\({}^{\mbox{2}}\) n) Algorithm for Maximum Flow in Undirected
Planar Networks},
journal = {{SIAM} J. Comput.},
volume = {14},
number = {3},
pages = {612--624},
year = {1985},
url = {https://doi.org/10.1137/0214045},
doi = {10.1137/0214045},
timestamp = {Tue, 18 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/HassinJ85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HopcroftJW85,
author = {John E. Hopcroft and
Deborah Joseph and
Sue Whitesides},
title = {On the Movement of Robot Arms in 2-Dimensional Bounded Regions},
journal = {{SIAM} J. Comput.},
volume = {14},
number = {2},
pages = {315--333},
year = {1985},
url = {https://doi.org/10.1137/0214025},
doi = {10.1137/0214025},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/HopcroftJW85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Hsu85,
author = {Wen{-}Lian Hsu},
title = {Maximum Weight Clique Algorithms for Circular-Arc Graphs and Circle
Graphs},
journal = {{SIAM} J. Comput.},
volume = {14},
number = {1},
pages = {224--231},
year = {1985},
url = {https://doi.org/10.1137/0214018},
doi = {10.1137/0214018},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Hsu85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/IbarraKM85,
author = {Oscar H. Ibarra and
Sam M. Kim and
Shlomo Moran},
title = {Sequential Machine Characterizations of Trellis and Cellular Automata
and Applications},
journal = {{SIAM} J. Comput.},
volume = {14},
number = {2},
pages = {426--447},
year = {1985},
url = {https://doi.org/10.1137/0214033},
doi = {10.1137/0214033},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/IbarraKM85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ImaiIM85,
author = {Hiroshi Imai and
Masao Iri and
Kazuo Murota},
title = {Voronoi Diagram in the Laguerre Geometry and its Applications},
journal = {{SIAM} J. Comput.},
volume = {14},
number = {1},
pages = {93--105},
year = {1985},
url = {https://doi.org/10.1137/0214006},
doi = {10.1137/0214006},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ImaiIM85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ItoIK85,
author = {Minoru Ito and
Motoaki Iwasaki and
Tadao Kasami},
title = {Some Results on the Representative Instance in Relational Databases},
journal = {{SIAM} J. Comput.},
volume = {14},
number = {2},
pages = {334--354},
year = {1985},
url = {https://doi.org/10.1137/0214026},
doi = {10.1137/0214026},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ItoIK85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Jaffe85,
author = {Jeffrey M. Jaffe},
title = {Distributed Multi-Destination Routing: The Constraints of Local Information},
journal = {{SIAM} J. Comput.},
volume = {14},
number = {4},
pages = {875--888},
year = {1985},
url = {https://doi.org/10.1137/0214062},
doi = {10.1137/0214062},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Jaffe85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Kalorkoti85,
author = {K. Kalorkoti},
title = {A Lower Bound for the Formula Size of Rational Functions},
journal = {{SIAM} J. Comput.},
volume = {14},
number = {3},
pages = {678--687},
year = {1985},
url = {https://doi.org/10.1137/0214050},
doi = {10.1137/0214050},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Kalorkoti85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Kaltofen85,
author = {Erich L. Kaltofen},
title = {Polynomial-Time Reductions from Multivariate to Bi- and Univariate
Integral Polynomial Factorization},
journal = {{SIAM} J. Comput.},
volume = {14},
number = {2},
pages = {469--489},
year = {1985},
url = {https://doi.org/10.1137/0214035},
doi = {10.1137/0214035},
timestamp = {Mon, 03 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Kaltofen85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KanellakisP85,
author = {Paris C. Kanellakis and
Christos H. Papadimitriou},
title = {The Complexity of Distributed Concurrency Control},
journal = {{SIAM} J. Comput.},
volume = {14},
number = {1},
pages = {52--74},
year = {1985},
url = {https://doi.org/10.1137/0214004},
doi = {10.1137/0214004},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/KanellakisP85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KapurN85,
author = {Deepak Kapur and
Paliath Narendran},
title = {The Knuth-Bendix Completion Procedure and Thue Systems},
journal = {{SIAM} J. Comput.},
volume = {14},
number = {4},
pages = {1052--1072},
year = {1985},
url = {https://doi.org/10.1137/0214073},
doi = {10.1137/0214073},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/KapurN85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Kedem85,
author = {Zvi M. Kedem},
title = {Optimal Allocation of Area for Single-Chip Computations},
journal = {{SIAM} J. Comput.},
volume = {14},
number = {3},
pages = {730--743},
year = {1985},
url = {https://doi.org/10.1137/0214053},
doi = {10.1137/0214053},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Kedem85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Keil85,
author = {J. Mark Keil},
title = {Decomposing a Polygon into Simpler Components},
journal = {{SIAM} J. Comput.},
volume = {14},
number = {4},
pages = {799--817},
year = {1985},
url = {https://doi.org/10.1137/0214056},
doi = {10.1137/0214056},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Keil85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KirkpatrickK85,
author = {David G. Kirkpatrick and
Maria M. Klawe},
title = {Alphabetic Minimax Trees},
journal = {{SIAM} J. Comput.},
volume = {14},
number = {3},
pages = {514--526},
year = {1985},
url = {https://doi.org/10.1137/0214039},
doi = {10.1137/0214039},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/KirkpatrickK85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KoS85,
author = {Ker{-}I Ko and
Uwe Sch{\"{o}}ning},
title = {On Circuit-Size Complexity and the Low Hierarchy in {NP}},
journal = {{SIAM} J. Comput.},
volume = {14},
number = {1},
pages = {41--51},
year = {1985},
url = {https://doi.org/10.1137/0214003},
doi = {10.1137/0214003},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/KoS85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Kurtz85,
author = {Stuart A. Kurtz},
title = {Sparse Sets in {NP} - {P:} Relativizations},
journal = {{SIAM} J. Comput.},
volume = {14},
number = {1},
pages = {113--119},
year = {1985},
url = {https://doi.org/10.1137/0214008},
doi = {10.1137/0214008},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Kurtz85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Lagarias85,
author = {J. C. Lagarias},
title = {The Computational Complexity of Simultaneous Diophantine Approximation
Problems},
journal = {{SIAM} J. Comput.},
volume = {14},
number = {1},
pages = {196--209},
year = {1985},
url = {https://doi.org/10.1137/0214016},
doi = {10.1137/0214016},
timestamp = {Tue, 23 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/Lagarias85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Landau85,
author = {Susan Landau},
title = {Factoring Polynomials Over Algebraic Number Fields},
journal = {{SIAM} J. Comput.},
volume = {14},
number = {1},
pages = {184--195},
year = {1985},
url = {https://doi.org/10.1137/0214015},
doi = {10.1137/0214015},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Landau85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Long85,
author = {Timothy J. Long},
title = {On Restricting the Size of Oracles Compared with Restricting Access
to Oracles},
journal = {{SIAM} J. Comput.},
volume = {14},
number = {3},
pages = {585--597},
year = {1985},
url = {https://doi.org/10.1137/0214043},
doi = {10.1137/0214043},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Long85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MatsumotoNS85,
author = {Kazuhiko Matsumoto and
Takao Nishizeki and
Nobuji Saito},
title = {An Efficient Algorithm for Finding Multicommodity Flows in Planar
Networks},
journal = {{SIAM} J. Comput.},
volume = {14},
number = {2},
pages = {289--302},
year = {1985},
url = {https://doi.org/10.1137/0214023},
doi = {10.1137/0214023},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/MatsumotoNS85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/McCreight85,
author = {Edward M. McCreight},
title = {Priority Search Trees},
journal = {{SIAM} J. Comput.},
volume = {14},
number = {2},
pages = {257--276},
year = {1985},
url = {https://doi.org/10.1137/0214021},
doi = {10.1137/0214021},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/McCreight85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Mitra85,
author = {Debasis Mitra},
title = {Probabilistic Models and Asymptotic Results for Concurrent Processing
with Exclusive and Non-Exclusive Locks},
journal = {{SIAM} J. Comput.},
volume = {14},
number = {4},
pages = {1030--1051},
year = {1985},
url = {https://doi.org/10.1137/0214072},
doi = {10.1137/0214072},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Mitra85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Myers85,
author = {Eugene W. Myers},
title = {An {O(E} log {E} + {I)} Expected Time Algorithm for the Planar Segment
Intersection Problem},
journal = {{SIAM} J. Comput.},
volume = {14},
number = {3},
pages = {625--637},
year = {1985},
url = {https://doi.org/10.1137/0214046},
doi = {10.1137/0214046},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Myers85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/OgdenRW85,
author = {William F. Ogden and
Rockford J. Ross and
Karl Winklmann},
title = {An "Interchange Lemma" for Context-Free Languages},
journal = {{SIAM} J. Comput.},
volume = {14},
number = {2},
pages = {410--415},
year = {1985},
url = {https://doi.org/10.1137/0214031},
doi = {10.1137/0214031},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/OgdenRW85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ParikhCHM85,
author = {Rohit Parikh and
Ashok K. Chandra and
Joseph Y. Halpern and
Albert R. Meyer},
title = {Equations Between Regular Terms and an Application to Process Logic},
journal = {{SIAM} J. Comput.},
volume = {14},
number = {4},
pages = {935--942},
year = {1985},
url = {https://doi.org/10.1137/0214066},
doi = {10.1137/0214066},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ParikhCHM85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/PurdomB85,
author = {Paul Walton Purdom Jr. and
Cynthia A. Brown},
title = {The Pure Literal Rule and Polynomial Average Time},
journal = {{SIAM} J. Comput.},
volume = {14},
number = {4},
pages = {943--953},
year = {1985},
url = {https://doi.org/10.1137/0214067},
doi = {10.1137/0214067},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/PurdomB85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ReedsS85,
author = {James A. Reeds and
Neil J. A. Sloane},
title = {Shift-Register Synthesis (Modulo m)},
journal = {{SIAM} J. Comput.},
volume = {14},
number = {3},
pages = {505--513},
year = {1985},
url = {https://doi.org/10.1137/0214038},
doi = {10.1137/0214038},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/ReedsS85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ReifS85,
author = {John H. Reif and
Paul G. Spirakis},
title = {Unbounded Speed Variability in Distributed Communications Systems},
journal = {{SIAM} J. Comput.},
volume = {14},
number = {1},
pages = {75--92},
year = {1985},
url = {https://doi.org/10.1137/0214005},
doi = {10.1137/0214005},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ReifS85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Reischuk85,
author = {R{\"{u}}diger Reischuk},
title = {Probabilistic Parallel Algorithms for Sorting and Selection},
journal = {{SIAM} J. Comput.},
volume = {14},
number = {2},
pages = {396--409},
year = {1985},
url = {https://doi.org/10.1137/0214030},
doi = {10.1137/0214030},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Reischuk85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Revesz85,
author = {Gy{\"{o}}rgy E. R{\'{e}}v{\'{e}}sz},
title = {Axioms for the Theory of Lambda-Conversion},
journal = {{SIAM} J. Comput.},
volume = {14},
number = {2},
pages = {373--382},
year = {1985},
url = {https://doi.org/10.1137/0214028},
doi = {10.1137/0214028},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Revesz85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Risler85,
author = {Jean{-}Jacques Risler},
title = {Additive Complexity and Zeros of Real Polynomials},
journal = {{SIAM} J. Comput.},
volume = {14},
number = {1},
pages = {178--183},
year = {1985},
url = {https://doi.org/10.1137/0214014},
doi = {10.1137/0214014},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Risler85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/SatyanarayanaW85,
author = {Appajosyula Satyanarayana and
R. Kevin Wood},
title = {A Linear-Time Algorithm for Computing K-Terminal Reliability in Series-Parallel
Networks},
journal = {{SIAM} J. Comput.},
volume = {14},
number = {4},
pages = {818--832},
year = {1985},
url = {https://doi.org/10.1137/0214057},
doi = {10.1137/0214057},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/SatyanarayanaW85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Sharir85,
author = {Micha Sharir},
title = {Intersection and Closest-Pair Problems for a Set of Planar Discs},
journal = {{SIAM} J. Comput.},
volume = {14},
number = {2},
pages = {448--468},
year = {1985},
url = {https://doi.org/10.1137/0214034},
doi = {10.1137/0214034},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Sharir85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/SingerSC85,
author = {Michael F. Singer and
B. David Saunders and
Bob F. Caviness},
title = {An Extension of Liouville's Theorem on Integration in Finite Terms},
journal = {{SIAM} J. Comput.},
volume = {14},
number = {4},
pages = {966--990},
year = {1985},
url = {https://doi.org/10.1137/0214069},
doi = {10.1137/0214069},
timestamp = {Tue, 29 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/SingerSC85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Snir85,
author = {Marc Snir},
title = {On Parallel Searching},
journal = {{SIAM} J. Comput.},
volume = {14},
number = {3},
pages = {688--708},
year = {1985},
url = {https://doi.org/10.1137/0214051},
doi = {10.1137/0214051},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Snir85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Spinrad85,
author = {Jeremy P. Spinrad},
title = {On Comparability and Permutation Graphs},
journal = {{SIAM} J. Comput.},
volume = {14},
number = {3},
pages = {658--670},
year = {1985},
url = {https://doi.org/10.1137/0214048},
doi = {10.1137/0214048},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Spinrad85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/StearnsH85,
author = {Richard Edwin Stearns and
Harry B. Hunt III},
title = {On the Equivalence and Containment Problems for Unambiguous Regular
Expressions, Regular Grammars and Finite Automata},
journal = {{SIAM} J. Comput.},
volume = {14},
number = {3},
pages = {598--611},
year = {1985},
url = {https://doi.org/10.1137/0214044},
doi = {10.1137/0214044},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/StearnsH85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Stockmeyer85,
author = {Larry J. Stockmeyer},
title = {On Approximation Algorithms for {\#}P},
journal = {{SIAM} J. Comput.},
volume = {14},
number = {4},
pages = {849--861},
year = {1985},
url = {https://doi.org/10.1137/0214060},
doi = {10.1137/0214060},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/Stockmeyer85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/TarjanV85,
author = {Robert Endre Tarjan and
Uzi Vishkin},
title = {An Efficient Parallel Biconnectivity Algorithm},
journal = {{SIAM} J. Comput.},
volume = {14},
number = {4},
pages = {862--874},
year = {1985},
url = {https://doi.org/10.1137/0214061},
doi = {10.1137/0214061},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/TarjanV85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/TarjanY85,
author = {Robert Endre Tarjan and
Mihalis Yannakakis},
title = {Addendum: Simple Linear-Time Algorithms to Test Chordality of Graphs,
Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs},
journal = {{SIAM} J. Comput.},
volume = {14},
number = {1},
pages = {254--255},
year = {1985},
url = {https://doi.org/10.1137/0214020},
doi = {10.1137/0214020},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/TarjanY85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Veldhorst85,
author = {Marinus Veldhorst},
title = {Approximation of the Consecutive Ones Matrix Augmentation Problem},
journal = {{SIAM} J. Comput.},
volume = {14},
number = {3},
pages = {709--729},
year = {1985},
url = {https://doi.org/10.1137/0214052},
doi = {10.1137/0214052},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Veldhorst85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/VijayanW85,
author = {Gopalakrishnan Vijayan and
Avi Wigderson},
title = {Rectilinear Graphs and their Embeddings},
journal = {{SIAM} J. Comput.},
volume = {14},
number = {2},
pages = {355--372},
year = {1985},
url = {https://doi.org/10.1137/0214027},
doi = {10.1137/0214027},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/VijayanW85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/VishkinW85,
author = {Uzi Vishkin and
Avi Wigderson},
title = {Trade-Offs Between Depth and Width in Parallel Computation},
journal = {{SIAM} J. Comput.},
volume = {14},
number = {2},
pages = {303--314},
year = {1985},
url = {https://doi.org/10.1137/0214024},
doi = {10.1137/0214024},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/VishkinW85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Vitanyi85,
author = {Paul M. B. Vit{\'{a}}nyi},
title = {An Optimal Simulation of Counter Machines},
journal = {{SIAM} J. Comput.},
volume = {14},
number = {1},
pages = {1--33},
year = {1985},
url = {https://doi.org/10.1137/0214001},
doi = {10.1137/0214001},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Vitanyi85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Vitanyi85a,
author = {Paul M. B. Vit{\'{a}}nyi},
title = {An Optimal Simulation of Counter Machines: The {ACM} Case},
journal = {{SIAM} J. Comput.},
volume = {14},
number = {1},
pages = {34--40},
year = {1985},
url = {https://doi.org/10.1137/0214002},
doi = {10.1137/0214002},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Vitanyi85a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/VitterC85,
author = {Jeffrey Scott Vitter and
Wen{-}Chin Chen},
title = {Optimum Algorithms for a Model of Direct Chaining},
journal = {{SIAM} J. Comput.},
volume = {14},
number = {2},
pages = {490--499},
year = {1985},
url = {https://doi.org/10.1137/0214036},
doi = {10.1137/0214036},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/VitterC85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Willard85,
author = {Dan E. Willard},
title = {New Data Structures for Orthogonal Range Queries},
journal = {{SIAM} J. Comput.},
volume = {14},
number = {1},
pages = {232--253},
year = {1985},
url = {https://doi.org/10.1137/0214019},
doi = {10.1137/0214019},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Willard85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Willard85a,
author = {Dan E. Willard},
title = {Searching Unindexed and Nonuniformly Generated Files in log log {N}
Time},
journal = {{SIAM} J. Comput.},
volume = {14},
number = {4},
pages = {1013--1029},
year = {1985},
url = {https://doi.org/10.1137/0214071},
doi = {10.1137/0214071},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Willard85a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Yao85,
author = {Andrew Chi{-}Chih Yao},
title = {On the Expected Performance of Path Compression Algorithms},
journal = {{SIAM} J. Comput.},
volume = {14},
number = {1},
pages = {129--133},
year = {1985},
url = {https://doi.org/10.1137/0214010},
doi = {10.1137/0214010},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Yao85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Yao85a,
author = {Andrew Chi{-}Chih Yao},
title = {On the Complexity of Maintaining Partial Sums},
journal = {{SIAM} J. Comput.},
volume = {14},
number = {2},
pages = {277--288},
year = {1985},
url = {https://doi.org/10.1137/0214022},
doi = {10.1137/0214022},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Yao85a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/YaoY85,
author = {Andrew Chi{-}Chih Yao and
F. Frances Yao},
title = {On Fault-Tolerant Networks for Sorting},
journal = {{SIAM} J. Comput.},
volume = {14},
number = {1},
pages = {120--128},
year = {1985},
url = {https://doi.org/10.1137/0214009},
doi = {10.1137/0214009},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/YaoY85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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-05-15 11:20 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:
