A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Derivation of algorithms for cutwidth and related graph layout parameters
2009
Journal of computer and system sciences (Print)
Preserved Fulltext
Each of these asks for a linear ordering of the vertices of the graph (or can be formulated as such), and constructive linear time algorithms for the fixed parameter versions of the problems have been ...
In this paper, we investigate algorithms for some related graph parameters. ...
Thilikos, Starting with nondeterminism: The systematic derivation of linear-time graph layout algorithms, in: B. Rovan, P. ...
doi:10.1016/j.jcss.2008.10.003
fatcat:u3d52dqaongv7o5dxr7dzsw3im
Subject index volumes 1–200
1999
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
bounds, 164
on maximal flow algorithms, 291
time classes with linear alternation, 483
time complexities
gaps, temporal logic with -, 3048 time-optimal solution, 410 time-out, 2012 time-precision ...
, 344
the k-adjacent derivations, 3025
generator for a family of linear indexed languages,
622
generator of
a Horn spectrum, 1546
the family of context-free languages, 758
generator
problem, 1546 ...
doi:10.1016/s0304-3975(98)00319-3
fatcat:s22ud3iiqjht7lfbtc3zctk7zm
Extensible Extraction of Efficient Imperative Programs with Foreign Functions, Manually Managed Memory, and Proofs
[chapter]
2020
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The pipeline runs entirely within the Coq proof assistant, leading to final, linked assembly code with overall full-functional-correctness proofs in separation logic. ...
By mixing and matching these pieces of logic, users can easily tailor extraction to their own domains and programs, getting maximum performance and ensuring correctness of the resulting assembly code. ...
The views and conclusions contained herein are those of the authors and should not be interpreted as necessarily representing the official policies or endorsements, either expressed or implied, of DARPA ...
doi:10.1007/978-3-030-51054-1_7
fatcat:qwto3glvwrdgll6ffzzhvedmlq
6 — Program transformations
[chapter]
1981
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The result is Algorithm 2 (Graph-structured stack) For input a 1 . . . a n , let the sets U 1 , . . . , U n be all ∅. Create a node u labelled X initial . Let U 0 = {u}. ...
INTRODUCTION Algorithm 1 (Naive graph-structured stack) For input a 1 . . . a n , let the sets U 1 , . . . , U n be all ∅. Create a node u labelled X initial . Let U 0 = {u}. ...
because at every moment the amount of space needed is linear in the size of the forest. ...
doi:10.1007/3-540-10284-1_6
fatcat:es5rjudpajglpmkjzzwsqsipzy
Interactive record/replay for web application debugging
2013
Proceedings of the 26th annual ACM symposium on User interface software and technology - UIST '13
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
Together, the Dolos infrastructure and Timelapse developer tool support systematic bug reporting and debugging practices. which can be time-consuming and error-prone [36] . ...
In the case of interactive programs, even reproducing a failure can be difficult or impossible: failures can occur on mouse drag events, be time-dependent, or simply occur too infrequently for a developer ...
Any opinions, findings, and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the National Science Foundation. ...
doi:10.1145/2501988.2502050
dblp:conf/uist/BurgBKE13
fatcat:f3s6knuy4zbsjpzzeevrbs66va
Confronting Intractability via Parameters
[article]
2011
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Other Versions
One approach to confronting computational hardness is to try to understand the contribution of various parameters to the running time of algorithms and the complexity of computational tasks. ...
Such a theory should be able to address the needs of practicioners in algorithmics. The last twenty years have seen the development of such a theory. ...
An even faster algorithm can be designed if we exploit the fact that the k-Vertex Cover can be solved in linear time for graphs of maximum degree 2. ...
arXiv:1106.3161v6
fatcat:6eqwtzfmunffzokn47lqyb6xwq
Confronting intractability via parameters
2011
Computer Science Review
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
One approach to confronting computational hardness is to try to understand the contribution of various parameters to the running time of algorithms and the complexity of computational tasks. ...
Such a theory should be able to address the needs of practicioners in algorithmics. The last twenty years have seen the development of such a theory. ...
An even faster algorithm can be designed if we exploit the fact that the k-Vertex Cover can be solved in linear time for graphs of maximum degree 2. ...
doi:10.1016/j.cosrev.2011.09.002
fatcat:4efih5lobfbjdgyuu2ccbqlbbq
Operator precedence for data-dependent grammars
2016
Proceedings of the 2016 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation - PEPM 2016
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
grammar transformation that increases the size of the grammar, (3) preserves the shape of parse trees of the original, natural grammar, and (4) can deal with intricate cases of operator precedence found ...
In this paper we present an implementation of declarative specification of operator precedence for general parsing that (1) is independent of the underlying parsing algorithm, (2) does not require any ...
Acknowledgments We are thankful to Eelco Visser and the anonymous reviewers for their constructive feedback on earlier versions of this paper. ...
doi:10.1145/2847538.2847540
dblp:conf/pepm/AfroozehI16
fatcat:2ac6y43wsrakzdmvknqmezqj7e
DFG Research Training Group "Algorithmic Synthesis of Reactive and Discrete-Continuous Systems (AlgoSyn)"DFG-Graduiertenkolleg "Algorithmische Synthese reaktiver und diskret-kontinuierlicher Systeme (AlgoSyn)"
2009
it - Information Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Central issues are the establishment of system models that support algorithmic solutions, the combination of discrete and continuous parameters (in hybrid systems), and the exploration of applications. ...
Algorithmic program synthesis is possible in restricted scenarios, in particular in reactive multi-agent systems with low data complexity and in control systems. ...
, the administrative assistant of AlgoSyn. ...
doi:10.1524/itit.2009.0545
fatcat:lh6p234aajgfdhfze27zy33fpa
Lower bounds on kernelization
2011
Discrete Optimization
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
However the situation regarding systematic study changed drastically with the advent of parameterized complexity. ...
One of the reasons for this is that if an input to an N P -hard problem can be processed in polynomial time to an equivalent one of smaller size in general, then the preprocessing algorithm can be used ...
The basic reason for this was that if we seek to start with an instance I of an N P -hard problem and try to find an efficient polynomial time subroutine to replace I with an equivalent instance I with ...
doi:10.1016/j.disopt.2010.10.001
fatcat:kvbpwrhvjrf53fm5bisef7tg64
The Complexity of Design Automation Problems
[chapter]
1988
Handbook of Advanced Semiconductor Technology and Computer Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
In fact, it has been noted [NOYC77] that industry-wide, the design time (in man-hours per month) has been increasing exponentially with increasing levels of integration. ...
The concepts of complexity and nondeterminism are introduced and elaborated upon in Section 3. This section also includes other background material. ...
COMPLEXITY AND NONDETERMINISM
Complexity By the complexity of an algorithm, we mean the amount of computer time and memory space needed to run this algorithm. ...
doi:10.1007/978-94-011-7056-7_17
fatcat:muwhoo6fgvfdlmszv4wheza53q
The complexity of design automation problems
1980
Proceedings of the seventeenth design automation conference on Design automation - DAC '80
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
In fact, it has been noted [NOYC77] that industry-wide, the design time (in man-hours per month) has been increasing exponentially with increasing levels of integration. ...
The concepts of complexity and nondeterminism are introduced and elaborated upon in Section 3. This section also includes other background material. ...
COMPLEXITY AND NONDETERMINISM
Complexity By the complexity of an algorithm, we mean the amount of computer time and memory space needed to run this algorithm. ...
doi:10.1145/800139.804562
dblp:conf/dac/SahniB80
fatcat:h427snpf35gjdhub6ugvxkfpza
Complexity management in system-level design
1996
Journal of VLSI Signal Processing Systems for Signal, Image and Video Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2003; you can also visit the original URL.
The file type is application/pdf.
First, we present a framework for systematically managing the design process. ...
Typically, the designer needs to explore possible target architectures, experiment with different tools, and work with a range of constraints and optimization criteria. ...
One possibility is to use an exact (but time-consuming) integer-linear programming approach to determine the optimal mappings. ...
doi:10.1007/bf00925497
fatcat:fjd7u3bqobarldmfgeacwm6tju
Symbolic reachable set computation of piecewise affine hybrid automata and its application to biological modelling: Delta-Notch protein signalling
2004
IEE Proceedings - Systems Biology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
The algorithm is then implemented using MATLAB and QEPCAD, to compute reachable sets for the biologically observed equilibria of the multiple cell Delta-Notch protein signalling automaton with symbolic ...
This paper proposes an iterative refinement algorithm for computing discrete abstractions of a class of hybrid automata with piecewise affine continuous dynamics and forced discrete transitions, defined ...
The proposed abstraction algorithm uses a systematic way of computing transitions and exact symbolic solutions of the continuous differential equations to iteratively refine the partitions. ...
doi:10.1049/sb:20045019
pmid:17052127
fatcat:alhzgcl3xjds5mu73nmk25er6a
Subject Index to Volumes 1–75
2001
Information Processing Letters
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
, linear time algorithms, 689, 1077, 2074, 2087, 2278,
2341, 2499, 2503, 3295, 3506, 3542, 3796
linear time algorithms for
finding a maximum matching, 3200
graph search, 3737
linear time
and space ...
two, 1240
error correcting codes, 3961
linear expected
case time complexity, 552
run time, 570
linear expected time, 240, 328, 840, 959, 1534, 3334
algorithm, 1400
linear extension, 1038, 1365, ...
a matrix, 3196 order n matrices, 623 tensors, 719 the adjacency matrix of a line graph, 252 rank one matrices, 1164 matrix, 472 rank queries, 1761 r decision trees, 2406 rankable set, 3245 ranked, 1610 ...
doi:10.1016/s0020-0190(01)00175-2
fatcat:5y67tfm6yfbblakrus5nnhs73e
« Previous
Showing results 1 — 15 out of 183 results