LATIN 2000: Theoretical Informatics: 4th Latin American Symposium, Punta del Este, Uruguay, April 10-14, 2000 Proceedings
LATIN 2000: Theoretical Informatics: 4th Latin American Symposium, Punta del Este, Uruguay, April 10-14, 2000 Proceedings
复制标题
LATIN 2000：理论信息学：第四届拉丁美洲研讨会，乌拉圭埃斯特角城，2000 年 4 月 10 日至 14 日会议记录
DOI：
--
复制
发表时间：
2000
期刊：
影响因子：
--
通讯作者：
Alfredo Viola
中科院分区：
文献类型：
--
作者：
G. Gonnet;D. Panario;Alfredo Viola
随机结构和算法。规律性的数学方面。随机图中的小极大匹配关于稀疏连通无同构标号图的几点注记fabric随机正则图的边删除过程分析正则性的等价条件（扩展摘要）。算法I.-立方体包装。柔性作业车间问题的近似算法二叉搜索树对称更新的新行为。LCA问题再访。组合设计磁盘阵列中Steiner三元系的最优序和Pessimal序Packing设计和稀疏三元系的秩不等式反Oberwolfach解：完全图的泛圈2-因子分解。网络图，图论I。网络的图形结构：一个调查。多项式时间识别的Cup-Width？3图。关于无Dart-Free的完全收缩图的扩展抽象图论2边着色约化无差异图关于色多项式的两个猜想高效地查找倾斜分区。竞争分析，复杂性。-关于投资组合选择的竞争理论与实践（扩展摘要）。-几乎k-Wise独立性和硬布尔函数广义寻址函数同时消息复杂度的改进上界。算法II多参数最小生成树最优L-限制前缀码的线性时间识别环中的均匀多跳全对全光互连分布式最短路径的全动态算法计算数论，密码学。因式分解和离散对数。Diffie-Hellman密钥的通信复杂度和傅立叶系数。五次倒数和素数测试的形式的数字。视觉密码学中秘密共享方案的最佳对比度的确定算法分析I.矩形填料的平均情况分析广义Tries和Patricia Tries中的高度关于树上弧不相交路径路由排列的复杂性代数算法Subresultants Revisited.一个分析一类欧几里得算法的统一框架。最佳LLL算法的最坏情况复杂度。可计算性。迭代代数不是完全可公理化的。不可靠计算中的不可判定问题自动机，形式语言。具有反对合的自由半群中的方程及其与自由群中方程的关系平方传感器：决定传感器功能性和顺序性的有效程序。Unambient Buchi Automata.-通信受限的元胞自动机上的线性时间语言识别逻辑，编程理论。从语义到空间分布关于定量分支时间时序逻辑的表达性和复杂性。交互网络的运算等价理论算法分析2运行几何分布随机变量的统计。多维布朗游动局部时的广义协方差几何分布随机变量的组合学：上升序列的长度。
Random Structures and Algorithms.- Algorithmic Aspects of Regularity.- Small Maximal Matchings in Random Graphs.- Some Remarks on Sparsely Connected Isomorphism-Free Labeled Graphs.- Analysis of Edge Deletion Processes on Faulty Random Regular Graphs.- Equivalent Conditions for Regularity (Extended Abstract).- Algorithms I.- Cube Packing.- Approximation Algorithms for Flexible Job Shop Problems.- Emerging Behavior as Binary Search Trees Are Symmetrically Updated.- The LCA Problem Revisited.- Combinatorial Designs.- Optimal and Pessimal Orderings of Steiner Triple Systems in Disk Arrays.- Rank Inequalities for Packing Designs and Sparse Triple Systems.- The Anti-Oberwolfach Solution: Pancyclic 2-Factorizations of Complete Graphs.- Web Graph, Graph Theory I.- Graph Structure of the Web: A Survey.- Polynomial Time Recognition of Clique-Width ? 3 Graphs.- On Dart-Free Perfectly Contractile Graphs Extended Abstract.- Graph Theory II.- Edge Colouring Reduced Indifference Graphs.- Two Conjectures on the Chromatic Polynomial.- Finding Skew Partitions Efficiently.- Competitive Analysis, Complexity.- On the Competitive Theory and Practice of Portfolio Selection (Extended Abstract).- Almost k-Wise Independence and Hard Boolean Functions.- Improved Upper Bounds on the Simultaneous Messages Complexity of the Generalized Addressing Function.- Algorithms II.- Multi-parameter Minimum Spanning Trees.- Linear Time Recognition of Optimal L-Restricted Prefix Codes.- Uniform Multi-hop All-to-All Optical Routings in Rings.- A Fully Dynamic Algorithm for Distributed Shortest Paths.- Computational Number Theory, Cryptography.- Integer Factorization and Discrete Logarithms.- Communication Complexity and Fourier Coefficients of the Diffie-Hellman Key.- Quintic Reciprocity and Primality Test for Numbers of the Form .- Determining the Optimal Contrast for Secret Sharing Schemes in Visual Cryptography.- Analysis of Algorithms I.- Average-Case Analysis of Rectangle Packings.- Heights in Generalized Tries and PATRICIA Tries.- On the Complexity of Routing Permutations on Trees by Arc-Disjoint Paths Extended Abstract.- Algebraic Algorithms.- Subresultants Revisited.- A Unifying Framework for the Analysis of a Class of Euclidean Algorithms.- Worst-Case Complexity of the Optimal LLL Algorithm.- Computability.- Iteration Algebras Are Not Finitely Axiomatizable.- Undecidable Problems in Unreliable Computations.- Automata, Formal Languages.- Equations in Free Semigroups with Anti-involution and Their Relation to Equations in Free Groups.- Squaring Transducers: An Efficient Procedure for Deciding Functionality and Sequentiality of Transducers.- Unambiguous Buchi Automata.- Linear Time Language Recognition on Cellular Automata with Restricted Communication.- Logic, Programming Theory.- From Semantics to Spatial Distribution.- On the Expressivity and Complexity of Quantitative Branching-Time Temporal Logics.- A Theory of Operational Equivalence for Interaction Nets.- Analysis of Algorithms II.- Run Statistics for Geometrically Distributed Random Variables.- Generalized Covariances of Multi-dimensional Brownian Excursion Local Times.- Combinatorics of Geometrically Distributed Random Variables: Length of Ascending Runs.