首页>外文会议>Foundations of Computer Science, 1993. Proceedings., 34th Annual Symposium on

Foundations of Computer Science, 1993. Proceedings., 34th Annual Symposium on

召开年：
召开地：Palo Alto, CA
出版时间：-

会议文集：-

会议论文

热门论文

全部论文

全选（0）

1.Optimal parallel all-nearest-neighbors using the well-separatedpair decomposition

机译：使用良好分隔的最佳并行所有近邻对分解
- 作者：Callahan P.B.
- 会议名称：《Foundations of Computer Science, 1993. Proceedings., 34th Annual Symposium on》
2.Learning an intersection of k halfspaces over a uniformdistribution

机译：学习均匀的k个半空间的交集分配
- 作者：Blum A.;Kannan R.
- 会议名称：《Foundations of Computer Science, 1993. Proceedings., 34th Annual Symposium on》
3.Solving systems of set constraints with negated subsetrelationships

机译：用负子集求解集合约束的系统关系
- 作者：Gilleron R.;Tison S.;Tommasi M.
- 会议名称：《Foundations of Computer Science, 1993. Proceedings., 34th Annual Symposium on》
4.A randomized time-space tradeoff of O˜(mRˆ) for USTCON

机译：USTCON的O〜（mRˆ）随机时空折衷
- 作者：Feige U.
- 会议名称：《Foundations of Computer Science, 1993. Proceedings., 34th Annual Symposium on》
5.On the “log rank”-conjecture in communicationcomplexity

机译：关于“对数等级”的猜想复杂
- 作者：Raz R.;Spieker B.
- 会议名称：《Foundations of Computer Science, 1993. Proceedings., 34th Annual Symposium on》
6.Using difficulty of prediction to decrease computation: fast sort,priority queue and convex hull on entropy bounded inputs

机译：使用预测难度来减少计算量：快速排序，熵有界输入上的优先级队列和凸包
- 作者：Chen S.;Reif J.H.
- 会议名称：《Foundations of Computer Science, 1993. Proceedings., 34th Annual Symposium on》
7.Fast algorithms for constructing t-spanners and paths with stretcht

机译：快速构造带有拉伸的t型扳手和路径的算法Ť
- 作者：Cohen E.
- 会议名称：《Foundations of Computer Science, 1993. Proceedings., 34th Annual Symposium on》
8.Optimally fast parallel algorithms for preprocessing and patternmatching in one and two dimensions

机译：用于预处理和模式的最佳快速并行算法一维和二维匹配
- 作者：Cole R.;Crochemore M.;Galil Z.;Gasieniec L.;Eariharan R.;Muthukrishnan S.;Park K.;Rytter W.
- 会议名称：《Foundations of Computer Science, 1993. Proceedings., 34th Annual Symposium on》
9.A linear-processor polylog-time algorithm for shortest paths inplanar graphs

机译：用于最短路径的线性处理器多对数时间算法平面图
- 作者：Klein P.N.;Subramanian S.
- 会议名称：《Foundations of Computer Science, 1993. Proceedings., 34th Annual Symposium on》
10.A polynomial time algorithm for counting integral points inpolyhedra when the dimension is fixed

机译：用于计算积分中点的多项式时间算法尺寸固定时的多面体
- 作者：Barvinok A.I.
- 会议名称：《Foundations of Computer Science, 1993. Proceedings., 34th Annual Symposium on》
11.A polynomial-time algorithm for the perfect phylogeny problem whenthe number of character states is fixed

机译：完美系统发育问题时的多项式时间算法字符状态数是固定的
- 作者：Agarwala R.;Fernandez-Baca D.
- 会议名称：《Foundations of Computer Science, 1993. Proceedings., 34th Annual Symposium on》
12.Eavesdropping games: a graph-theoretic approach to privacy indistributed systems

机译：窃听游戏：图论隐私保护的方法分布式系统
- 作者：Franklin M.;Galil Z.;Yung M.
- 会议名称：《Foundations of Computer Science, 1993. Proceedings., 34th Annual Symposium on》
13.A sub-linear time distributed algorithm for minimum-weight spanningtrees

机译：次线性时间分布最小加权算法树木
- 作者：Garay J.A.;Kutten S.;Peleg D.
- 会议名称：《Foundations of Computer Science, 1993. Proceedings., 34th Annual Symposium on》
14.Signal propagation, with application to a lower bound on the depthof noisy formulas

机译：信号传播，适用于深度的下限嘈杂的公式
- 作者：Evans W.;Schulman L.J.
- 会议名称：《Foundations of Computer Science, 1993. Proceedings., 34th Annual Symposium on》
15.Refining a triangulation of a planar straight-line graph toeliminate large angles

机译：将平面直线图的三角剖分细化为消除大角度
- 作者：Mitchell S.A.
- 会议名称：《Foundations of Computer Science, 1993. Proceedings., 34th Annual Symposium on》
16.A compact piecewise-linear Voronoi diagram for convex sites in theplane

机译：紧凸段上的紧凑分段线性Voronoi图飞机
- 作者：McAllister M.;Kirkpatrick D.;Snoeyink J.
- 会议名称：《Foundations of Computer Science, 1993. Proceedings., 34th Annual Symposium on》
17.A simple local-control approximation algorithm for multicommodityflow

机译：一种用于多商品的简单本地控制近似算法流
- 作者：Awerbuch B.;Leighton T.
- 会议名称：《Foundations of Computer Science, 1993. Proceedings., 34th Annual Symposium on》
18.A framework for cost-scaling algorithms for submodular flowproblems

机译：亚模块流成本分摊算法的框架问题
- 作者：Gabow H.N.
- 会议名称：《Foundations of Computer Science, 1993. Proceedings., 34th Annual Symposium on》
19.Near-quadratic bounds for the motion planning problem for a polygonin a polygonal environment

机译：多边形运动规划问题的近二次边界在多边形环境中
- 作者：Halperin D.;Sharir M.
- 会议名称：《Foundations of Computer Science, 1993. Proceedings., 34th Annual Symposium on》
20.A quantum bit commitment scheme provably unbreakable by bothparties

机译：量子比特承诺方案证明双方都坚不可摧派对
- 作者：Brassard G.;Crepeau C.;Jozsa R.;Langlois D.
- 会议名称：《Foundations of Computer Science, 1993. Proceedings., 34th Annual Symposium on》
21.Primal-dual RNC approximation algorithms for (multi)-set(multi)-cover and covering integer programs

机译：（多）集的本对偶RNC近似算法（多）覆盖并覆盖整数程序
- 作者：Rajagopalan S.;Vazirani V.V.
- 会议名称：《Foundations of Computer Science, 1993. Proceedings., 34th Annual Symposium on》
22.General bounds on statistical query learning and PAC learning withnoise via hypothesis boosting

机译：统计查询学习和PAC学习的一般界限通过假设增强噪音
- 作者：Aslam J.A.;Decatur S.E.
- 会议名称：《Foundations of Computer Science, 1993. Proceedings., 34th Annual Symposium on》
23.Breaking the Θ(nlog2 n) barrier for sorting withfaults

机译：打破Θ（nlog 2 n）障碍进行排序缺点
- 作者：Leighton T.;Yuan Ma
- 会议名称：《Foundations of Computer Science, 1993. Proceedings., 34th Annual Symposium on》
24.The hardness of approximate optima in lattices, codes, and systemsof linear equations

机译：晶格，代码和系统中近似最佳的硬度线性方程组
- 作者：Arora S.;Babai L.;Stern J.;Sweedyk Z.
- 会议名称：《Foundations of Computer Science, 1993. Proceedings., 34th Annual Symposium on》
25.Efficient out-of-core algorithms for linear relaxation usingblocking covers

机译：使用以下方法进行线性松弛的有效核外算法遮盖
- 作者：Leiserson C.E.;Rao S.;Toledo S.
- 会议名称：《Foundations of Computer Science, 1993. Proceedings., 34th Annual Symposium on》
26.Near-linear cost sequential and distributed constructions of sparseneighborhood covers

机译：稀疏的近线性成本顺序和分布构造社区覆盖
- 作者：Awerbuch B.;Berger B.;Cowen L.;Peleg D.
- 会议名称：《Foundations of Computer Science, 1993. Proceedings., 34th Annual Symposium on》
27.An O(nlog3 n) algorithm for the real root problem

机译：实根问题的O（nlog 3 n）算法
- 作者：Reif J.H.
- 会议名称：《Foundations of Computer Science, 1993. Proceedings., 34th Annual Symposium on》
28.Directed vs. undirected monotone contact networks for thresholdfunctions

机译：阈值的有向与无向单调接触网络功能
- 作者：Halldorsson M.M.;Radhakrishnan J.;Subrahmanyam K.V.
- 会议名称：《Foundations of Computer Science, 1993. Proceedings., 34th Annual Symposium on》
29.Highly efficient asynchronous execution of large-grained parallelprograms

机译：大粒度并行的高效异步执行程式
- 作者：Aumann Y.;Kedum Z.M.;Palem K.V.;Rabin M.O.
- 会议名称：《Foundations of Computer Science, 1993. Proceedings., 34th Annual Symposium on》
30.Space bounds for graph connectivity problems on node-named JAGs andnode-ordered JAGs

机译：节点命名的JAG和上的图连接性问题的空间界限节点排序的JAG
- 作者：Poon C.K.
- 会议名称：《Foundations of Computer Science, 1993. Proceedings., 34th Annual Symposium on》
31.Random sampling in matroids, with applications to graphconnectivity and minimum spanning trees

机译：拟阵中的随机采样及其在图形中的应用连接性和最小生成树
- 作者：Karker D.R.
- 会议名称：《Foundations of Computer Science, 1993. Proceedings., 34th Annual Symposium on》
32.The NC equivalence of planar integer linear programming andEuclidean GCD

机译：平面整数线性规划与欧几里得GCD
- 作者：Shallcross D.;Pan V.;Yu Lin-Kriz
- 会议名称：《Foundations of Computer Science, 1993. Proceedings., 34th Annual Symposium on》
33.Optimal bi-weighted binary trees and the complexity of maintainingpartial sums

机译：最佳双加权二叉树和维护的复杂性部分和
- 作者：Hampapuram H.;Fredman M.L.
- 会议名称：《Foundations of Computer Science, 1993. Proceedings., 34th Annual Symposium on》
34.Testing equalities of multiplicative representations in polynomialtime

机译：测试多项式中乘法表示的等式时间
- 作者：Guoqiang Ge
- 会议名称：《Foundations of Computer Science, 1993. Proceedings., 34th Annual Symposium on》
35.Proceedings of 1993 IEEE 34th Annual Foundations of ComputerScience

机译：1993 IEEE第34届计算机年度基金会论文集科学
- 会议名称：《Foundations of Computer Science, 1993. Proceedings., 34th Annual Symposium on》